./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/lockfree-3.3.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.3.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 1db117ae3c729419255b5da4a7f4ecd64b2d99a167d11f22266a773c4ff13cdb --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 18:33:03,683 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:33:03,689 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:33:03,722 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:33:03,731 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:33:03,733 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:33:03,735 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:33:03,741 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:33:03,742 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:33:03,748 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:33:03,749 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:33:03,751 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:33:03,752 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:33:03,756 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:33:03,758 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:33:03,759 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:33:03,759 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:33:03,760 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:33:03,761 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:33:03,763 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:33:03,764 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:33:03,765 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:33:03,766 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:33:03,766 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:33:03,767 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:33:03,769 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:33:03,772 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:33:03,775 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:33:03,776 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:33:03,776 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:33:03,777 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:33:03,777 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:33:03,778 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:33:03,779 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:33:03,780 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:33:03,782 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:33:03,782 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:33:03,782 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:33:03,783 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:33:03,783 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:33:03,784 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:33:03,785 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:33:03,787 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:33:03,817 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:33:03,817 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:33:03,817 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:33:03,818 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:33:03,818 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:33:03,819 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:33:03,819 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:33:03,820 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:33:03,820 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:33:03,821 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:33:03,821 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:33:03,821 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:33:03,821 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:33:03,821 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:33:03,822 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:33:03,822 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:33:03,822 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:33:03,822 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 18:33:03,822 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:33:03,823 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:33:03,824 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:33:03,824 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:33:03,824 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:33:03,824 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:33:03,824 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:33:03,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:33:03,825 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:33:03,825 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:33:03,825 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 18:33:03,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 18:33:03,826 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 -> 1db117ae3c729419255b5da4a7f4ecd64b2d99a167d11f22266a773c4ff13cdb [2022-07-12 18:33:04,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:33:04,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:33:04,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:33:04,131 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:33:04,132 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:33:04,134 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/lockfree-3.3.i [2022-07-12 18:33:04,188 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b00af896/853d9f7235554b68915e00b67ab57a3f/FLAG38a93ac36 [2022-07-12 18:33:04,691 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:33:04,692 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.3.i [2022-07-12 18:33:04,705 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b00af896/853d9f7235554b68915e00b67ab57a3f/FLAG38a93ac36 [2022-07-12 18:33:05,160 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b00af896/853d9f7235554b68915e00b67ab57a3f [2022-07-12 18:33:05,162 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:33:05,164 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:33:05,167 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:33:05,167 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:33:05,170 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:33:05,170 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:33:05" (1/1) ... [2022-07-12 18:33:05,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64d5b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:05, skipping insertion in model container [2022-07-12 18:33:05,171 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:33:05" (1/1) ... [2022-07-12 18:33:05,179 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:33:05,206 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:33:05,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:33:05,519 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 18:33:05,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:33:05,605 INFO L208 MainTranslator]: Completed translation [2022-07-12 18:33:05,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:05 WrapperNode [2022-07-12 18:33:05,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:33:05,606 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 18:33:05,607 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 18:33:05,608 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 18:33:05,614 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:33:05" (1/1) ... [2022-07-12 18:33:05,640 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:33:05" (1/1) ... [2022-07-12 18:33:05,658 INFO L137 Inliner]: procedures = 125, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 125 [2022-07-12 18:33:05,661 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 18:33:05,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 18:33:05,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 18:33:05,663 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 18:33:05,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:05" (1/1) ... [2022-07-12 18:33:05,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:05" (1/1) ... [2022-07-12 18:33:05,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:05" (1/1) ... [2022-07-12 18:33:05,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:05" (1/1) ... [2022-07-12 18:33:05,688 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:05" (1/1) ... [2022-07-12 18:33:05,692 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:05" (1/1) ... [2022-07-12 18:33:05,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:05" (1/1) ... [2022-07-12 18:33:05,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 18:33:05,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 18:33:05,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 18:33:05,697 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 18:33:05,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:05" (1/1) ... [2022-07-12 18:33:05,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:33:05,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:33:05,732 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:33:05,733 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:33:05,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 18:33:05,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 18:33:05,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 18:33:05,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 18:33:05,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 18:33:05,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 18:33:05,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 18:33:05,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 18:33:05,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 18:33:05,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 18:33:05,876 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 18:33:05,878 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 18:33:06,188 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 18:33:06,205 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 18:33:06,207 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 18:33:06,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:33:06 BoogieIcfgContainer [2022-07-12 18:33:06,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 18:33:06,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 18:33:06,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 18:33:06,215 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 18:33:06,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:33:05" (1/3) ... [2022-07-12 18:33:06,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@548529b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:33:06, skipping insertion in model container [2022-07-12 18:33:06,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:05" (2/3) ... [2022-07-12 18:33:06,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@548529b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:33:06, skipping insertion in model container [2022-07-12 18:33:06,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:33:06" (3/3) ... [2022-07-12 18:33:06,218 INFO L111 eAbstractionObserver]: Analyzing ICFG lockfree-3.3.i [2022-07-12 18:33:06,231 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 18:33:06,231 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-07-12 18:33:06,289 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 18:33:06,296 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@5646a183, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3ce3c5d [2022-07-12 18:33:06,297 INFO L358 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2022-07-12 18:33:06,301 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:33:06,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-12 18:33:06,318 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:06,319 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-12 18:33:06,319 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:33:06,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:06,325 INFO L85 PathProgramCache]: Analyzing trace with hash 28819106, now seen corresponding path program 1 times [2022-07-12 18:33:06,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:33:06,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204937981] [2022-07-12 18:33:06,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:06,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:33:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:06,496 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:33:06,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:33:06,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204937981] [2022-07-12 18:33:06,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204937981] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:33:06,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:33:06,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:33:06,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474876607] [2022-07-12 18:33:06,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:33:06,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 18:33:06,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:33:06,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 18:33:06,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 18:33:06,539 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:33:06,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:06,561 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2022-07-12 18:33:06,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 18:33:06,563 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:33:06,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:06,571 INFO L225 Difference]: With dead ends: 64 [2022-07-12 18:33:06,572 INFO L226 Difference]: Without dead ends: 62 [2022-07-12 18:33:06,573 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:33:06,576 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:33:06,577 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:33:06,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-12 18:33:06,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-07-12 18:33:06,606 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:33:06,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2022-07-12 18:33:06,611 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 5 [2022-07-12 18:33:06,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:06,615 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2022-07-12 18:33:06,615 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:33:06,615 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2022-07-12 18:33:06,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 18:33:06,616 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:06,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:06,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 18:33:06,618 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:33:06,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:06,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1806851052, now seen corresponding path program 1 times [2022-07-12 18:33:06,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:33:06,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667053823] [2022-07-12 18:33:06,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:06,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:33:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:06,670 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:33:06,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:33:06,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667053823] [2022-07-12 18:33:06,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667053823] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:33:06,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:33:06,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:33:06,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157910214] [2022-07-12 18:33:06,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:33:06,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:33:06,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:33:06,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:33:06,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:33:06,677 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:33:06,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:06,702 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-07-12 18:33:06,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:33:06,703 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:33:06,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:06,705 INFO L225 Difference]: With dead ends: 63 [2022-07-12 18:33:06,706 INFO L226 Difference]: Without dead ends: 63 [2022-07-12 18:33:06,706 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:33:06,707 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:33:06,708 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:33:06,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-12 18:33:06,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-07-12 18:33:06,715 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:33:06,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2022-07-12 18:33:06,717 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 7 [2022-07-12 18:33:06,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:06,717 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2022-07-12 18:33:06,718 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:33:06,718 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2022-07-12 18:33:06,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 18:33:06,720 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:06,721 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:06,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 18:33:06,722 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:33:06,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:06,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1806910634, now seen corresponding path program 1 times [2022-07-12 18:33:06,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:33:06,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779222368] [2022-07-12 18:33:06,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:06,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:33:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:06,768 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:33:06,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:33:06,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779222368] [2022-07-12 18:33:06,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779222368] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:33:06,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:33:06,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:33:06,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942255875] [2022-07-12 18:33:06,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:33:06,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:33:06,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:33:06,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:33:06,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:33:06,772 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:33:06,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:06,799 INFO L93 Difference]: Finished difference Result 111 states and 145 transitions. [2022-07-12 18:33:06,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:33:06,800 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:33:06,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:06,801 INFO L225 Difference]: With dead ends: 111 [2022-07-12 18:33:06,802 INFO L226 Difference]: Without dead ends: 111 [2022-07-12 18:33:06,802 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:33:06,803 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:33:06,804 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:33:06,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-12 18:33:06,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 93. [2022-07-12 18:33:06,812 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:33:06,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 137 transitions. [2022-07-12 18:33:06,815 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 137 transitions. Word has length 7 [2022-07-12 18:33:06,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:06,815 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 137 transitions. [2022-07-12 18:33:06,818 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:33:06,818 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 137 transitions. [2022-07-12 18:33:06,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 18:33:06,818 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:06,819 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:06,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 18:33:06,819 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:33:06,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:06,820 INFO L85 PathProgramCache]: Analyzing trace with hash 177749355, now seen corresponding path program 1 times [2022-07-12 18:33:06,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:33:06,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703994468] [2022-07-12 18:33:06,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:06,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:33:06,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:06,885 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:33:06,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:33:06,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703994468] [2022-07-12 18:33:06,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703994468] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:33:06,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:33:06,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:33:06,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075617074] [2022-07-12 18:33:06,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:33:06,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:33:06,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:33:06,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:33:06,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:33:06,888 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:33:06,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:06,931 INFO L93 Difference]: Finished difference Result 148 states and 212 transitions. [2022-07-12 18:33:06,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:33:06,931 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:33:06,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:06,932 INFO L225 Difference]: With dead ends: 148 [2022-07-12 18:33:06,933 INFO L226 Difference]: Without dead ends: 148 [2022-07-12 18:33:06,933 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:33:06,934 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 44 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:06,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 209 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:33:06,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-07-12 18:33:06,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 127. [2022-07-12 18:33:06,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 107 states have (on average 1.841121495327103) internal successors, (197), 126 states have internal predecessors, (197), 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:06,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 197 transitions. [2022-07-12 18:33:06,945 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 197 transitions. Word has length 8 [2022-07-12 18:33:06,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:06,945 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 197 transitions. [2022-07-12 18:33:06,946 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:33:06,946 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 197 transitions. [2022-07-12 18:33:06,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 18:33:06,946 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:06,946 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:06,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 18:33:06,947 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:33:06,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:06,948 INFO L85 PathProgramCache]: Analyzing trace with hash 179653412, now seen corresponding path program 1 times [2022-07-12 18:33:06,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:33:06,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64705818] [2022-07-12 18:33:06,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:06,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:33:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:06,978 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:33:06,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:33:06,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64705818] [2022-07-12 18:33:06,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64705818] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:33:06,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:33:06,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:33:06,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237145335] [2022-07-12 18:33:06,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:33:06,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:33:06,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:33:06,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:33:06,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:33:06,981 INFO L87 Difference]: Start difference. First operand 127 states and 197 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:33:07,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:07,042 INFO L93 Difference]: Finished difference Result 209 states and 319 transitions. [2022-07-12 18:33:07,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:33:07,043 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:33:07,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:07,044 INFO L225 Difference]: With dead ends: 209 [2022-07-12 18:33:07,046 INFO L226 Difference]: Without dead ends: 206 [2022-07-12 18:33:07,047 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:33:07,048 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:07,049 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.1s Time] [2022-07-12 18:33:07,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-12 18:33:07,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 185. [2022-07-12 18:33:07,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 165 states have (on average 1.8363636363636364) internal successors, (303), 184 states have internal predecessors, (303), 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:07,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 303 transitions. [2022-07-12 18:33:07,060 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 303 transitions. Word has length 8 [2022-07-12 18:33:07,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:07,061 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 303 transitions. [2022-07-12 18:33:07,061 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:33:07,061 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 303 transitions. [2022-07-12 18:33:07,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 18:33:07,061 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:07,062 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:07,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 18:33:07,062 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:33:07,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:07,063 INFO L85 PathProgramCache]: Analyzing trace with hash 179596397, now seen corresponding path program 1 times [2022-07-12 18:33:07,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:33:07,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812248640] [2022-07-12 18:33:07,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:07,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:33:07,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:07,109 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:33:07,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:33:07,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812248640] [2022-07-12 18:33:07,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812248640] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:33:07,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:33:07,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:33:07,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540780581] [2022-07-12 18:33:07,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:33:07,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:33:07,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:33:07,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:33:07,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:33:07,112 INFO L87 Difference]: Start difference. First operand 185 states and 303 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:33:07,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:07,180 INFO L93 Difference]: Finished difference Result 261 states and 411 transitions. [2022-07-12 18:33:07,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:33:07,181 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:33:07,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:07,182 INFO L225 Difference]: With dead ends: 261 [2022-07-12 18:33:07,185 INFO L226 Difference]: Without dead ends: 261 [2022-07-12 18:33:07,193 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:33:07,194 INFO L413 NwaCegarLoop]: 120 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, 171 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:33:07,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 171 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:33:07,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-07-12 18:33:07,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 240. [2022-07-12 18:33:07,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 222 states have (on average 1.7882882882882882) internal successors, (397), 239 states have internal predecessors, (397), 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:07,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 397 transitions. [2022-07-12 18:33:07,244 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 397 transitions. Word has length 8 [2022-07-12 18:33:07,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:07,244 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 397 transitions. [2022-07-12 18:33:07,245 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:33:07,245 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 397 transitions. [2022-07-12 18:33:07,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 18:33:07,245 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:07,245 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:07,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 18:33:07,246 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:33:07,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:07,246 INFO L85 PathProgramCache]: Analyzing trace with hash 179596398, now seen corresponding path program 1 times [2022-07-12 18:33:07,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:33:07,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139452837] [2022-07-12 18:33:07,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:07,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:33:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:07,304 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:33:07,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:33:07,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139452837] [2022-07-12 18:33:07,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139452837] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:33:07,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:33:07,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:33:07,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872763930] [2022-07-12 18:33:07,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:33:07,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:33:07,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:33:07,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:33:07,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:33:07,307 INFO L87 Difference]: Start difference. First operand 240 states and 397 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:33:07,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:07,369 INFO L93 Difference]: Finished difference Result 256 states and 402 transitions. [2022-07-12 18:33:07,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:33:07,372 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:33:07,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:07,374 INFO L225 Difference]: With dead ends: 256 [2022-07-12 18:33:07,374 INFO L226 Difference]: Without dead ends: 256 [2022-07-12 18:33:07,374 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:33:07,376 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:07,376 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.1s Time] [2022-07-12 18:33:07,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-07-12 18:33:07,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 238. [2022-07-12 18:33:07,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 222 states have (on average 1.7522522522522523) internal successors, (389), 237 states have internal predecessors, (389), 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:07,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 389 transitions. [2022-07-12 18:33:07,411 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 389 transitions. Word has length 8 [2022-07-12 18:33:07,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:07,412 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 389 transitions. [2022-07-12 18:33:07,412 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:33:07,412 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 389 transitions. [2022-07-12 18:33:07,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 18:33:07,412 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:07,412 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:07,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 18:33:07,413 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:33:07,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:07,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1272529015, now seen corresponding path program 1 times [2022-07-12 18:33:07,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:33:07,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509888688] [2022-07-12 18:33:07,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:07,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:33:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:07,441 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:33:07,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:33:07,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509888688] [2022-07-12 18:33:07,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509888688] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:33:07,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:33:07,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:33:07,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495459453] [2022-07-12 18:33:07,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:33:07,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:33:07,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:33:07,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:33:07,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:33:07,444 INFO L87 Difference]: Start difference. First operand 238 states and 389 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:33:07,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:07,474 INFO L93 Difference]: Finished difference Result 297 states and 423 transitions. [2022-07-12 18:33:07,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:33:07,474 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:33:07,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:07,476 INFO L225 Difference]: With dead ends: 297 [2022-07-12 18:33:07,476 INFO L226 Difference]: Without dead ends: 297 [2022-07-12 18:33:07,476 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:33:07,477 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:33:07,477 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:33:07,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-07-12 18:33:07,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 195. [2022-07-12 18:33:07,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 183 states have (on average 1.6994535519125684) internal successors, (311), 194 states have internal predecessors, (311), 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:07,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 311 transitions. [2022-07-12 18:33:07,495 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 311 transitions. Word has length 9 [2022-07-12 18:33:07,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:07,495 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 311 transitions. [2022-07-12 18:33:07,495 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:33:07,496 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 311 transitions. [2022-07-12 18:33:07,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 18:33:07,496 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:07,496 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:07,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 18:33:07,496 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:33:07,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:07,497 INFO L85 PathProgramCache]: Analyzing trace with hash 845049582, now seen corresponding path program 1 times [2022-07-12 18:33:07,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:33:07,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841772579] [2022-07-12 18:33:07,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:07,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:33:07,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:07,545 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:33:07,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:33:07,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841772579] [2022-07-12 18:33:07,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841772579] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:33:07,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:33:07,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:33:07,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581311993] [2022-07-12 18:33:07,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:33:07,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:33:07,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:33:07,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:33:07,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:33:07,547 INFO L87 Difference]: Start difference. First operand 195 states and 311 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:33:07,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:07,573 INFO L93 Difference]: Finished difference Result 418 states and 615 transitions. [2022-07-12 18:33:07,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:33:07,574 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:33:07,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:07,576 INFO L225 Difference]: With dead ends: 418 [2022-07-12 18:33:07,576 INFO L226 Difference]: Without dead ends: 418 [2022-07-12 18:33:07,577 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:33:07,578 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 107 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:07,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 236 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:33:07,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2022-07-12 18:33:07,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 278. [2022-07-12 18:33:07,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 266 states have (on average 1.6090225563909775) internal successors, (428), 277 states have internal predecessors, (428), 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:07,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 428 transitions. [2022-07-12 18:33:07,586 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 428 transitions. Word has length 10 [2022-07-12 18:33:07,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:07,586 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 428 transitions. [2022-07-12 18:33:07,586 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:33:07,587 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 428 transitions. [2022-07-12 18:33:07,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 18:33:07,587 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:07,587 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:07,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 18:33:07,588 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:33:07,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:07,589 INFO L85 PathProgramCache]: Analyzing trace with hash 22246394, now seen corresponding path program 1 times [2022-07-12 18:33:07,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:33:07,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928727631] [2022-07-12 18:33:07,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:07,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:33:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:07,654 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:33:07,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:33:07,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928727631] [2022-07-12 18:33:07,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928727631] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:33:07,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532907900] [2022-07-12 18:33:07,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:07,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:33:07,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:33:07,658 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:33:07,660 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:33:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:07,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 18:33:07,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:07,811 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:33:07,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:07,877 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:33:07,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532907900] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:07,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:33:07,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-12 18:33:07,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617102656] [2022-07-12 18:33:07,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:07,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:33:07,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:33:07,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:33:07,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:33:07,880 INFO L87 Difference]: Start difference. First operand 278 states and 428 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:33:07,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:07,916 INFO L93 Difference]: Finished difference Result 282 states and 418 transitions. [2022-07-12 18:33:07,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:33:07,917 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:33:07,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:07,919 INFO L225 Difference]: With dead ends: 282 [2022-07-12 18:33:07,919 INFO L226 Difference]: Without dead ends: 282 [2022-07-12 18:33:07,919 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:33:07,920 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 231 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 289 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:07,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 289 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:07,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-07-12 18:33:07,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 274. [2022-07-12 18:33:07,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 262 states have (on average 1.5877862595419847) internal successors, (416), 273 states have internal predecessors, (416), 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:07,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 416 transitions. [2022-07-12 18:33:07,927 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 416 transitions. Word has length 16 [2022-07-12 18:33:07,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:07,927 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 416 transitions. [2022-07-12 18:33:07,927 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:33:07,928 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 416 transitions. [2022-07-12 18:33:07,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 18:33:07,928 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:07,928 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:07,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 18:33:08,154 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:33:08,154 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:33:08,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:08,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1902356162, now seen corresponding path program 1 times [2022-07-12 18:33:08,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:33:08,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715056438] [2022-07-12 18:33:08,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:08,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:33:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:08,229 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:33:08,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:33:08,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715056438] [2022-07-12 18:33:08,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715056438] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:33:08,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872908031] [2022-07-12 18:33:08,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:08,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:33:08,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:33:08,236 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:33:08,246 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:33:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:08,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 18:33:08,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:08,331 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:33:08,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:08,362 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:33:08,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872908031] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:08,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:33:08,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-07-12 18:33:08,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096342363] [2022-07-12 18:33:08,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:08,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:33:08,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:33:08,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:33:08,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:33:08,365 INFO L87 Difference]: Start difference. First operand 274 states and 416 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:33:08,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:08,422 INFO L93 Difference]: Finished difference Result 613 states and 869 transitions. [2022-07-12 18:33:08,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:33:08,423 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:33:08,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:08,425 INFO L225 Difference]: With dead ends: 613 [2022-07-12 18:33:08,425 INFO L226 Difference]: Without dead ends: 613 [2022-07-12 18:33:08,426 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:33:08,426 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 295 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:08,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 472 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:33:08,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2022-07-12 18:33:08,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 387. [2022-07-12 18:33:08,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 375 states have (on average 1.5333333333333334) internal successors, (575), 386 states have internal predecessors, (575), 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:08,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 575 transitions. [2022-07-12 18:33:08,436 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 575 transitions. Word has length 16 [2022-07-12 18:33:08,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:08,437 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 575 transitions. [2022-07-12 18:33:08,437 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:33:08,437 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 575 transitions. [2022-07-12 18:33:08,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 18:33:08,438 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:08,438 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:08,463 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:33:08,657 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:33:08,657 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:33:08,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:08,658 INFO L85 PathProgramCache]: Analyzing trace with hash 53823374, now seen corresponding path program 2 times [2022-07-12 18:33:08,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:33:08,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382701731] [2022-07-12 18:33:08,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:08,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:33:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:08,713 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:33:08,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:33:08,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382701731] [2022-07-12 18:33:08,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382701731] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:33:08,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4861845] [2022-07-12 18:33:08,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:33:08,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:33:08,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:33:08,716 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:33:08,717 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:33:08,779 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:33:08,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:33:08,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 18:33:08,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:08,885 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:33:08,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:08,926 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:33:08,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4861845] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:08,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:33:08,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 9 [2022-07-12 18:33:08,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854638985] [2022-07-12 18:33:08,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:08,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:33:08,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:33:08,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:33:08,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:33:08,929 INFO L87 Difference]: Start difference. First operand 387 states and 575 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 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:33:09,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:09,031 INFO L93 Difference]: Finished difference Result 831 states and 1155 transitions. [2022-07-12 18:33:09,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 18:33:09,032 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 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 22 [2022-07-12 18:33:09,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:09,035 INFO L225 Difference]: With dead ends: 831 [2022-07-12 18:33:09,035 INFO L226 Difference]: Without dead ends: 831 [2022-07-12 18:33:09,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:33:09,036 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 446 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:09,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 601 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:33:09,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2022-07-12 18:33:09,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 468. [2022-07-12 18:33:09,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 456 states have (on average 1.5043859649122806) internal successors, (686), 467 states have internal predecessors, (686), 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:09,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 686 transitions. [2022-07-12 18:33:09,049 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 686 transitions. Word has length 22 [2022-07-12 18:33:09,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:09,049 INFO L495 AbstractCegarLoop]: Abstraction has 468 states and 686 transitions. [2022-07-12 18:33:09,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 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:33:09,049 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 686 transitions. [2022-07-12 18:33:09,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 18:33:09,050 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:09,050 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:09,072 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:33:09,263 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:33:09,264 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:33:09,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:09,264 INFO L85 PathProgramCache]: Analyzing trace with hash -2107196217, now seen corresponding path program 1 times [2022-07-12 18:33:09,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:33:09,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953975814] [2022-07-12 18:33:09,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:09,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:33:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:09,322 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:33:09,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:33:09,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953975814] [2022-07-12 18:33:09,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953975814] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:33:09,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039103439] [2022-07-12 18:33:09,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:09,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:33:09,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:33:09,325 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:33:09,326 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:33:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:09,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 18:33:09,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:09,423 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:33:09,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:09,463 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:33:09,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039103439] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:09,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:33:09,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2022-07-12 18:33:09,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867420396] [2022-07-12 18:33:09,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:09,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:33:09,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:33:09,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:33:09,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:33:09,466 INFO L87 Difference]: Start difference. First operand 468 states and 686 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:33:09,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:09,524 INFO L93 Difference]: Finished difference Result 1116 states and 1618 transitions. [2022-07-12 18:33:09,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:33:09,526 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:33:09,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:09,530 INFO L225 Difference]: With dead ends: 1116 [2022-07-12 18:33:09,530 INFO L226 Difference]: Without dead ends: 1116 [2022-07-12 18:33:09,530 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:33:09,531 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 173 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:09,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 163 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:33:09,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2022-07-12 18:33:09,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 995. [2022-07-12 18:33:09,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 983 states have (on average 1.4933875890132249) internal successors, (1468), 994 states have internal predecessors, (1468), 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:09,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1468 transitions. [2022-07-12 18:33:09,552 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1468 transitions. Word has length 24 [2022-07-12 18:33:09,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:09,552 INFO L495 AbstractCegarLoop]: Abstraction has 995 states and 1468 transitions. [2022-07-12 18:33:09,552 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:33:09,553 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1468 transitions. [2022-07-12 18:33:09,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 18:33:09,553 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:09,554 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:33:09,581 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:33:09,775 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:33:09,775 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:09,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:09,776 INFO L85 PathProgramCache]: Analyzing trace with hash -6965384, now seen corresponding path program 1 times [2022-07-12 18:33:09,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:33:09,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344499291] [2022-07-12 18:33:09,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:09,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:33:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:09,848 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:33:09,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:33:09,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344499291] [2022-07-12 18:33:09,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344499291] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:33:09,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289232504] [2022-07-12 18:33:09,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:09,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:33:09,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:33:09,850 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:33:09,852 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:33:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:09,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 18:33:09,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:09,955 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:33:09,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:09,998 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:33:09,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289232504] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:09,999 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:33:09,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-07-12 18:33:09,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061199158] [2022-07-12 18:33:10,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:10,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 18:33:10,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:33:10,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 18:33:10,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:33:10,001 INFO L87 Difference]: Start difference. First operand 995 states and 1468 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:33:10,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:10,145 INFO L93 Difference]: Finished difference Result 3487 states and 4850 transitions. [2022-07-12 18:33:10,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 18:33:10,145 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:33:10,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:10,157 INFO L225 Difference]: With dead ends: 3487 [2022-07-12 18:33:10,157 INFO L226 Difference]: Without dead ends: 3487 [2022-07-12 18:33:10,158 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:33:10,158 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 441 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:10,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 554 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:33:10,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3487 states. [2022-07-12 18:33:10,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3487 to 2363. [2022-07-12 18:33:10,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2363 states, 2351 states have (on average 1.4427903019991493) internal successors, (3392), 2362 states have internal predecessors, (3392), 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:10,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3392 transitions. [2022-07-12 18:33:10,210 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3392 transitions. Word has length 27 [2022-07-12 18:33:10,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:10,210 INFO L495 AbstractCegarLoop]: Abstraction has 2363 states and 3392 transitions. [2022-07-12 18:33:10,211 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:33:10,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3392 transitions. [2022-07-12 18:33:10,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 18:33:10,212 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:10,212 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:10,239 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:33:10,436 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:33:10,437 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:33:10,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:10,437 INFO L85 PathProgramCache]: Analyzing trace with hash 334990594, now seen corresponding path program 1 times [2022-07-12 18:33:10,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:33:10,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434108995] [2022-07-12 18:33:10,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:10,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:33:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:10,502 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:33:10,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:33:10,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434108995] [2022-07-12 18:33:10,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434108995] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:33:10,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135388571] [2022-07-12 18:33:10,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:10,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:33:10,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:33:10,506 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:33:10,508 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:33:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:10,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 18:33:10,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:10,615 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:33:10,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:10,650 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:33:10,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135388571] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:10,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:33:10,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2022-07-12 18:33:10,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117965029] [2022-07-12 18:33:10,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:10,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:33:10,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:33:10,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:33:10,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:33:10,653 INFO L87 Difference]: Start difference. First operand 2363 states and 3392 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:33:10,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:10,724 INFO L93 Difference]: Finished difference Result 1756 states and 2405 transitions. [2022-07-12 18:33:10,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:33:10,724 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:33:10,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:10,730 INFO L225 Difference]: With dead ends: 1756 [2022-07-12 18:33:10,731 INFO L226 Difference]: Without dead ends: 1756 [2022-07-12 18:33:10,731 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:33:10,732 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 346 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:10,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 532 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:33:10,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2022-07-12 18:33:10,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1081. [2022-07-12 18:33:10,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 1069 states have (on average 1.4069223573433116) internal successors, (1504), 1080 states have internal predecessors, (1504), 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:10,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1504 transitions. [2022-07-12 18:33:10,758 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1504 transitions. Word has length 27 [2022-07-12 18:33:10,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:10,758 INFO L495 AbstractCegarLoop]: Abstraction has 1081 states and 1504 transitions. [2022-07-12 18:33:10,758 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:33:10,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1504 transitions. [2022-07-12 18:33:10,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 18:33:10,760 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:10,760 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:33:10,790 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:33:10,985 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:33:10,985 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:10,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:10,986 INFO L85 PathProgramCache]: Analyzing trace with hash 2001409998, now seen corresponding path program 1 times [2022-07-12 18:33:10,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:33:10,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676841184] [2022-07-12 18:33:10,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:10,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:33:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:11,054 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:33:11,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:33:11,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676841184] [2022-07-12 18:33:11,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676841184] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:33:11,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793853416] [2022-07-12 18:33:11,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:11,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:33:11,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:33:11,057 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:33:11,084 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:33:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:11,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 18:33:11,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:11,241 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:33:11,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:11,303 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:33:11,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793853416] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:11,303 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:33:11,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 13 [2022-07-12 18:33:11,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968767656] [2022-07-12 18:33:11,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:11,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 18:33:11,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:33:11,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 18:33:11,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:33:11,305 INFO L87 Difference]: Start difference. First operand 1081 states and 1504 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:33:11,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:11,629 INFO L93 Difference]: Finished difference Result 3000 states and 3991 transitions. [2022-07-12 18:33:11,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 18:33:11,630 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:33:11,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:11,639 INFO L225 Difference]: With dead ends: 3000 [2022-07-12 18:33:11,639 INFO L226 Difference]: Without dead ends: 3000 [2022-07-12 18:33:11,640 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:33:11,640 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 1176 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1176 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:11,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1176 Valid, 1056 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:33:11,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2022-07-12 18:33:11,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 1204. [2022-07-12 18:33:11,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 1192 states have (on average 1.4236577181208054) internal successors, (1697), 1203 states have internal predecessors, (1697), 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:11,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1697 transitions. [2022-07-12 18:33:11,674 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1697 transitions. Word has length 51 [2022-07-12 18:33:11,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:11,674 INFO L495 AbstractCegarLoop]: Abstraction has 1204 states and 1697 transitions. [2022-07-12 18:33:11,675 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:33:11,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1697 transitions. [2022-07-12 18:33:11,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-12 18:33:11,676 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:11,676 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:33:11,703 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:33:11,891 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:33:11,892 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:11,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:11,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1426339750, now seen corresponding path program 1 times [2022-07-12 18:33:11,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:33:11,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228789787] [2022-07-12 18:33:11,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:11,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:33:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:11,979 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:33:11,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:33:11,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228789787] [2022-07-12 18:33:11,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228789787] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:33:11,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986281802] [2022-07-12 18:33:11,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:11,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:33:11,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:33:11,981 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:33:11,983 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:33:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:12,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 18:33:12,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:12,117 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:33:12,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:12,159 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:33:12,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986281802] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 18:33:12,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:33:12,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 13 [2022-07-12 18:33:12,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497988248] [2022-07-12 18:33:12,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:33:12,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:33:12,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:33:12,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:33:12,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:33:12,161 INFO L87 Difference]: Start difference. First operand 1204 states and 1697 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:33:12,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:12,272 INFO L93 Difference]: Finished difference Result 2838 states and 3879 transitions. [2022-07-12 18:33:12,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:33:12,272 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:33:12,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:12,281 INFO L225 Difference]: With dead ends: 2838 [2022-07-12 18:33:12,281 INFO L226 Difference]: Without dead ends: 2838 [2022-07-12 18:33:12,282 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:33:12,282 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 269 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:12,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 385 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:33:12,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2838 states. [2022-07-12 18:33:12,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2838 to 2004. [2022-07-12 18:33:12,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2004 states, 1992 states have (on average 1.3995983935742973) internal successors, (2788), 2003 states have internal predecessors, (2788), 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:12,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 2004 states and 2788 transitions. [2022-07-12 18:33:12,336 INFO L78 Accepts]: Start accepts. Automaton has 2004 states and 2788 transitions. Word has length 59 [2022-07-12 18:33:12,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:12,336 INFO L495 AbstractCegarLoop]: Abstraction has 2004 states and 2788 transitions. [2022-07-12 18:33:12,336 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:33:12,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2004 states and 2788 transitions. [2022-07-12 18:33:12,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-12 18:33:12,337 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:12,338 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:33:12,367 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:33:12,564 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:33:12,565 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:33:12,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:12,566 INFO L85 PathProgramCache]: Analyzing trace with hash -443713253, now seen corresponding path program 1 times [2022-07-12 18:33:12,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:33:12,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077195775] [2022-07-12 18:33:12,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:12,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:33:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:12,623 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:33:12,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:33:12,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077195775] [2022-07-12 18:33:12,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077195775] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:33:12,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063094744] [2022-07-12 18:33:12,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:12,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:33:12,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:33:12,626 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:33:12,627 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:33:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:12,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 18:33:12,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:12,778 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:33:12,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:12,820 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:33:12,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063094744] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:12,821 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:33:12,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 12 [2022-07-12 18:33:12,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205205114] [2022-07-12 18:33:12,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:12,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 18:33:12,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:33:12,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 18:33:12,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:33:12,822 INFO L87 Difference]: Start difference. First operand 2004 states and 2788 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:33:13,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:13,926 INFO L93 Difference]: Finished difference Result 11354 states and 15589 transitions. [2022-07-12 18:33:13,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-12 18:33:13,926 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:33:13,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:13,962 INFO L225 Difference]: With dead ends: 11354 [2022-07-12 18:33:13,963 INFO L226 Difference]: Without dead ends: 11354 [2022-07-12 18:33:13,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=631, Invalid=2021, Unknown=0, NotChecked=0, Total=2652 [2022-07-12 18:33:13,964 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 1148 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1148 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:13,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1148 Valid, 801 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 18:33:13,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11354 states. [2022-07-12 18:33:14,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11354 to 5913. [2022-07-12 18:33:14,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5913 states, 5902 states have (on average 1.423246357167062) internal successors, (8400), 5912 states have internal predecessors, (8400), 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:14,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5913 states to 5913 states and 8400 transitions. [2022-07-12 18:33:14,125 INFO L78 Accepts]: Start accepts. Automaton has 5913 states and 8400 transitions. Word has length 59 [2022-07-12 18:33:14,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:14,126 INFO L495 AbstractCegarLoop]: Abstraction has 5913 states and 8400 transitions. [2022-07-12 18:33:14,126 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:33:14,126 INFO L276 IsEmpty]: Start isEmpty. Operand 5913 states and 8400 transitions. [2022-07-12 18:33:14,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-12 18:33:14,127 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:14,128 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:33:14,155 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:33:14,352 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:33:14,353 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:33:14,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:14,353 INFO L85 PathProgramCache]: Analyzing trace with hash -791217300, now seen corresponding path program 1 times [2022-07-12 18:33:14,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:33:14,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646862647] [2022-07-12 18:33:14,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:14,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:33:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:14,442 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:33:14,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:33:14,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646862647] [2022-07-12 18:33:14,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646862647] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:33:14,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189753393] [2022-07-12 18:33:14,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:14,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:33:14,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:33:14,444 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:33:14,470 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:33:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:14,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 18:33:14,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:14,615 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:33:14,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:14,682 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:33:14,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189753393] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:14,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:33:14,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 14 [2022-07-12 18:33:14,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607331333] [2022-07-12 18:33:14,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:14,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 18:33:14,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:33:14,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 18:33:14,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:33:14,687 INFO L87 Difference]: Start difference. First operand 5913 states and 8400 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:33:15,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:15,244 INFO L93 Difference]: Finished difference Result 13135 states and 18181 transitions. [2022-07-12 18:33:15,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-12 18:33:15,245 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:33:15,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:15,272 INFO L225 Difference]: With dead ends: 13135 [2022-07-12 18:33:15,272 INFO L226 Difference]: Without dead ends: 13135 [2022-07-12 18:33:15,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=407, Invalid=1233, Unknown=0, NotChecked=0, Total=1640 [2022-07-12 18:33:15,274 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 1173 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1173 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:15,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1173 Valid, 1196 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:33:15,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13135 states. [2022-07-12 18:33:15,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13135 to 5663. [2022-07-12 18:33:15,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5663 states, 5652 states have (on average 1.3982661004953998) internal successors, (7903), 5662 states have internal predecessors, (7903), 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:15,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5663 states to 5663 states and 7903 transitions. [2022-07-12 18:33:15,428 INFO L78 Accepts]: Start accepts. Automaton has 5663 states and 7903 transitions. Word has length 63 [2022-07-12 18:33:15,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:15,428 INFO L495 AbstractCegarLoop]: Abstraction has 5663 states and 7903 transitions. [2022-07-12 18:33:15,428 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:33:15,428 INFO L276 IsEmpty]: Start isEmpty. Operand 5663 states and 7903 transitions. [2022-07-12 18:33:15,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-12 18:33:15,430 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:15,430 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:33:15,457 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:33:15,643 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:33:15,643 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:33:15,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:15,644 INFO L85 PathProgramCache]: Analyzing trace with hash 767429099, now seen corresponding path program 1 times [2022-07-12 18:33:15,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:33:15,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113829948] [2022-07-12 18:33:15,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:15,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:33:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:15,714 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:33:15,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:33:15,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113829948] [2022-07-12 18:33:15,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113829948] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:33:15,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879289730] [2022-07-12 18:33:15,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:15,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:33:15,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:33:15,717 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:33:15,747 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:33:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:15,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-12 18:33:15,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:15,896 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:33:15,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:15,957 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:33:15,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879289730] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:15,957 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:33:15,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-07-12 18:33:15,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782488707] [2022-07-12 18:33:15,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:15,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 18:33:15,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:33:15,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 18:33:15,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:33:15,959 INFO L87 Difference]: Start difference. First operand 5663 states and 7903 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:33:16,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:16,236 INFO L93 Difference]: Finished difference Result 4879 states and 6428 transitions. [2022-07-12 18:33:16,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 18:33:16,237 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:33:16,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:16,245 INFO L225 Difference]: With dead ends: 4879 [2022-07-12 18:33:16,246 INFO L226 Difference]: Without dead ends: 4879 [2022-07-12 18:33:16,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2022-07-12 18:33:16,247 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 929 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:16,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [929 Valid, 1479 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:33:16,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4879 states. [2022-07-12 18:33:16,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4879 to 3657. [2022-07-12 18:33:16,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3657 states, 3646 states have (on average 1.3167855183763029) internal successors, (4801), 3656 states have internal predecessors, (4801), 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:16,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3657 states to 3657 states and 4801 transitions. [2022-07-12 18:33:16,298 INFO L78 Accepts]: Start accepts. Automaton has 3657 states and 4801 transitions. Word has length 63 [2022-07-12 18:33:16,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:16,299 INFO L495 AbstractCegarLoop]: Abstraction has 3657 states and 4801 transitions. [2022-07-12 18:33:16,299 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:33:16,299 INFO L276 IsEmpty]: Start isEmpty. Operand 3657 states and 4801 transitions. [2022-07-12 18:33:16,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-12 18:33:16,300 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:16,300 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:33:16,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-12 18:33:16,517 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:33:16,517 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:33:16,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:16,518 INFO L85 PathProgramCache]: Analyzing trace with hash 965172541, now seen corresponding path program 1 times [2022-07-12 18:33:16,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:33:16,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450241993] [2022-07-12 18:33:16,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:16,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:33:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:16,568 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 33 proven. 47 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-12 18:33:16,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:33:16,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450241993] [2022-07-12 18:33:16,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450241993] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:33:16,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716031320] [2022-07-12 18:33:16,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:16,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:33:16,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:33:16,571 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:33:16,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 18:33:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:16,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 18:33:16,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:16,737 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 33 proven. 47 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-12 18:33:16,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:16,800 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 33 proven. 47 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-12 18:33:16,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716031320] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:16,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:33:16,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2022-07-12 18:33:16,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294930246] [2022-07-12 18:33:16,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:16,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:33:16,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:33:16,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:33:16,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:33:16,802 INFO L87 Difference]: Start difference. First operand 3657 states and 4801 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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:16,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:16,885 INFO L93 Difference]: Finished difference Result 3649 states and 4758 transitions. [2022-07-12 18:33:16,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:33:16,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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 64 [2022-07-12 18:33:16,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:16,892 INFO L225 Difference]: With dead ends: 3649 [2022-07-12 18:33:16,892 INFO L226 Difference]: Without dead ends: 3649 [2022-07-12 18:33:16,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:33:16,893 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 107 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:16,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 253 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:33:16,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3649 states. [2022-07-12 18:33:16,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3649 to 3642. [2022-07-12 18:33:16,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3642 states, 3631 states have (on average 1.3098320022032497) internal successors, (4756), 3641 states have internal predecessors, (4756), 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:16,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3642 states to 3642 states and 4756 transitions. [2022-07-12 18:33:16,943 INFO L78 Accepts]: Start accepts. Automaton has 3642 states and 4756 transitions. Word has length 64 [2022-07-12 18:33:16,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:16,943 INFO L495 AbstractCegarLoop]: Abstraction has 3642 states and 4756 transitions. [2022-07-12 18:33:16,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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:16,943 INFO L276 IsEmpty]: Start isEmpty. Operand 3642 states and 4756 transitions. [2022-07-12 18:33:16,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-12 18:33:16,944 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:16,945 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, 1, 1] [2022-07-12 18:33:16,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-12 18:33:17,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-12 18:33:17,170 INFO L420 AbstractCegarLoop]: === Iteration 22 === 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:17,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:17,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1737502264, now seen corresponding path program 1 times [2022-07-12 18:33:17,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:33:17,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479235300] [2022-07-12 18:33:17,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:17,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:33:17,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:17,247 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 89 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-12 18:33:17,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:33:17,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479235300] [2022-07-12 18:33:17,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479235300] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:33:17,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046296421] [2022-07-12 18:33:17,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:17,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:33:17,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:33:17,249 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:33:17,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-12 18:33:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:17,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 18:33:17,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:17,486 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 95 proven. 15 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-12 18:33:17,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:17,590 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 97 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-12 18:33:17,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046296421] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:17,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:33:17,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 11 [2022-07-12 18:33:17,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246638969] [2022-07-12 18:33:17,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:17,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 18:33:17,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:33:17,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 18:33:17,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:33:17,592 INFO L87 Difference]: Start difference. First operand 3642 states and 4756 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 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:17,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:17,882 INFO L93 Difference]: Finished difference Result 5049 states and 6651 transitions. [2022-07-12 18:33:17,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 18:33:17,886 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 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 65 [2022-07-12 18:33:17,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:17,895 INFO L225 Difference]: With dead ends: 5049 [2022-07-12 18:33:17,895 INFO L226 Difference]: Without dead ends: 5049 [2022-07-12 18:33:17,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 128 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2022-07-12 18:33:17,897 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 439 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:17,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 621 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:33:17,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5049 states. [2022-07-12 18:33:17,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5049 to 2736. [2022-07-12 18:33:17,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2736 states, 2725 states have (on average 1.3056880733944953) internal successors, (3558), 2735 states have internal predecessors, (3558), 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:17,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2736 states to 2736 states and 3558 transitions. [2022-07-12 18:33:17,953 INFO L78 Accepts]: Start accepts. Automaton has 2736 states and 3558 transitions. Word has length 65 [2022-07-12 18:33:17,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:17,953 INFO L495 AbstractCegarLoop]: Abstraction has 2736 states and 3558 transitions. [2022-07-12 18:33:17,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 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:17,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2736 states and 3558 transitions. [2022-07-12 18:33:17,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-12 18:33:17,959 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:17,959 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 5, 5, 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, 1] [2022-07-12 18:33:17,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-12 18:33:18,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-12 18:33:18,176 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:33:18,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:18,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1937207539, now seen corresponding path program 1 times [2022-07-12 18:33:18,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:33:18,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018475648] [2022-07-12 18:33:18,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:18,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:33:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:18,264 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 32 proven. 62 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-12 18:33:18,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:33:18,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018475648] [2022-07-12 18:33:18,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018475648] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:33:18,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115201472] [2022-07-12 18:33:18,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:18,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:33:18,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:33:18,267 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:33:18,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-12 18:33:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:18,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 18:33:18,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:18,382 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:33:18,543 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 32 proven. 62 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-12 18:33:18,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:18,778 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 32 proven. 62 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-12 18:33:18,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115201472] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:18,778 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:33:18,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-07-12 18:33:18,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364048888] [2022-07-12 18:33:18,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:18,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 18:33:18,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:33:18,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 18:33:18,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:33:18,780 INFO L87 Difference]: Start difference. First operand 2736 states and 3558 transitions. Second operand has 11 states, 10 states have (on average 11.4) internal successors, (114), 11 states have internal predecessors, (114), 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:19,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:19,064 INFO L93 Difference]: Finished difference Result 4740 states and 6100 transitions. [2022-07-12 18:33:19,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:33:19,064 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.4) internal successors, (114), 11 states have internal predecessors, (114), 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 69 [2022-07-12 18:33:19,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:19,072 INFO L225 Difference]: With dead ends: 4740 [2022-07-12 18:33:19,073 INFO L226 Difference]: Without dead ends: 4740 [2022-07-12 18:33:19,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-07-12 18:33:19,073 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 726 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:19,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 465 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:33:19,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4740 states. [2022-07-12 18:33:19,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4740 to 3702. [2022-07-12 18:33:19,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3702 states, 3691 states have (on average 1.3270116499593607) internal successors, (4898), 3701 states have internal predecessors, (4898), 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:19,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3702 states to 3702 states and 4898 transitions. [2022-07-12 18:33:19,121 INFO L78 Accepts]: Start accepts. Automaton has 3702 states and 4898 transitions. Word has length 69 [2022-07-12 18:33:19,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:19,122 INFO L495 AbstractCegarLoop]: Abstraction has 3702 states and 4898 transitions. [2022-07-12 18:33:19,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.4) internal successors, (114), 11 states have internal predecessors, (114), 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:19,122 INFO L276 IsEmpty]: Start isEmpty. Operand 3702 states and 4898 transitions. [2022-07-12 18:33:19,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-12 18:33:19,124 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:19,124 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 8, 6, 6, 5, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:19,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-12 18:33:19,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:33:19,343 INFO L420 AbstractCegarLoop]: === Iteration 24 === 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:19,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:19,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1779624174, now seen corresponding path program 1 times [2022-07-12 18:33:19,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:33:19,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811435090] [2022-07-12 18:33:19,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:19,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:33:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:19,403 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 64 proven. 2 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-07-12 18:33:19,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:33:19,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811435090] [2022-07-12 18:33:19,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811435090] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:33:19,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098388685] [2022-07-12 18:33:19,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:19,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:33:19,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:33:19,406 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:33:19,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-12 18:33:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:19,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 18:33:19,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:19,674 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 29 proven. 65 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2022-07-12 18:33:19,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:19,766 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 29 proven. 65 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2022-07-12 18:33:19,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098388685] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:19,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:33:19,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-07-12 18:33:19,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880926691] [2022-07-12 18:33:19,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:19,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 18:33:19,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:33:19,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 18:33:19,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:33:19,769 INFO L87 Difference]: Start difference. First operand 3702 states and 4898 transitions. Second operand has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 states have internal predecessors, (91), 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:20,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:20,015 INFO L93 Difference]: Finished difference Result 11141 states and 13886 transitions. [2022-07-12 18:33:20,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 18:33:20,016 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 states have internal predecessors, (91), 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 88 [2022-07-12 18:33:20,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:20,032 INFO L225 Difference]: With dead ends: 11141 [2022-07-12 18:33:20,032 INFO L226 Difference]: Without dead ends: 11141 [2022-07-12 18:33:20,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 182 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=670, Unknown=0, NotChecked=0, Total=870 [2022-07-12 18:33:20,034 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 1204 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1204 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:20,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1204 Valid, 1292 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:33:20,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11141 states. [2022-07-12 18:33:20,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11141 to 5772. [2022-07-12 18:33:20,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5772 states, 5761 states have (on average 1.3070647457038709) internal successors, (7530), 5771 states have internal predecessors, (7530), 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:20,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5772 states to 5772 states and 7530 transitions. [2022-07-12 18:33:20,129 INFO L78 Accepts]: Start accepts. Automaton has 5772 states and 7530 transitions. Word has length 88 [2022-07-12 18:33:20,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:20,130 INFO L495 AbstractCegarLoop]: Abstraction has 5772 states and 7530 transitions. [2022-07-12 18:33:20,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 states have internal predecessors, (91), 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:20,130 INFO L276 IsEmpty]: Start isEmpty. Operand 5772 states and 7530 transitions. [2022-07-12 18:33:20,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-12 18:33:20,132 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:20,132 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 9, 6, 6, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:20,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-12 18:33:20,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:33:20,347 INFO L420 AbstractCegarLoop]: === Iteration 25 === 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:20,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:20,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1011471400, now seen corresponding path program 1 times [2022-07-12 18:33:20,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:33:20,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201858571] [2022-07-12 18:33:20,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:20,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:33:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 18:33:20,392 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 18:33:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 18:33:20,487 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 18:33:20,487 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 18:33:20,488 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2022-07-12 18:33:20,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2022-07-12 18:33:20,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2022-07-12 18:33:20,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2022-07-12 18:33:20,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2022-07-12 18:33:20,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2022-07-12 18:33:20,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2022-07-12 18:33:20,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2022-07-12 18:33:20,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2022-07-12 18:33:20,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2022-07-12 18:33:20,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2022-07-12 18:33:20,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2022-07-12 18:33:20,493 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2022-07-12 18:33:20,494 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2022-07-12 18:33:20,494 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2022-07-12 18:33:20,494 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2022-07-12 18:33:20,494 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2022-07-12 18:33:20,494 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2022-07-12 18:33:20,495 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2022-07-12 18:33:20,495 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2022-07-12 18:33:20,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-12 18:33:20,498 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, 1, 1, 1, 1] [2022-07-12 18:33:20,502 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 18:33:20,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 06:33:20 BoogieIcfgContainer [2022-07-12 18:33:20,591 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 18:33:20,592 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 18:33:20,592 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 18:33:20,592 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 18:33:20,593 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:33:06" (3/4) ... [2022-07-12 18:33:20,595 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 18:33:20,595 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 18:33:20,596 INFO L158 Benchmark]: Toolchain (without parser) took 15432.33ms. Allocated memory was 96.5MB in the beginning and 272.6MB in the end (delta: 176.2MB). Free memory was 55.4MB in the beginning and 197.7MB in the end (delta: -142.3MB). Peak memory consumption was 33.2MB. Max. memory is 16.1GB. [2022-07-12 18:33:20,596 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 96.5MB. Free memory is still 73.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:33:20,596 INFO L158 Benchmark]: CACSL2BoogieTranslator took 438.99ms. Allocated memory is still 96.5MB. Free memory was 55.2MB in the beginning and 63.0MB in the end (delta: -7.7MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2022-07-12 18:33:20,597 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.14ms. Allocated memory is still 96.5MB. Free memory was 63.0MB in the beginning and 60.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 18:33:20,597 INFO L158 Benchmark]: Boogie Preprocessor took 34.30ms. Allocated memory is still 96.5MB. Free memory was 60.8MB in the beginning and 59.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 18:33:20,597 INFO L158 Benchmark]: RCFGBuilder took 512.23ms. Allocated memory is still 96.5MB. Free memory was 59.1MB in the beginning and 43.1MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-12 18:33:20,598 INFO L158 Benchmark]: TraceAbstraction took 14380.82ms. Allocated memory was 96.5MB in the beginning and 272.6MB in the end (delta: 176.2MB). Free memory was 42.6MB in the beginning and 197.7MB in the end (delta: -155.1MB). Peak memory consumption was 118.0MB. Max. memory is 16.1GB. [2022-07-12 18:33:20,598 INFO L158 Benchmark]: Witness Printer took 3.65ms. Allocated memory is still 272.6MB. Free memory is still 197.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:33:20,599 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.27ms. Allocated memory is still 96.5MB. Free memory is still 73.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 438.99ms. Allocated memory is still 96.5MB. Free memory was 55.2MB in the beginning and 63.0MB in the end (delta: -7.7MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.14ms. Allocated memory is still 96.5MB. Free memory was 63.0MB in the beginning and 60.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.30ms. Allocated memory is still 96.5MB. Free memory was 60.8MB in the beginning and 59.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 512.23ms. Allocated memory is still 96.5MB. Free memory was 59.1MB in the beginning and 43.1MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 14380.82ms. Allocated memory was 96.5MB in the beginning and 272.6MB in the end (delta: 176.2MB). Free memory was 42.6MB in the beginning and 197.7MB in the end (delta: -155.1MB). Peak memory consumption was 118.0MB. Max. memory is 16.1GB. * Witness Printer took 3.65ms. Allocated memory is still 272.6MB. Free memory is still 197.7MB. 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] S || 1 != pc1 || __VERIFIER_nondet_int() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-1, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __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] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __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] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __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] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __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] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __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] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=6, pc4=1, res4=0, S={-2:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __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] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=1, pc4=1, res4=0, S={-2:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={-2:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() [L567] pc4++ [L568] case 1: [L569] t4 = S VAL [garbage={0:0}, pc1=1, pc4=2, pc4++=1, res4=0, S={-2:0}, t1={0:0}, t4={-2:0}, x1={-2:0}, x4={0:0}] [L598] RET pop() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=1, pc4=2, res4=0, S={-2:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={-2:0}, x1={-2:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() [L567] pc4++ [L568] case 1: [L571] case 2: VAL [garbage={0:0}, pc1=1, pc4=3, pc4++=2, res4=0, S={-2:0}, t1={0:0}, t4={-2:0}, x1={-2:0}, x4={0:0}] [L572] COND FALSE !(t4 == ((void *)0)) VAL [garbage={0:0}, pc1=1, pc4=3, pc4++=2, res4=0, S={-2:0}, t1={0:0}, t4={-2:0}, x1={-2:0}, x4={0:0}] [L598] RET pop() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=1, pc4=3, res4=0, S={-2:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={-2:0}, x1={-2:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() [L567] pc4++ [L568] case 1: [L571] case 2: [L575] case 3: VAL [garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={-2:0}, t1={0:0}, t4={-2:0}, x1={-2:0}, x4={0:0}] [L576] EXPR t4->next VAL [garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={-2:0}, t1={0:0}, t4={-2:0}, t4->next={0:0}, x1={-2:0}, x4={0:0}] [L576] x4 = t4->next [L598] RET pop() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [garbage={0:0}, pc1=1, pc4=4, res4=0, S={-2:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={-2:0}, x1={-2:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() [L567] pc4++ [L568] case 1: [L571] case 2: [L575] case 3: [L578] case 4: VAL [garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={-2:0}, t1={0:0}, t4={-2:0}, x1={-2:0}, x4={0:0}] [L579] COND TRUE S == t4 [L580] S = x4 VAL [garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={0:0}, t1={0:0}, t4={-2:0}, x1={-2:0}, x4={0:0}] [L598] RET pop() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={-2:0}, x1={-2:0}, x4={0:0}] [L594] COND FALSE !(S || 1 != pc1 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) VAL [garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={-2: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=5, 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: 14.2s, OverallIterations: 25, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9617 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9617 mSDsluCounter, 11724 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8742 mSDsCounter, 578 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2393 IncrementalHoareTripleChecker+Invalid, 2971 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 578 mSolverCounterUnsat, 2982 mSDtfsCounter, 2393 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1768 GetRequests, 1451 SyntacticMatches, 21 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5913occurred in iteration=18, InterpolantAutomatonStates: 265, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 24 MinimizatonAttempts, 28350 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1594 NumberOfCodeBlocks, 1594 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 2155 ConstructedInterpolants, 0 QuantifiedInterpolants, 7063 SizeOfPredicates, 64 NumberOfNonLiveVariables, 3269 ConjunctsInSsa, 147 ConjunctsInUnsatCore, 54 InterpolantComputations, 10 PerfectInterpolantSequences, 2888/3753 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:20,639 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.3.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 1db117ae3c729419255b5da4a7f4ecd64b2d99a167d11f22266a773c4ff13cdb --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 18:33:22,619 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:33:22,621 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:33:22,646 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:33:22,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:33:22,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:33:22,649 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:33:22,650 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:33:22,652 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:33:22,653 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:33:22,653 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:33:22,654 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:33:22,655 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:33:22,656 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:33:22,657 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:33:22,657 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:33:22,658 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:33:22,659 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:33:22,660 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:33:22,662 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:33:22,663 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:33:22,665 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:33:22,666 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:33:22,667 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:33:22,668 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:33:22,670 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:33:22,670 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:33:22,671 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:33:22,672 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:33:22,672 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:33:22,673 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:33:22,673 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:33:22,674 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:33:22,674 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:33:22,675 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:33:22,676 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:33:22,676 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:33:22,677 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:33:22,677 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:33:22,677 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:33:22,678 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:33:22,679 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:33:22,679 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:33:22,699 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:33:22,699 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:33:22,700 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:33:22,700 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:33:22,701 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:33:22,701 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:33:22,702 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:33:22,702 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:33:22,702 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:33:22,702 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:33:22,702 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:33:22,703 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:33:22,703 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:33:22,703 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:33:22,714 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:33:22,714 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:33:22,715 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:33:22,715 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 18:33:22,715 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:33:22,715 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:33:22,716 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 18:33:22,716 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 18:33:22,716 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:33:22,716 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:33:22,716 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:33:22,717 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:33:22,717 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:33:22,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:33:22,717 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:33:22,718 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:33:22,718 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 18:33:22,718 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 18:33:22,719 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 18:33:22,719 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 -> 1db117ae3c729419255b5da4a7f4ecd64b2d99a167d11f22266a773c4ff13cdb [2022-07-12 18:33:23,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:33:23,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:33:23,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:33:23,054 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:33:23,055 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:33:23,057 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/lockfree-3.3.i [2022-07-12 18:33:23,121 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/267e2e9b6/26fe086fb55e4854bd6e4bb4064dc051/FLAG0f72c1ce2 [2022-07-12 18:33:23,614 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:33:23,614 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.3.i [2022-07-12 18:33:23,632 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/267e2e9b6/26fe086fb55e4854bd6e4bb4064dc051/FLAG0f72c1ce2 [2022-07-12 18:33:23,984 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/267e2e9b6/26fe086fb55e4854bd6e4bb4064dc051 [2022-07-12 18:33:23,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:33:23,988 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:33:23,989 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:33:23,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:33:23,993 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:33:23,993 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:33:23" (1/1) ... [2022-07-12 18:33:23,995 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ce4870c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:23, skipping insertion in model container [2022-07-12 18:33:23,995 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:33:23" (1/1) ... [2022-07-12 18:33:24,001 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:33:24,045 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:33:24,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:33:24,351 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 18:33:24,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:33:24,439 INFO L208 MainTranslator]: Completed translation [2022-07-12 18:33:24,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:24 WrapperNode [2022-07-12 18:33:24,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:33:24,441 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 18:33:24,442 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 18:33:24,442 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 18:33:24,449 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:33:24" (1/1) ... [2022-07-12 18:33:24,473 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:33:24" (1/1) ... [2022-07-12 18:33:24,494 INFO L137 Inliner]: procedures = 128, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 119 [2022-07-12 18:33:24,496 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 18:33:24,497 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 18:33:24,497 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 18:33:24,497 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 18:33:24,504 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:24" (1/1) ... [2022-07-12 18:33:24,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:24" (1/1) ... [2022-07-12 18:33:24,524 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:24" (1/1) ... [2022-07-12 18:33:24,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:24" (1/1) ... [2022-07-12 18:33:24,535 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:24" (1/1) ... [2022-07-12 18:33:24,549 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:24" (1/1) ... [2022-07-12 18:33:24,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:24" (1/1) ... [2022-07-12 18:33:24,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 18:33:24,563 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 18:33:24,564 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 18:33:24,564 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 18:33:24,564 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:24" (1/1) ... [2022-07-12 18:33:24,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:33:24,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:33:24,595 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:33:24,598 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:33:24,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 18:33:24,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 18:33:24,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 18:33:24,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 18:33:24,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 18:33:24,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 18:33:24,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 18:33:24,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 18:33:24,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 18:33:24,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 18:33:24,716 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 18:33:24,717 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 18:33:25,072 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 18:33:25,078 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 18:33:25,078 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 18:33:25,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:33:25 BoogieIcfgContainer [2022-07-12 18:33:25,080 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 18:33:25,082 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 18:33:25,082 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 18:33:25,085 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 18:33:25,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:33:23" (1/3) ... [2022-07-12 18:33:25,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35aecc4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:33:25, skipping insertion in model container [2022-07-12 18:33:25,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:24" (2/3) ... [2022-07-12 18:33:25,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35aecc4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:33:25, skipping insertion in model container [2022-07-12 18:33:25,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:33:25" (3/3) ... [2022-07-12 18:33:25,087 INFO L111 eAbstractionObserver]: Analyzing ICFG lockfree-3.3.i [2022-07-12 18:33:25,100 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 18:33:25,100 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-07-12 18:33:25,144 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 18:33:25,150 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@26d695b8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@217d3ba7 [2022-07-12 18:33:25,150 INFO L358 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2022-07-12 18:33:25,156 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:33:25,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-12 18:33:25,161 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:25,161 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-12 18:33:25,162 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:33:25,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:25,167 INFO L85 PathProgramCache]: Analyzing trace with hash 28701640, now seen corresponding path program 1 times [2022-07-12 18:33:25,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:25,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [128281377] [2022-07-12 18:33:25,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:25,178 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:25,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:25,181 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:33:25,194 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:33:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:25,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 18:33:25,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:25,386 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:33:25,386 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:33:25,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:25,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [128281377] [2022-07-12 18:33:25,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [128281377] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:33:25,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:33:25,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:33:25,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93416684] [2022-07-12 18:33:25,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:33:25,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:33:25,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:25,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:33:25,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:33:25,432 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:33:25,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:25,521 INFO L93 Difference]: Finished difference Result 107 states and 139 transitions. [2022-07-12 18:33:25,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:33:25,525 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:33:25,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:25,535 INFO L225 Difference]: With dead ends: 107 [2022-07-12 18:33:25,536 INFO L226 Difference]: Without dead ends: 105 [2022-07-12 18:33:25,537 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:33:25,545 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:33:25,546 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:33:25,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-12 18:33:25,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2022-07-12 18:33:25,576 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:33:25,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 129 transitions. [2022-07-12 18:33:25,579 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 129 transitions. Word has length 5 [2022-07-12 18:33:25,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:25,580 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 129 transitions. [2022-07-12 18:33:25,580 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:33:25,580 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 129 transitions. [2022-07-12 18:33:25,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 18:33:25,581 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:25,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 18:33:25,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-12 18:33:25,789 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:33:25,790 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:33:25,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:25,791 INFO L85 PathProgramCache]: Analyzing trace with hash 889749439, now seen corresponding path program 1 times [2022-07-12 18:33:25,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:25,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1493903965] [2022-07-12 18:33:25,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:25,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:25,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:25,795 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:33:25,797 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:33:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:25,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 18:33:25,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:25,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:33:25,858 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:33:25,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:25,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1493903965] [2022-07-12 18:33:25,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1493903965] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:33:25,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:33:25,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:33:25,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21723113] [2022-07-12 18:33:25,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:33:25,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:33:25,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:25,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:33:25,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:33:25,862 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:33:25,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:25,994 INFO L93 Difference]: Finished difference Result 163 states and 243 transitions. [2022-07-12 18:33:25,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:33:25,995 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:33:25,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:25,997 INFO L225 Difference]: With dead ends: 163 [2022-07-12 18:33:25,997 INFO L226 Difference]: Without dead ends: 160 [2022-07-12 18:33:25,997 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:33:25,998 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:33:25,999 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:33:26,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-12 18:33:26,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 140. [2022-07-12 18:33:26,011 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:33:26,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 229 transitions. [2022-07-12 18:33:26,013 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 229 transitions. Word has length 6 [2022-07-12 18:33:26,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:26,014 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 229 transitions. [2022-07-12 18:33:26,014 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:33:26,014 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 229 transitions. [2022-07-12 18:33:26,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 18:33:26,015 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:26,015 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 18:33:26,028 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:33:26,223 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:33:26,224 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:33:26,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:26,225 INFO L85 PathProgramCache]: Analyzing trace with hash 889692424, now seen corresponding path program 1 times [2022-07-12 18:33:26,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:26,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [208494245] [2022-07-12 18:33:26,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:26,226 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:26,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:26,228 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:33:26,230 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:33:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:26,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 18:33:26,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:26,343 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:33:26,348 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:33:26,349 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:33:26,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:26,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [208494245] [2022-07-12 18:33:26,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [208494245] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:33:26,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:33:26,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:33:26,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382352943] [2022-07-12 18:33:26,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:33:26,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:33:26,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:26,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:33:26,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:33:26,355 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:33:26,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:26,471 INFO L93 Difference]: Finished difference Result 211 states and 330 transitions. [2022-07-12 18:33:26,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:33:26,472 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:33:26,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:26,473 INFO L225 Difference]: With dead ends: 211 [2022-07-12 18:33:26,473 INFO L226 Difference]: Without dead ends: 211 [2022-07-12 18:33:26,474 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:33:26,474 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:33:26,475 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:33:26,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-12 18:33:26,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 190. [2022-07-12 18:33:26,485 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:33:26,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 316 transitions. [2022-07-12 18:33:26,498 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 316 transitions. Word has length 6 [2022-07-12 18:33:26,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:26,498 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 316 transitions. [2022-07-12 18:33:26,498 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:33:26,498 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 316 transitions. [2022-07-12 18:33:26,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 18:33:26,499 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:26,499 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 18:33:26,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-12 18:33:26,699 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:33:26,700 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:33:26,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:26,700 INFO L85 PathProgramCache]: Analyzing trace with hash 889692425, now seen corresponding path program 1 times [2022-07-12 18:33:26,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:26,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1842361193] [2022-07-12 18:33:26,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:26,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:26,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:26,702 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:33:26,704 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:33:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:26,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 18:33:26,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:26,773 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:33:26,782 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:33:26,782 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:33:26,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:26,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1842361193] [2022-07-12 18:33:26,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1842361193] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:33:26,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:33:26,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:33:26,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146765314] [2022-07-12 18:33:26,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:33:26,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:33:26,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:26,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:33:26,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:33:26,789 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:33:26,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:26,920 INFO L93 Difference]: Finished difference Result 206 states and 321 transitions. [2022-07-12 18:33:26,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:33:26,921 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:33:26,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:26,922 INFO L225 Difference]: With dead ends: 206 [2022-07-12 18:33:26,922 INFO L226 Difference]: Without dead ends: 206 [2022-07-12 18:33:26,923 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:33:26,923 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:33:26,924 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:33:26,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-12 18:33:26,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 188. [2022-07-12 18:33:26,934 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:33:26,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 308 transitions. [2022-07-12 18:33:26,935 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 308 transitions. Word has length 6 [2022-07-12 18:33:26,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:26,935 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 308 transitions. [2022-07-12 18:33:26,936 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:33:26,936 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 308 transitions. [2022-07-12 18:33:26,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 18:33:26,936 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:26,936 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:26,946 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:33:27,143 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:33:27,144 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:33:27,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:27,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1810669365, now seen corresponding path program 1 times [2022-07-12 18:33:27,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:27,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971047708] [2022-07-12 18:33:27,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:27,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:27,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:27,146 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:33:27,149 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:33:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:27,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 18:33:27,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:27,201 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:33:27,201 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:33:27,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:27,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971047708] [2022-07-12 18:33:27,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1971047708] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:33:27,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:33:27,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:33:27,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165904132] [2022-07-12 18:33:27,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:33:27,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:33:27,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:27,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:33:27,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:33:27,204 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:33:27,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:27,249 INFO L93 Difference]: Finished difference Result 211 states and 304 transitions. [2022-07-12 18:33:27,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:33:27,250 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:33:27,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:27,251 INFO L225 Difference]: With dead ends: 211 [2022-07-12 18:33:27,251 INFO L226 Difference]: Without dead ends: 211 [2022-07-12 18:33:27,251 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:33:27,252 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:33:27,253 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:33:27,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-12 18:33:27,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 144. [2022-07-12 18:33:27,259 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:33:27,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 229 transitions. [2022-07-12 18:33:27,260 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 229 transitions. Word has length 7 [2022-07-12 18:33:27,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:27,260 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 229 transitions. [2022-07-12 18:33:27,261 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:33:27,261 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 229 transitions. [2022-07-12 18:33:27,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 18:33:27,261 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:27,261 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:27,274 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:33:27,469 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:33:27,470 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:33:27,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:27,470 INFO L85 PathProgramCache]: Analyzing trace with hash 347531241, now seen corresponding path program 1 times [2022-07-12 18:33:27,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:27,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667574382] [2022-07-12 18:33:27,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:27,471 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:27,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:27,472 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:33:27,473 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:33:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:27,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 18:33:27,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:27,523 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:33:27,523 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:33:27,523 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:27,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1667574382] [2022-07-12 18:33:27,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1667574382] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:33:27,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:33:27,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:33:27,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896766295] [2022-07-12 18:33:27,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:33:27,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:33:27,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:27,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:33:27,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:33:27,525 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:33:27,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:27,551 INFO L93 Difference]: Finished difference Result 303 states and 449 transitions. [2022-07-12 18:33:27,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:33:27,552 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:33:27,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:27,554 INFO L225 Difference]: With dead ends: 303 [2022-07-12 18:33:27,555 INFO L226 Difference]: Without dead ends: 303 [2022-07-12 18:33:27,555 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:33:27,557 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 103 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:27,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 221 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:33:27,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-07-12 18:33:27,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 198. [2022-07-12 18:33:27,572 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:33:27,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 308 transitions. [2022-07-12 18:33:27,573 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 308 transitions. Word has length 8 [2022-07-12 18:33:27,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:27,577 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 308 transitions. [2022-07-12 18:33:27,577 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:33:27,577 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 308 transitions. [2022-07-12 18:33:27,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 18:33:27,583 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:27,584 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:27,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-12 18:33:27,792 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:33:27,793 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:33:27,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:27,793 INFO L85 PathProgramCache]: Analyzing trace with hash -527615340, now seen corresponding path program 1 times [2022-07-12 18:33:27,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:27,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1198292308] [2022-07-12 18:33:27,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:27,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:27,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:27,795 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:33:27,797 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:33:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:27,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 18:33:27,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:27,886 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:33:27,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:27,925 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:33:27,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:27,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1198292308] [2022-07-12 18:33:27,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1198292308] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:27,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:33:27,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-07-12 18:33:27,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909852318] [2022-07-12 18:33:27,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:27,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:33:27,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:27,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:33:27,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:33:27,928 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:33:28,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:28,021 INFO L93 Difference]: Finished difference Result 513 states and 746 transitions. [2022-07-12 18:33:28,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:33:28,022 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:33:28,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:28,025 INFO L225 Difference]: With dead ends: 513 [2022-07-12 18:33:28,026 INFO L226 Difference]: Without dead ends: 513 [2022-07-12 18:33:28,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:33:28,027 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 262 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:28,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 578 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:33:28,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2022-07-12 18:33:28,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 258. [2022-07-12 18:33:28,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 246 states have (on average 1.6219512195121952) internal successors, (399), 257 states have internal predecessors, (399), 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:28,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 399 transitions. [2022-07-12 18:33:28,041 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 399 transitions. Word has length 12 [2022-07-12 18:33:28,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:28,041 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 399 transitions. [2022-07-12 18:33:28,041 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:33:28,041 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 399 transitions. [2022-07-12 18:33:28,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 18:33:28,042 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:28,042 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:28,053 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:33:28,250 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:33:28,251 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:33:28,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:28,252 INFO L85 PathProgramCache]: Analyzing trace with hash 2027186576, now seen corresponding path program 1 times [2022-07-12 18:33:28,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:28,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1204921103] [2022-07-12 18:33:28,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:28,252 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:28,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:28,253 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:33:28,255 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:33:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:28,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 18:33:28,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:28,328 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:33:28,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:28,348 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:33:28,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:28,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1204921103] [2022-07-12 18:33:28,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1204921103] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:28,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:33:28,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2022-07-12 18:33:28,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186658285] [2022-07-12 18:33:28,349 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:28,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:33:28,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:28,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:33:28,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:33:28,350 INFO L87 Difference]: Start difference. First operand 258 states and 399 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:28,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:28,391 INFO L93 Difference]: Finished difference Result 600 states and 891 transitions. [2022-07-12 18:33:28,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:33:28,391 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:33:28,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:28,394 INFO L225 Difference]: With dead ends: 600 [2022-07-12 18:33:28,394 INFO L226 Difference]: Without dead ends: 600 [2022-07-12 18:33:28,394 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:33:28,395 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 244 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:28,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 298 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:33:28,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2022-07-12 18:33:28,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 576. [2022-07-12 18:33:28,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 564 states have (on average 1.5797872340425532) internal successors, (891), 575 states have internal predecessors, (891), 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:28,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 891 transitions. [2022-07-12 18:33:28,410 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 891 transitions. Word has length 12 [2022-07-12 18:33:28,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:28,410 INFO L495 AbstractCegarLoop]: Abstraction has 576 states and 891 transitions. [2022-07-12 18:33:28,411 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:28,411 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 891 transitions. [2022-07-12 18:33:28,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 18:33:28,411 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:28,412 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:28,420 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:33:28,620 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:33:28,620 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:33:28,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:28,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1582579647, now seen corresponding path program 2 times [2022-07-12 18:33:28,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:28,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [264957409] [2022-07-12 18:33:28,621 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:33:28,621 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:28,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:28,623 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:33:28,623 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:33:28,665 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:33:28,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:33:28,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 18:33:28,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:28,694 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:33:28,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:28,716 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:33:28,717 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:28,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [264957409] [2022-07-12 18:33:28,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [264957409] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:28,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:33:28,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-12 18:33:28,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156063548] [2022-07-12 18:33:28,718 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:28,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:33:28,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:28,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:33:28,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:33:28,719 INFO L87 Difference]: Start difference. First operand 576 states and 891 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:33:28,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:28,788 INFO L93 Difference]: Finished difference Result 1062 states and 1609 transitions. [2022-07-12 18:33:28,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:33:28,789 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:33:28,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:28,793 INFO L225 Difference]: With dead ends: 1062 [2022-07-12 18:33:28,794 INFO L226 Difference]: Without dead ends: 1062 [2022-07-12 18:33:28,794 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:33:28,795 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 246 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:28,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 442 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:33:28,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2022-07-12 18:33:28,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 968. [2022-07-12 18:33:28,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 956 states have (on average 1.5658995815899581) internal successors, (1497), 967 states have internal predecessors, (1497), 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:28,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1497 transitions. [2022-07-12 18:33:28,816 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1497 transitions. Word has length 16 [2022-07-12 18:33:28,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:28,817 INFO L495 AbstractCegarLoop]: Abstraction has 968 states and 1497 transitions. [2022-07-12 18:33:28,817 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:33:28,817 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1497 transitions. [2022-07-12 18:33:28,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 18:33:28,818 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:28,818 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:28,827 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:33:29,026 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:33:29,027 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:33:29,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:29,027 INFO L85 PathProgramCache]: Analyzing trace with hash -480845608, now seen corresponding path program 1 times [2022-07-12 18:33:29,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:29,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1246241180] [2022-07-12 18:33:29,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:29,028 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:29,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:29,029 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:33:29,032 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:33:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:29,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 18:33:29,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:29,146 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:29,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:29,188 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:29,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:29,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1246241180] [2022-07-12 18:33:29,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1246241180] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:29,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:33:29,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2022-07-12 18:33:29,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732847035] [2022-07-12 18:33:29,189 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:29,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:33:29,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:29,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:33:29,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:33:29,191 INFO L87 Difference]: Start difference. First operand 968 states and 1497 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:29,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:29,272 INFO L93 Difference]: Finished difference Result 1241 states and 1858 transitions. [2022-07-12 18:33:29,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:33:29,273 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:29,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:29,278 INFO L225 Difference]: With dead ends: 1241 [2022-07-12 18:33:29,278 INFO L226 Difference]: Without dead ends: 1241 [2022-07-12 18:33:29,278 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:29,279 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 98 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:29,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 165 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:33:29,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2022-07-12 18:33:29,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1100. [2022-07-12 18:33:29,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 1088 states have (on average 1.525735294117647) internal successors, (1660), 1099 states have internal predecessors, (1660), 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:29,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1660 transitions. [2022-07-12 18:33:29,301 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1660 transitions. Word has length 18 [2022-07-12 18:33:29,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:29,301 INFO L495 AbstractCegarLoop]: Abstraction has 1100 states and 1660 transitions. [2022-07-12 18:33:29,301 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:29,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1660 transitions. [2022-07-12 18:33:29,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 18:33:29,302 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:29,302 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:29,314 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:29,510 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:29,511 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:29,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:29,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1323238580, now seen corresponding path program 1 times [2022-07-12 18:33:29,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:29,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [529828644] [2022-07-12 18:33:29,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:29,512 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:29,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:29,513 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:29,515 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:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:29,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 18:33:29,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:29,603 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:29,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:29,631 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:29,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:29,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [529828644] [2022-07-12 18:33:29,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [529828644] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:29,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:33:29,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-07-12 18:33:29,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50652142] [2022-07-12 18:33:29,632 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:29,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:33:29,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:29,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:33:29,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:33:29,633 INFO L87 Difference]: Start difference. First operand 1100 states and 1660 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:29,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:29,719 INFO L93 Difference]: Finished difference Result 1384 states and 2014 transitions. [2022-07-12 18:33:29,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:33:29,720 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:29,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:29,725 INFO L225 Difference]: With dead ends: 1384 [2022-07-12 18:33:29,725 INFO L226 Difference]: Without dead ends: 1384 [2022-07-12 18:33:29,726 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:29,726 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:29,727 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.1s Time] [2022-07-12 18:33:29,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2022-07-12 18:33:29,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1009. [2022-07-12 18:33:29,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 997 states have (on average 1.4954864593781345) internal successors, (1491), 1008 states have internal predecessors, (1491), 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:29,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1491 transitions. [2022-07-12 18:33:29,749 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1491 transitions. Word has length 21 [2022-07-12 18:33:29,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:29,749 INFO L495 AbstractCegarLoop]: Abstraction has 1009 states and 1491 transitions. [2022-07-12 18:33:29,749 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:29,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1491 transitions. [2022-07-12 18:33:29,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 18:33:29,750 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:29,750 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:29,759 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:29,959 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:29,960 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:29,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:29,960 INFO L85 PathProgramCache]: Analyzing trace with hash -2034622781, now seen corresponding path program 2 times [2022-07-12 18:33:29,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:29,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2063507786] [2022-07-12 18:33:29,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:33:29,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:29,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:29,962 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:29,963 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:30,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:33:30,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:33:30,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 18:33:30,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:30,088 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:30,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:30,116 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:30,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:30,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2063507786] [2022-07-12 18:33:30,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2063507786] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:30,117 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:33:30,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-12 18:33:30,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069050423] [2022-07-12 18:33:30,117 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:30,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:33:30,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:30,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:33:30,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:33:30,119 INFO L87 Difference]: Start difference. First operand 1009 states and 1491 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:30,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:30,191 INFO L93 Difference]: Finished difference Result 994 states and 1426 transitions. [2022-07-12 18:33:30,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:33:30,192 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:30,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:30,196 INFO L225 Difference]: With dead ends: 994 [2022-07-12 18:33:30,196 INFO L226 Difference]: Without dead ends: 994 [2022-07-12 18:33:30,196 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:30,198 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:30,198 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:30,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2022-07-12 18:33:30,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 970. [2022-07-12 18:33:30,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 958 states have (on average 1.488517745302714) internal successors, (1426), 969 states have internal predecessors, (1426), 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:30,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1426 transitions. [2022-07-12 18:33:30,226 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1426 transitions. Word has length 27 [2022-07-12 18:33:30,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:30,226 INFO L495 AbstractCegarLoop]: Abstraction has 970 states and 1426 transitions. [2022-07-12 18:33:30,227 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:30,227 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1426 transitions. [2022-07-12 18:33:30,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 18:33:30,227 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:30,227 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:30,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-07-12 18:33:30,434 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:30,435 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:30,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:30,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1432941687, now seen corresponding path program 1 times [2022-07-12 18:33:30,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:30,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1360146118] [2022-07-12 18:33:30,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:30,436 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:30,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:30,437 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:30,438 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:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:30,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 18:33:30,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:30,620 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:30,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:30,650 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:30,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:30,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1360146118] [2022-07-12 18:33:30,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1360146118] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:30,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:33:30,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2022-07-12 18:33:30,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969997331] [2022-07-12 18:33:30,651 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:30,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:33:30,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:30,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:33:30,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:33:30,652 INFO L87 Difference]: Start difference. First operand 970 states and 1426 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:30,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:30,755 INFO L93 Difference]: Finished difference Result 1049 states and 1476 transitions. [2022-07-12 18:33:30,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:33:30,755 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:30,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:30,759 INFO L225 Difference]: With dead ends: 1049 [2022-07-12 18:33:30,759 INFO L226 Difference]: Without dead ends: 1049 [2022-07-12 18:33:30,759 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:30,760 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 233 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:30,760 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.1s Time] [2022-07-12 18:33:30,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2022-07-12 18:33:30,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 892. [2022-07-12 18:33:30,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 880 states have (on average 1.4579545454545455) internal successors, (1283), 891 states have internal predecessors, (1283), 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:30,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1283 transitions. [2022-07-12 18:33:30,776 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1283 transitions. Word has length 27 [2022-07-12 18:33:30,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:30,776 INFO L495 AbstractCegarLoop]: Abstraction has 892 states and 1283 transitions. [2022-07-12 18:33:30,776 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:30,776 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1283 transitions. [2022-07-12 18:33:30,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 18:33:30,777 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:30,777 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:30,790 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:30,985 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:30,986 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:30,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:30,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1945741357, now seen corresponding path program 1 times [2022-07-12 18:33:30,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:30,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1197728634] [2022-07-12 18:33:30,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:30,987 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:30,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:30,988 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:30,989 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:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:31,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 18:33:31,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:31,141 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:31,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:31,380 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:31,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:31,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1197728634] [2022-07-12 18:33:31,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1197728634] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:31,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:33:31,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2022-07-12 18:33:31,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828695969] [2022-07-12 18:33:31,381 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:31,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 18:33:31,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:31,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 18:33:31,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:33:31,382 INFO L87 Difference]: Start difference. First operand 892 states and 1283 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:31,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:31,887 INFO L93 Difference]: Finished difference Result 1882 states and 2645 transitions. [2022-07-12 18:33:31,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 18:33:31,888 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:31,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:31,894 INFO L225 Difference]: With dead ends: 1882 [2022-07-12 18:33:31,894 INFO L226 Difference]: Without dead ends: 1882 [2022-07-12 18:33:31,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2022-07-12 18:33:31,895 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 603 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 1455 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:31,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 1455 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:33:31,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2022-07-12 18:33:31,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1834. [2022-07-12 18:33:31,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1834 states, 1822 states have (on average 1.451701427003293) internal successors, (2645), 1833 states have internal predecessors, (2645), 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:31,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 2645 transitions. [2022-07-12 18:33:31,924 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 2645 transitions. Word has length 30 [2022-07-12 18:33:31,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:31,925 INFO L495 AbstractCegarLoop]: Abstraction has 1834 states and 2645 transitions. [2022-07-12 18:33:31,925 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:31,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 2645 transitions. [2022-07-12 18:33:31,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-12 18:33:31,925 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:31,925 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:31,938 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:32,135 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:32,135 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:32,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:32,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1575281728, now seen corresponding path program 1 times [2022-07-12 18:33:32,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:32,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091816427] [2022-07-12 18:33:32,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:32,136 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:32,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:32,138 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:32,140 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:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:32,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 18:33:32,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:32,277 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:32,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:32,319 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:32,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:32,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091816427] [2022-07-12 18:33:32,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091816427] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:32,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:33:32,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2022-07-12 18:33:32,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111154859] [2022-07-12 18:33:32,320 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:32,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:33:32,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:32,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:33:32,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:33:32,322 INFO L87 Difference]: Start difference. First operand 1834 states and 2645 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:32,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:32,454 INFO L93 Difference]: Finished difference Result 2281 states and 3229 transitions. [2022-07-12 18:33:32,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 18:33:32,455 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:32,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:32,462 INFO L225 Difference]: With dead ends: 2281 [2022-07-12 18:33:32,462 INFO L226 Difference]: Without dead ends: 2281 [2022-07-12 18:33:32,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:33:32,464 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:32,465 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:32,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2281 states. [2022-07-12 18:33:32,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2281 to 1782. [2022-07-12 18:33:32,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1782 states, 1770 states have (on average 1.435593220338983) internal successors, (2541), 1781 states have internal predecessors, (2541), 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:32,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 2541 transitions. [2022-07-12 18:33:32,501 INFO L78 Accepts]: Start accepts. Automaton has 1782 states and 2541 transitions. Word has length 33 [2022-07-12 18:33:32,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:32,502 INFO L495 AbstractCegarLoop]: Abstraction has 1782 states and 2541 transitions. [2022-07-12 18:33:32,502 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:32,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 2541 transitions. [2022-07-12 18:33:32,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 18:33:32,504 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:32,504 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:32,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-12 18:33:32,712 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:32,713 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:32,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:32,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1822753242, now seen corresponding path program 1 times [2022-07-12 18:33:32,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:32,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305354840] [2022-07-12 18:33:32,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:32,715 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:32,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:32,716 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:32,718 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:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:32,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 18:33:32,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:32,902 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:32,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:32,964 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:32,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:32,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305354840] [2022-07-12 18:33:32,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1305354840] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:32,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:33:32,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-07-12 18:33:32,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233158490] [2022-07-12 18:33:32,965 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:32,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:33:32,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:32,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:33:32,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:33:32,966 INFO L87 Difference]: Start difference. First operand 1782 states and 2541 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:33,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:33,154 INFO L93 Difference]: Finished difference Result 2267 states and 3177 transitions. [2022-07-12 18:33:33,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 18:33:33,155 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:33,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:33,163 INFO L225 Difference]: With dead ends: 2267 [2022-07-12 18:33:33,163 INFO L226 Difference]: Without dead ends: 2267 [2022-07-12 18:33:33,164 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:33,164 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:33,164 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:33,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2267 states. [2022-07-12 18:33:33,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2267 to 1756. [2022-07-12 18:33:33,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1744 states have (on average 1.427178899082569) internal successors, (2489), 1755 states have internal predecessors, (2489), 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:33,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 2489 transitions. [2022-07-12 18:33:33,199 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 2489 transitions. Word has length 41 [2022-07-12 18:33:33,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:33,200 INFO L495 AbstractCegarLoop]: Abstraction has 1756 states and 2489 transitions. [2022-07-12 18:33:33,200 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:33,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2489 transitions. [2022-07-12 18:33:33,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-12 18:33:33,200 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:33,201 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:33,210 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:33,410 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:33,410 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:33,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:33,411 INFO L85 PathProgramCache]: Analyzing trace with hash 685518324, now seen corresponding path program 2 times [2022-07-12 18:33:33,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:33,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [622246201] [2022-07-12 18:33:33,411 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:33:33,411 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:33,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:33,413 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:33,414 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:33,493 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:33:33,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:33:33,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 18:33:33,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:33,589 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:33,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:33,995 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:33,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:33,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [622246201] [2022-07-12 18:33:33,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [622246201] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:33,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:33:33,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2022-07-12 18:33:33,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543325806] [2022-07-12 18:33:33,996 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:33,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 18:33:33,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:33,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 18:33:33,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-07-12 18:33:33,998 INFO L87 Difference]: Start difference. First operand 1756 states and 2489 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:34,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:34,801 INFO L93 Difference]: Finished difference Result 2042 states and 2804 transitions. [2022-07-12 18:33:34,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 18:33:34,802 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:34,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:34,809 INFO L225 Difference]: With dead ends: 2042 [2022-07-12 18:33:34,809 INFO L226 Difference]: Without dead ends: 2042 [2022-07-12 18:33:34,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=237, Invalid=819, Unknown=0, NotChecked=0, Total=1056 [2022-07-12 18:33:34,810 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 738 mSDsluCounter, 1839 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 2048 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:34,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 2048 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:33:34,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2022-07-12 18:33:34,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 1982. [2022-07-12 18:33:34,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1982 states, 1970 states have (on average 1.4233502538071066) internal successors, (2804), 1981 states have internal predecessors, (2804), 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:34,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 2804 transitions. [2022-07-12 18:33:34,845 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 2804 transitions. Word has length 49 [2022-07-12 18:33:34,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:34,845 INFO L495 AbstractCegarLoop]: Abstraction has 1982 states and 2804 transitions. [2022-07-12 18:33:34,845 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:34,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 2804 transitions. [2022-07-12 18:33:34,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-12 18:33:34,847 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:34,847 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:34,856 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:35,055 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:35,056 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:35,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:35,057 INFO L85 PathProgramCache]: Analyzing trace with hash 34201258, now seen corresponding path program 1 times [2022-07-12 18:33:35,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:35,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [750100835] [2022-07-12 18:33:35,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:35,057 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:35,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:35,059 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:35,061 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:35,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:35,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 18:33:35,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:35,208 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 16 proven. 34 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-12 18:33:35,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:35,268 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 16 proven. 34 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-12 18:33:35,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:35,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [750100835] [2022-07-12 18:33:35,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [750100835] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:35,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:33:35,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-07-12 18:33:35,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192078782] [2022-07-12 18:33:35,271 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:35,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:33:35,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:35,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:33:35,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:33:35,272 INFO L87 Difference]: Start difference. First operand 1982 states and 2804 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:35,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:35,376 INFO L93 Difference]: Finished difference Result 3702 states and 5276 transitions. [2022-07-12 18:33:35,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:33:35,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-07-12 18:33:35,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:35,390 INFO L225 Difference]: With dead ends: 3702 [2022-07-12 18:33:35,390 INFO L226 Difference]: Without dead ends: 3702 [2022-07-12 18:33:35,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 97 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:35,391 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 114 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:35,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 155 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:33:35,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3702 states. [2022-07-12 18:33:35,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3702 to 3060. [2022-07-12 18:33:35,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3060 states, 3048 states have (on average 1.4337270341207349) internal successors, (4370), 3059 states have internal predecessors, (4370), 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:35,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3060 states to 3060 states and 4370 transitions. [2022-07-12 18:33:35,453 INFO L78 Accepts]: Start accepts. Automaton has 3060 states and 4370 transitions. Word has length 50 [2022-07-12 18:33:35,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:35,455 INFO L495 AbstractCegarLoop]: Abstraction has 3060 states and 4370 transitions. [2022-07-12 18:33:35,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:35,455 INFO L276 IsEmpty]: Start isEmpty. Operand 3060 states and 4370 transitions. [2022-07-12 18:33:35,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-12 18:33:35,456 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:35,456 INFO L195 NwaCegarLoop]: trace histogram [8, 5, 5, 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:33:35,465 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:35,665 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:35,666 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:33:35,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:35,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1339034765, now seen corresponding path program 1 times [2022-07-12 18:33:35,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:35,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [807840667] [2022-07-12 18:33:35,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:35,667 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:35,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:35,669 INFO L229 MonitoredProcess]: Starting monitored process 20 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:35,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-12 18:33:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:35,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 18:33:35,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:35,776 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:33:35,849 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 18 proven. 34 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-12 18:33:35,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:35,911 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 18 proven. 34 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-12 18:33:35,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:35,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [807840667] [2022-07-12 18:33:35,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [807840667] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:35,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:33:35,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-07-12 18:33:35,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257853168] [2022-07-12 18:33:35,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:35,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:33:35,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:35,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:33:35,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:33:35,912 INFO L87 Difference]: Start difference. First operand 3060 states and 4370 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:36,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:36,257 INFO L93 Difference]: Finished difference Result 6279 states and 8905 transitions. [2022-07-12 18:33:36,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:33:36,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-07-12 18:33:36,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:36,275 INFO L225 Difference]: With dead ends: 6279 [2022-07-12 18:33:36,275 INFO L226 Difference]: Without dead ends: 6279 [2022-07-12 18:33:36,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:33:36,276 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 245 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:36,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 219 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:33:36,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6279 states. [2022-07-12 18:33:36,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6279 to 5707. [2022-07-12 18:33:36,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5707 states, 5696 states have (on average 1.4332865168539326) internal successors, (8164), 5706 states have internal predecessors, (8164), 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:36,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5707 states to 5707 states and 8164 transitions. [2022-07-12 18:33:36,378 INFO L78 Accepts]: Start accepts. Automaton has 5707 states and 8164 transitions. Word has length 53 [2022-07-12 18:33:36,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:36,378 INFO L495 AbstractCegarLoop]: Abstraction has 5707 states and 8164 transitions. [2022-07-12 18:33:36,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:36,378 INFO L276 IsEmpty]: Start isEmpty. Operand 5707 states and 8164 transitions. [2022-07-12 18:33:36,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-12 18:33:36,379 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:36,379 INFO L195 NwaCegarLoop]: trace histogram [8, 5, 5, 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:33:36,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-12 18:33:36,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:33:36,589 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:33:36,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:36,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1339034764, now seen corresponding path program 1 times [2022-07-12 18:33:36,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:36,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082364626] [2022-07-12 18:33:36,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:36,591 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:36,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:36,592 INFO L229 MonitoredProcess]: Starting monitored process 21 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:36,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-12 18:33:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:36,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 18:33:36,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:36,697 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:33:36,889 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 18 proven. 34 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-12 18:33:36,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:37,313 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 18 proven. 34 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-12 18:33:37,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:37,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082364626] [2022-07-12 18:33:37,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1082364626] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:37,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:33:37,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-07-12 18:33:37,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600275867] [2022-07-12 18:33:37,313 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:37,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:33:37,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:37,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:33:37,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:33:37,314 INFO L87 Difference]: Start difference. First operand 5707 states and 8164 transitions. Second operand has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 8 states have internal predecessors, (64), 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:38,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:38,014 INFO L93 Difference]: Finished difference Result 9231 states and 12960 transitions. [2022-07-12 18:33:38,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:33:38,016 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 8 states have internal predecessors, (64), 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 53 [2022-07-12 18:33:38,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:38,041 INFO L225 Difference]: With dead ends: 9231 [2022-07-12 18:33:38,041 INFO L226 Difference]: Without dead ends: 9231 [2022-07-12 18:33:38,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:33:38,042 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 289 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:38,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 439 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 18:33:38,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9231 states. [2022-07-12 18:33:38,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9231 to 8090. [2022-07-12 18:33:38,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8090 states, 8079 states have (on average 1.4227008293105583) internal successors, (11494), 8089 states have internal predecessors, (11494), 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:38,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8090 states to 8090 states and 11494 transitions. [2022-07-12 18:33:38,197 INFO L78 Accepts]: Start accepts. Automaton has 8090 states and 11494 transitions. Word has length 53 [2022-07-12 18:33:38,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:38,197 INFO L495 AbstractCegarLoop]: Abstraction has 8090 states and 11494 transitions. [2022-07-12 18:33:38,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 8 states have internal predecessors, (64), 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:38,198 INFO L276 IsEmpty]: Start isEmpty. Operand 8090 states and 11494 transitions. [2022-07-12 18:33:38,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-12 18:33:38,199 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:38,200 INFO L195 NwaCegarLoop]: trace histogram [9, 6, 6, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:38,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-12 18:33:38,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:33:38,409 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:33:38,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:38,410 INFO L85 PathProgramCache]: Analyzing trace with hash -137690402, now seen corresponding path program 1 times [2022-07-12 18:33:38,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:38,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2069385267] [2022-07-12 18:33:38,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:38,410 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:38,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:38,412 INFO L229 MonitoredProcess]: Starting monitored process 22 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:38,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-12 18:33:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:38,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 18:33:38,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:38,590 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 46 proven. 31 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-12 18:33:38,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:38,654 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 46 proven. 31 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-12 18:33:38,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:38,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2069385267] [2022-07-12 18:33:38,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2069385267] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:38,654 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:33:38,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2022-07-12 18:33:38,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126350229] [2022-07-12 18:33:38,655 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:38,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:33:38,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:38,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:33:38,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:33:38,656 INFO L87 Difference]: Start difference. First operand 8090 states and 11494 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 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:38,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:38,776 INFO L93 Difference]: Finished difference Result 9947 states and 13704 transitions. [2022-07-12 18:33:38,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 18:33:38,777 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 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 68 [2022-07-12 18:33:38,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:38,794 INFO L225 Difference]: With dead ends: 9947 [2022-07-12 18:33:38,795 INFO L226 Difference]: Without dead ends: 9947 [2022-07-12 18:33:38,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:33:38,796 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 337 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:38,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 995 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:33:38,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9947 states. [2022-07-12 18:33:38,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9947 to 7602. [2022-07-12 18:33:38,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7602 states, 7591 states have (on average 1.4090370175207483) internal successors, (10696), 7601 states have internal predecessors, (10696), 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:38,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7602 states to 7602 states and 10696 transitions. [2022-07-12 18:33:38,920 INFO L78 Accepts]: Start accepts. Automaton has 7602 states and 10696 transitions. Word has length 68 [2022-07-12 18:33:38,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:38,920 INFO L495 AbstractCegarLoop]: Abstraction has 7602 states and 10696 transitions. [2022-07-12 18:33:38,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 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:38,921 INFO L276 IsEmpty]: Start isEmpty. Operand 7602 states and 10696 transitions. [2022-07-12 18:33:38,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-12 18:33:38,923 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:38,923 INFO L195 NwaCegarLoop]: trace histogram [11, 6, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:38,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-12 18:33:39,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:33:39,132 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-07-12 18:33:39,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:39,133 INFO L85 PathProgramCache]: Analyzing trace with hash -231185729, now seen corresponding path program 1 times [2022-07-12 18:33:39,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:39,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [990082937] [2022-07-12 18:33:39,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:39,134 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:39,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:39,135 INFO L229 MonitoredProcess]: Starting monitored process 23 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:39,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-12 18:33:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:39,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 18:33:39,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:39,300 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 68 proven. 31 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-12 18:33:39,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:39,536 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 68 proven. 31 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-12 18:33:39,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:39,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [990082937] [2022-07-12 18:33:39,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [990082937] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:33:39,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:33:39,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-07-12 18:33:39,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224287927] [2022-07-12 18:33:39,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:39,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 18:33:39,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:39,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 18:33:39,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:33:39,539 INFO L87 Difference]: Start difference. First operand 7602 states and 10696 transitions. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:39,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:39,768 INFO L93 Difference]: Finished difference Result 11869 states and 16395 transitions. [2022-07-12 18:33:39,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 18:33:39,769 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2022-07-12 18:33:39,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:39,789 INFO L225 Difference]: With dead ends: 11869 [2022-07-12 18:33:39,790 INFO L226 Difference]: Without dead ends: 11869 [2022-07-12 18:33:39,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-07-12 18:33:39,792 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 517 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:39,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 853 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:33:39,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11869 states. [2022-07-12 18:33:39,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11869 to 11460. [2022-07-12 18:33:39,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11460 states, 11449 states have (on average 1.3871953882435146) internal successors, (15882), 11459 states have internal predecessors, (15882), 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:39,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11460 states to 11460 states and 15882 transitions. [2022-07-12 18:33:39,947 INFO L78 Accepts]: Start accepts. Automaton has 11460 states and 15882 transitions. Word has length 71 [2022-07-12 18:33:39,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:39,948 INFO L495 AbstractCegarLoop]: Abstraction has 11460 states and 15882 transitions. [2022-07-12 18:33:39,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:39,948 INFO L276 IsEmpty]: Start isEmpty. Operand 11460 states and 15882 transitions. [2022-07-12 18:33:39,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-12 18:33:39,952 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:39,952 INFO L195 NwaCegarLoop]: trace histogram [10, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:39,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-12 18:33:40,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:33:40,162 INFO L420 AbstractCegarLoop]: === Iteration 23 === 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:40,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:40,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1631832859, now seen corresponding path program 1 times [2022-07-12 18:33:40,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:40,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096088621] [2022-07-12 18:33:40,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:40,163 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:40,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:40,165 INFO L229 MonitoredProcess]: Starting monitored process 24 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:40,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-12 18:33:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 18:33:40,299 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 18:33:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 18:33:40,485 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-12 18:33:40,485 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 18:33:40,486 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2022-07-12 18:33:40,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2022-07-12 18:33:40,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2022-07-12 18:33:40,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2022-07-12 18:33:40,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2022-07-12 18:33:40,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2022-07-12 18:33:40,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2022-07-12 18:33:40,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2022-07-12 18:33:40,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2022-07-12 18:33:40,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2022-07-12 18:33:40,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2022-07-12 18:33:40,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2022-07-12 18:33:40,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2022-07-12 18:33:40,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2022-07-12 18:33:40,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2022-07-12 18:33:40,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2022-07-12 18:33:40,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2022-07-12 18:33:40,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2022-07-12 18:33:40,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2022-07-12 18:33:40,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2022-07-12 18:33:40,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2022-07-12 18:33:40,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:33:40,721 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:40,724 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 18:33:40,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 06:33:40 BoogieIcfgContainer [2022-07-12 18:33:40,804 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 18:33:40,804 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 18:33:40,804 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 18:33:40,804 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 18:33:40,805 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:33:25" (3/4) ... [2022-07-12 18:33:40,807 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 18:33:40,807 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 18:33:40,808 INFO L158 Benchmark]: Toolchain (without parser) took 16819.40ms. Allocated memory was 67.1MB in the beginning and 190.8MB in the end (delta: 123.7MB). Free memory was 49.5MB in the beginning and 89.5MB in the end (delta: -40.1MB). Peak memory consumption was 85.7MB. Max. memory is 16.1GB. [2022-07-12 18:33:40,808 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 67.1MB. Free memory is still 50.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:33:40,808 INFO L158 Benchmark]: CACSL2BoogieTranslator took 451.46ms. Allocated memory is still 67.1MB. Free memory was 49.3MB in the beginning and 44.3MB in the end (delta: 5.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-12 18:33:40,808 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.29ms. Allocated memory is still 67.1MB. Free memory was 44.3MB in the beginning and 41.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 18:33:40,809 INFO L158 Benchmark]: Boogie Preprocessor took 64.66ms. Allocated memory is still 67.1MB. Free memory was 41.9MB in the beginning and 40.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 18:33:40,809 INFO L158 Benchmark]: RCFGBuilder took 517.00ms. Allocated memory is still 67.1MB. Free memory was 40.1MB in the beginning and 44.4MB in the end (delta: -4.3MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2022-07-12 18:33:40,809 INFO L158 Benchmark]: TraceAbstraction took 15721.68ms. Allocated memory was 67.1MB in the beginning and 190.8MB in the end (delta: 123.7MB). Free memory was 43.8MB in the beginning and 89.5MB in the end (delta: -45.7MB). Peak memory consumption was 124.1MB. Max. memory is 16.1GB. [2022-07-12 18:33:40,809 INFO L158 Benchmark]: Witness Printer took 3.17ms. Allocated memory is still 190.8MB. Free memory is still 89.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:33:40,811 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.28ms. Allocated memory is still 67.1MB. Free memory is still 50.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 451.46ms. Allocated memory is still 67.1MB. Free memory was 49.3MB in the beginning and 44.3MB in the end (delta: 5.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.29ms. Allocated memory is still 67.1MB. Free memory was 44.3MB in the beginning and 41.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.66ms. Allocated memory is still 67.1MB. Free memory was 41.9MB in the beginning and 40.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 517.00ms. Allocated memory is still 67.1MB. Free memory was 40.1MB in the beginning and 44.4MB in the end (delta: -4.3MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * TraceAbstraction took 15721.68ms. Allocated memory was 67.1MB in the beginning and 190.8MB in the end (delta: 123.7MB). Free memory was 43.8MB in the beginning and 89.5MB in the end (delta: -45.7MB). Peak memory consumption was 124.1MB. Max. memory is 16.1GB. * Witness Printer took 3.17ms. Allocated memory is still 190.8MB. Free memory is still 89.5MB. 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 S || 1 != pc1 || __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 S || 1 != pc1 || __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 S || 1 != pc1 || __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 S || 1 != pc1 || __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 S || 1 != pc1 || __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 S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() [L567] pc4++ [L568] case 1: [L569] t4 = S VAL [garbage={0:0}, pc1=6, pc4=2, pc4++=1, res4=0, S={6:0}, t1={0:0}, t4={6:0}, x1={6:0}, x4={0:0}] [L598] RET pop() [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() [L567] pc4++ [L568] case 1: [L571] case 2: VAL [garbage={0:0}, pc1=6, pc4=3, pc4++=2, res4=0, S={6:0}, t1={0:0}, t4={6:0}, x1={6:0}, x4={0:0}] [L572] COND FALSE !(t4 == ((void *)0)) VAL [garbage={0:0}, pc1=6, pc4=3, pc4++=2, res4=0, S={6:0}, t1={0:0}, t4={6:0}, x1={6:0}, x4={0:0}] [L598] RET pop() [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() [L567] pc4++ [L568] case 1: [L571] case 2: [L575] case 3: VAL [garbage={0:0}, pc1=6, pc4=4, pc4++=3, res4=0, S={6:0}, t1={0:0}, t4={6:0}, x1={6:0}, x4={0:0}] [L576] EXPR t4->next VAL [garbage={0:0}, pc1=6, pc4=4, pc4++=3, res4=0, S={6:0}, t1={0:0}, t4={6:0}, t4->next={0:0}, x1={6:0}, x4={0:0}] [L576] x4 = t4->next [L598] RET pop() [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() [L567] pc4++ [L568] case 1: [L571] case 2: [L575] case 3: [L578] case 4: VAL [garbage={0:0}, pc1=6, pc4=5, pc4++=4, res4=0, S={6:0}, t1={0:0}, t4={6:0}, x1={6:0}, x4={0:0}] [L579] COND TRUE S == t4 [L580] S = x4 VAL [garbage={0:0}, pc1=6, pc4=5, pc4++=4, res4=0, S={0:0}, t1={0:0}, t4={6:0}, x1={6:0}, x4={0:0}] [L598] RET pop() [L594] COND TRUE S || 1 != pc1 || __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=5, res4=0, S={0:0}, t1={0:0}, t4={6:0}, x1={6:0}, x4={0:0}] [L596] RET push() [L594] COND FALSE !(S || 1 != pc1 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) VAL [garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={6: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=5, 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: 15.6s, OverallIterations: 23, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5369 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5369 mSDsluCounter, 13248 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10179 mSDsCounter, 412 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1698 IncrementalHoareTripleChecker+Invalid, 2110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 412 mSolverCounterUnsat, 3069 mSDtfsCounter, 1698 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1255 GetRequests, 1057 SyntacticMatches, 12 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11460occurred in iteration=22, InterpolantAutomatonStates: 198, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 22 MinimizatonAttempts, 7546 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 695 NumberOfCodeBlocks, 695 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1162 ConstructedInterpolants, 0 QuantifiedInterpolants, 5578 SizeOfPredicates, 53 NumberOfNonLiveVariables, 2504 ConjunctsInSsa, 143 ConjunctsInUnsatCore, 38 InterpolantComputations, 6 PerfectInterpolantSequences, 1030/1696 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:40,845 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