./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_15-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f4b24e32 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/locks/test_locks_15-1.c -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 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 07:06:05,735 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 07:06:05,737 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 07:06:05,756 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 07:06:05,757 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 07:06:05,757 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 07:06:05,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 07:06:05,759 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 07:06:05,761 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 07:06:05,761 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 07:06:05,762 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 07:06:05,763 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 07:06:05,763 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 07:06:05,764 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 07:06:05,765 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 07:06:05,765 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 07:06:05,766 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 07:06:05,767 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 07:06:05,768 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 07:06:05,769 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 07:06:05,770 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 07:06:05,774 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 07:06:05,774 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 07:06:05,778 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 07:06:05,779 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 07:06:05,781 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 07:06:05,782 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 07:06:05,782 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 07:06:05,783 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 07:06:05,785 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 07:06:05,786 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 07:06:05,786 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 07:06:05,787 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 07:06:05,787 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 07:06:05,788 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 07:06:05,789 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 07:06:05,790 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 07:06:05,790 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 07:06:05,791 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 07:06:05,791 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 07:06:05,792 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 07:06:05,792 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 07:06:05,794 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-14 07:06:05,811 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 07:06:05,812 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 07:06:05,812 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 07:06:05,812 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 07:06:05,813 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 07:06:05,813 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 07:06:05,813 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 07:06:05,814 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 07:06:05,814 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 07:06:05,814 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 07:06:05,815 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 07:06:05,815 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 07:06:05,815 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 07:06:05,815 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 07:06:05,815 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 07:06:05,815 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 07:06:05,816 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 07:06:05,816 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 07:06:05,816 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 07:06:05,816 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 07:06:05,816 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 07:06:05,816 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 07:06:05,816 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 07:06:05,817 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 07:06:05,818 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 07:06:05,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 07:06:05,818 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 07:06:05,818 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 07:06:05,818 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 07:06:05,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 07:06:05,819 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 -> 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 [2022-07-14 07:06:05,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 07:06:06,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 07:06:06,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 07:06:06,005 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 07:06:06,005 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 07:06:06,006 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_15-1.c [2022-07-14 07:06:06,048 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d01226cc2/fb27ce26c33849efa4b520c006d1c24c/FLAG27c949a34 [2022-07-14 07:06:06,440 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 07:06:06,441 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-1.c [2022-07-14 07:06:06,448 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d01226cc2/fb27ce26c33849efa4b520c006d1c24c/FLAG27c949a34 [2022-07-14 07:06:06,866 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d01226cc2/fb27ce26c33849efa4b520c006d1c24c [2022-07-14 07:06:06,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 07:06:06,870 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 07:06:06,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 07:06:06,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 07:06:06,874 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 07:06:06,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 07:06:06" (1/1) ... [2022-07-14 07:06:06,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b80146f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:06, skipping insertion in model container [2022-07-14 07:06:06,877 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 07:06:06" (1/1) ... [2022-07-14 07:06:06,881 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 07:06:06,897 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 07:06:07,080 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-1.c[5654,5667] [2022-07-14 07:06:07,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 07:06:07,093 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 07:06:07,123 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-1.c[5654,5667] [2022-07-14 07:06:07,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 07:06:07,137 INFO L208 MainTranslator]: Completed translation [2022-07-14 07:06:07,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:07 WrapperNode [2022-07-14 07:06:07,139 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 07:06:07,140 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 07:06:07,140 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 07:06:07,140 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 07:06:07,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:07" (1/1) ... [2022-07-14 07:06:07,158 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:07" (1/1) ... [2022-07-14 07:06:07,179 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 195 [2022-07-14 07:06:07,180 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 07:06:07,181 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 07:06:07,181 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 07:06:07,181 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 07:06:07,187 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:07" (1/1) ... [2022-07-14 07:06:07,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:07" (1/1) ... [2022-07-14 07:06:07,195 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:07" (1/1) ... [2022-07-14 07:06:07,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:07" (1/1) ... [2022-07-14 07:06:07,203 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:07" (1/1) ... [2022-07-14 07:06:07,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:07" (1/1) ... [2022-07-14 07:06:07,211 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:07" (1/1) ... [2022-07-14 07:06:07,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 07:06:07,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 07:06:07,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 07:06:07,217 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 07:06:07,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:07" (1/1) ... [2022-07-14 07:06:07,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 07:06:07,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:06:07,248 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-14 07:06:07,265 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-14 07:06:07,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 07:06:07,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 07:06:07,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 07:06:07,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 07:06:07,357 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 07:06:07,358 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 07:06:07,567 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 07:06:07,571 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 07:06:07,572 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-14 07:06:07,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 07:06:07 BoogieIcfgContainer [2022-07-14 07:06:07,573 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 07:06:07,574 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 07:06:07,575 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 07:06:07,586 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 07:06:07,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 07:06:06" (1/3) ... [2022-07-14 07:06:07,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d520ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 07:06:07, skipping insertion in model container [2022-07-14 07:06:07,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:07" (2/3) ... [2022-07-14 07:06:07,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d520ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 07:06:07, skipping insertion in model container [2022-07-14 07:06:07,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 07:06:07" (3/3) ... [2022-07-14 07:06:07,588 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_15-1.c [2022-07-14 07:06:07,598 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 07:06:07,598 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-14 07:06:07,628 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 07:06:07,634 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@75452678, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3ff2d32c [2022-07-14 07:06:07,635 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-14 07:06:07,641 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 55 states have internal predecessors, (103), 0 states have call successors, (0), 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-14 07:06:07,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 07:06:07,654 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:07,654 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 07:06:07,655 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:06:07,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:07,665 INFO L85 PathProgramCache]: Analyzing trace with hash 28959891, now seen corresponding path program 1 times [2022-07-14 07:06:07,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:06:07,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147077598] [2022-07-14 07:06:07,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:07,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:06:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:07,778 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-14 07:06:07,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:06:07,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147077598] [2022-07-14 07:06:07,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147077598] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:07,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:07,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 07:06:07,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816738847] [2022-07-14 07:06:07,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:07,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-14 07:06:07,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:06:07,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 07:06:07,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 07:06:07,811 INFO L87 Difference]: Start difference. First operand has 56 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 55 states have internal predecessors, (103), 0 states have call successors, (0), 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-14 07:06:07,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:07,823 INFO L93 Difference]: Finished difference Result 56 states and 100 transitions. [2022-07-14 07:06:07,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 07:06:07,825 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-14 07:06:07,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:07,830 INFO L225 Difference]: With dead ends: 56 [2022-07-14 07:06:07,830 INFO L226 Difference]: Without dead ends: 54 [2022-07-14 07:06:07,832 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-14 07:06:07,838 INFO L413 NwaCegarLoop]: 100 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, 100 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-14 07:06:07,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:06:07,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-14 07:06:07,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-07-14 07:06:07,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.8846153846153846) internal successors, (98), 53 states have internal predecessors, (98), 0 states have call successors, (0), 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-14 07:06:07,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 98 transitions. [2022-07-14 07:06:07,870 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 98 transitions. Word has length 5 [2022-07-14 07:06:07,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:07,871 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 98 transitions. [2022-07-14 07:06:07,872 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-14 07:06:07,872 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 98 transitions. [2022-07-14 07:06:07,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 07:06:07,872 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:07,873 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 07:06:07,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 07:06:07,873 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:06:07,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:07,874 INFO L85 PathProgramCache]: Analyzing trace with hash 889700683, now seen corresponding path program 1 times [2022-07-14 07:06:07,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:06:07,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936120665] [2022-07-14 07:06:07,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:07,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:06:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:07,939 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-14 07:06:07,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:06:07,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936120665] [2022-07-14 07:06:07,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936120665] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:07,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:07,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 07:06:07,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686811453] [2022-07-14 07:06:07,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:07,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:06:07,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:06:07,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:06:07,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:06:07,945 INFO L87 Difference]: Start difference. First operand 54 states and 98 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-14 07:06:07,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:07,962 INFO L93 Difference]: Finished difference Result 53 states and 97 transitions. [2022-07-14 07:06:07,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:06:07,963 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-14 07:06:07,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:07,964 INFO L225 Difference]: With dead ends: 53 [2022-07-14 07:06:07,964 INFO L226 Difference]: Without dead ends: 51 [2022-07-14 07:06:07,967 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-14 07:06:07,968 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:06:07,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 97 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:06:07,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-14 07:06:07,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-07-14 07:06:07,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 0 states have call successors, (0), 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-14 07:06:07,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 95 transitions. [2022-07-14 07:06:07,980 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 95 transitions. Word has length 6 [2022-07-14 07:06:07,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:07,981 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 95 transitions. [2022-07-14 07:06:07,982 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-14 07:06:07,982 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 95 transitions. [2022-07-14 07:06:07,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 07:06:07,983 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:07,983 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:06:07,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 07:06:07,984 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:06:07,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:07,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1188553263, now seen corresponding path program 1 times [2022-07-14 07:06:07,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:06:07,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482167059] [2022-07-14 07:06:07,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:07,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:06:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:08,046 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-14 07:06:08,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:06:08,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482167059] [2022-07-14 07:06:08,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482167059] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:08,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:08,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 07:06:08,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837073622] [2022-07-14 07:06:08,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:08,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:06:08,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:06:08,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:06:08,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:06:08,048 INFO L87 Difference]: Start difference. First operand 51 states and 95 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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-14 07:06:08,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:08,066 INFO L93 Difference]: Finished difference Result 99 states and 184 transitions. [2022-07-14 07:06:08,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:06:08,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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-14 07:06:08,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:08,068 INFO L225 Difference]: With dead ends: 99 [2022-07-14 07:06:08,068 INFO L226 Difference]: Without dead ends: 99 [2022-07-14 07:06:08,068 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-14 07:06:08,069 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 76 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:06:08,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 240 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:06:08,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-14 07:06:08,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2022-07-14 07:06:08,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.90625) internal successors, (183), 96 states have internal predecessors, (183), 0 states have call successors, (0), 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-14 07:06:08,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 183 transitions. [2022-07-14 07:06:08,077 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 183 transitions. Word has length 22 [2022-07-14 07:06:08,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:08,077 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 183 transitions. [2022-07-14 07:06:08,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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-14 07:06:08,077 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 183 transitions. [2022-07-14 07:06:08,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 07:06:08,078 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:08,078 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:06:08,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 07:06:08,079 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:06:08,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:08,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1188560455, now seen corresponding path program 1 times [2022-07-14 07:06:08,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:06:08,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023177448] [2022-07-14 07:06:08,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:08,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:06:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:08,113 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-14 07:06:08,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:06:08,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023177448] [2022-07-14 07:06:08,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023177448] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:08,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:08,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 07:06:08,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650274997] [2022-07-14 07:06:08,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:08,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:06:08,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:06:08,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:06:08,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:06:08,116 INFO L87 Difference]: Start difference. First operand 97 states and 183 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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-14 07:06:08,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:08,127 INFO L93 Difference]: Finished difference Result 98 states and 184 transitions. [2022-07-14 07:06:08,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:06:08,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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-14 07:06:08,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:08,128 INFO L225 Difference]: With dead ends: 98 [2022-07-14 07:06:08,128 INFO L226 Difference]: Without dead ends: 98 [2022-07-14 07:06:08,129 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-14 07:06:08,129 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 14 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:06:08,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 184 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:06:08,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-14 07:06:08,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-07-14 07:06:08,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.8969072164948453) internal successors, (184), 97 states have internal predecessors, (184), 0 states have call successors, (0), 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-14 07:06:08,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 184 transitions. [2022-07-14 07:06:08,136 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 184 transitions. Word has length 22 [2022-07-14 07:06:08,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:08,136 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 184 transitions. [2022-07-14 07:06:08,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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-14 07:06:08,143 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 184 transitions. [2022-07-14 07:06:08,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 07:06:08,143 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:08,144 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:06:08,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 07:06:08,144 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:06:08,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:08,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1112269327, now seen corresponding path program 1 times [2022-07-14 07:06:08,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:06:08,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981654242] [2022-07-14 07:06:08,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:08,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:06:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:08,174 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-14 07:06:08,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:06:08,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981654242] [2022-07-14 07:06:08,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981654242] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:08,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:08,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 07:06:08,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130584885] [2022-07-14 07:06:08,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:08,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:06:08,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:06:08,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:06:08,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:06:08,177 INFO L87 Difference]: Start difference. First operand 98 states and 184 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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-14 07:06:08,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:08,189 INFO L93 Difference]: Finished difference Result 137 states and 251 transitions. [2022-07-14 07:06:08,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:06:08,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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-14 07:06:08,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:08,191 INFO L225 Difference]: With dead ends: 137 [2022-07-14 07:06:08,191 INFO L226 Difference]: Without dead ends: 137 [2022-07-14 07:06:08,191 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-14 07:06:08,192 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 76 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:06:08,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 134 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:06:08,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-07-14 07:06:08,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-07-14 07:06:08,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.8656716417910448) internal successors, (250), 134 states have internal predecessors, (250), 0 states have call successors, (0), 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-14 07:06:08,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 250 transitions. [2022-07-14 07:06:08,200 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 250 transitions. Word has length 22 [2022-07-14 07:06:08,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:08,200 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 250 transitions. [2022-07-14 07:06:08,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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-14 07:06:08,201 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 250 transitions. [2022-07-14 07:06:08,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 07:06:08,201 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:08,202 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:06:08,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 07:06:08,202 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:06:08,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:08,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1112262135, now seen corresponding path program 1 times [2022-07-14 07:06:08,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:06:08,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485032554] [2022-07-14 07:06:08,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:08,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:06:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:08,229 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-14 07:06:08,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:06:08,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485032554] [2022-07-14 07:06:08,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485032554] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:08,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:08,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 07:06:08,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426546466] [2022-07-14 07:06:08,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:08,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:06:08,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:06:08,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:06:08,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:06:08,231 INFO L87 Difference]: Start difference. First operand 135 states and 250 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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-14 07:06:08,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:08,241 INFO L93 Difference]: Finished difference Result 135 states and 244 transitions. [2022-07-14 07:06:08,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:06:08,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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-14 07:06:08,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:08,242 INFO L225 Difference]: With dead ends: 135 [2022-07-14 07:06:08,242 INFO L226 Difference]: Without dead ends: 135 [2022-07-14 07:06:08,243 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-14 07:06:08,243 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 74 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:06:08,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 212 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:06:08,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-14 07:06:08,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2022-07-14 07:06:08,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.8409090909090908) internal successors, (243), 132 states have internal predecessors, (243), 0 states have call successors, (0), 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-14 07:06:08,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 243 transitions. [2022-07-14 07:06:08,249 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 243 transitions. Word has length 22 [2022-07-14 07:06:08,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:08,250 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 243 transitions. [2022-07-14 07:06:08,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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-14 07:06:08,250 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 243 transitions. [2022-07-14 07:06:08,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 07:06:08,251 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:08,251 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:06:08,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 07:06:08,251 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:06:08,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:08,252 INFO L85 PathProgramCache]: Analyzing trace with hash -476078575, now seen corresponding path program 1 times [2022-07-14 07:06:08,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:06:08,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122720905] [2022-07-14 07:06:08,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:08,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:06:08,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 07:06:08,265 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 07:06:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 07:06:08,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 07:06:08,290 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-14 07:06:08,290 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-07-14 07:06:08,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-07-14 07:06:08,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 07:06:08,294 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:06:08,296 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-14 07:06:08,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.07 07:06:08 BoogieIcfgContainer [2022-07-14 07:06:08,331 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-14 07:06:08,331 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 07:06:08,332 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 07:06:08,332 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 07:06:08,332 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 07:06:07" (3/4) ... [2022-07-14 07:06:08,334 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-14 07:06:08,334 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 07:06:08,335 INFO L158 Benchmark]: Toolchain (without parser) took 1464.31ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 60.3MB in the beginning and 62.4MB in the end (delta: -2.1MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2022-07-14 07:06:08,335 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 92.3MB. Free memory is still 45.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 07:06:08,335 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.83ms. Allocated memory is still 92.3MB. Free memory was 60.1MB in the beginning and 66.0MB in the end (delta: -5.9MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2022-07-14 07:06:08,336 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.80ms. Allocated memory is still 92.3MB. Free memory was 66.0MB in the beginning and 63.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 07:06:08,336 INFO L158 Benchmark]: Boogie Preprocessor took 35.68ms. Allocated memory is still 92.3MB. Free memory was 63.9MB in the beginning and 62.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 07:06:08,336 INFO L158 Benchmark]: RCFGBuilder took 356.33ms. Allocated memory is still 92.3MB. Free memory was 62.4MB in the beginning and 47.3MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-14 07:06:08,337 INFO L158 Benchmark]: TraceAbstraction took 756.59ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 46.7MB in the beginning and 62.4MB in the end (delta: -15.7MB). Peak memory consumption was 3.2MB. Max. memory is 16.1GB. [2022-07-14 07:06:08,337 INFO L158 Benchmark]: Witness Printer took 2.76ms. Allocated memory is still 111.1MB. Free memory was 62.4MB in the beginning and 62.4MB in the end (delta: 2.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 07:06:08,338 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 92.3MB. Free memory is still 45.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.83ms. Allocated memory is still 92.3MB. Free memory was 60.1MB in the beginning and 66.0MB in the end (delta: -5.9MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.80ms. Allocated memory is still 92.3MB. Free memory was 66.0MB in the beginning and 63.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.68ms. Allocated memory is still 92.3MB. Free memory was 63.9MB in the beginning and 62.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 356.33ms. Allocated memory is still 92.3MB. Free memory was 62.4MB in the beginning and 47.3MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 756.59ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 46.7MB in the beginning and 62.4MB in the end (delta: -15.7MB). Peak memory consumption was 3.2MB. Max. memory is 16.1GB. * Witness Printer took 2.76ms. Allocated memory is still 111.1MB. Free memory was 62.4MB in the beginning and 62.4MB in the end (delta: 2.6kB). There was no memory consumed. Max. memory is 16.1GB. * 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: 233]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 233. Possible FailurePath: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L50] int p15 = __VERIFIER_nondet_int(); [L51] int lk15; [L54] int cond; VAL [p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L56] COND TRUE 1 [L57] cond = __VERIFIER_nondet_int() [L58] COND FALSE !(cond == 0) [L61] lk1 = 0 [L63] lk2 = 0 [L65] lk3 = 0 [L67] lk4 = 0 [L69] lk5 = 0 [L71] lk6 = 0 [L73] lk7 = 0 [L75] lk8 = 0 [L77] lk9 = 0 [L79] lk10 = 0 [L81] lk11 = 0 [L83] lk12 = 0 [L85] lk13 = 0 [L87] lk14 = 0 [L89] lk15 = 0 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L93] COND FALSE !(p1 != 0) VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L97] COND FALSE !(p2 != 0) VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L101] COND FALSE !(p3 != 0) VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L105] COND TRUE p4 != 0 [L106] lk4 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L109] COND TRUE p5 != 0 [L110] lk5 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L113] COND TRUE p6 != 0 [L114] lk6 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L117] COND TRUE p7 != 0 [L118] lk7 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L121] COND TRUE p8 != 0 [L122] lk8 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L125] COND TRUE p9 != 0 [L126] lk9 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L129] COND TRUE p10 != 0 [L130] lk10 = 1 VAL [cond=1, lk1=0, lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L133] COND FALSE !(p11 != 0) VAL [cond=1, lk1=0, lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L137] COND TRUE p12 != 0 [L138] lk12 = 1 VAL [cond=1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L141] COND TRUE p13 != 0 [L142] lk13 = 1 VAL [cond=1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L145] COND TRUE p14 != 0 [L146] lk14 = 1 VAL [cond=1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L149] COND TRUE p15 != 0 [L150] lk15 = 1 VAL [cond=1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L155] COND FALSE !(p1 != 0) VAL [cond=1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L160] COND FALSE !(p2 != 0) VAL [cond=1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L233] reach_error() VAL [cond=1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] - UnprovableResult [Line: 6]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 56 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 332 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 332 mSDsluCounter, 967 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 303 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21 IncrementalHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 664 mSDtfsCounter, 21 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=5, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 253 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 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-14 07:06:08,366 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/locks/test_locks_15-1.c -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 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 07:06:10,053 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 07:06:10,056 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 07:06:10,088 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 07:06:10,089 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 07:06:10,090 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 07:06:10,093 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 07:06:10,095 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 07:06:10,097 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 07:06:10,100 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 07:06:10,101 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 07:06:10,105 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 07:06:10,105 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 07:06:10,107 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 07:06:10,107 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 07:06:10,110 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 07:06:10,110 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 07:06:10,112 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 07:06:10,113 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 07:06:10,117 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 07:06:10,118 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 07:06:10,119 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 07:06:10,120 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 07:06:10,121 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 07:06:10,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 07:06:10,127 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 07:06:10,128 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 07:06:10,128 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 07:06:10,129 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 07:06:10,129 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 07:06:10,129 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 07:06:10,130 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 07:06:10,131 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 07:06:10,131 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 07:06:10,133 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 07:06:10,133 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 07:06:10,133 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 07:06:10,134 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 07:06:10,134 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 07:06:10,134 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 07:06:10,135 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 07:06:10,136 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 07:06:10,142 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-14 07:06:10,179 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 07:06:10,180 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 07:06:10,180 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 07:06:10,180 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 07:06:10,181 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 07:06:10,181 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 07:06:10,181 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 07:06:10,182 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 07:06:10,182 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 07:06:10,182 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 07:06:10,183 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 07:06:10,183 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 07:06:10,183 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 07:06:10,183 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 07:06:10,183 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 07:06:10,183 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 07:06:10,184 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 07:06:10,184 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 07:06:10,184 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 07:06:10,184 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 07:06:10,184 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-14 07:06:10,184 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-14 07:06:10,184 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 07:06:10,185 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 07:06:10,185 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 07:06:10,185 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 07:06:10,185 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 07:06:10,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 07:06:10,185 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 07:06:10,185 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 07:06:10,186 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-14 07:06:10,186 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-14 07:06:10,186 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-14 07:06:10,186 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 -> 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 [2022-07-14 07:06:10,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 07:06:10,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 07:06:10,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 07:06:10,480 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 07:06:10,481 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 07:06:10,482 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_15-1.c [2022-07-14 07:06:10,532 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7fa98853/8081f75d7bca46c19bf8c471605d37c5/FLAGab99131d4 [2022-07-14 07:06:10,885 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 07:06:10,886 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-1.c [2022-07-14 07:06:10,893 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7fa98853/8081f75d7bca46c19bf8c471605d37c5/FLAGab99131d4 [2022-07-14 07:06:11,304 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7fa98853/8081f75d7bca46c19bf8c471605d37c5 [2022-07-14 07:06:11,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 07:06:11,307 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 07:06:11,308 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 07:06:11,309 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 07:06:11,311 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 07:06:11,311 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 07:06:11" (1/1) ... [2022-07-14 07:06:11,312 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1804dc7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:11, skipping insertion in model container [2022-07-14 07:06:11,318 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 07:06:11" (1/1) ... [2022-07-14 07:06:11,323 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 07:06:11,347 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 07:06:11,516 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-1.c[5654,5667] [2022-07-14 07:06:11,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 07:06:11,537 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 07:06:11,589 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-1.c[5654,5667] [2022-07-14 07:06:11,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 07:06:11,604 INFO L208 MainTranslator]: Completed translation [2022-07-14 07:06:11,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:11 WrapperNode [2022-07-14 07:06:11,620 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 07:06:11,621 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 07:06:11,621 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 07:06:11,621 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 07:06:11,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:11" (1/1) ... [2022-07-14 07:06:11,649 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:11" (1/1) ... [2022-07-14 07:06:11,678 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 179 [2022-07-14 07:06:11,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 07:06:11,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 07:06:11,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 07:06:11,680 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 07:06:11,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:11" (1/1) ... [2022-07-14 07:06:11,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:11" (1/1) ... [2022-07-14 07:06:11,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:11" (1/1) ... [2022-07-14 07:06:11,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:11" (1/1) ... [2022-07-14 07:06:11,705 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:11" (1/1) ... [2022-07-14 07:06:11,711 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:11" (1/1) ... [2022-07-14 07:06:11,714 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:11" (1/1) ... [2022-07-14 07:06:11,719 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 07:06:11,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 07:06:11,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 07:06:11,721 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 07:06:11,722 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:11" (1/1) ... [2022-07-14 07:06:11,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 07:06:11,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:06:11,773 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-14 07:06:11,811 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-14 07:06:11,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 07:06:11,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 07:06:11,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 07:06:11,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-14 07:06:11,887 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 07:06:11,888 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 07:06:12,033 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 07:06:12,038 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 07:06:12,038 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-14 07:06:12,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 07:06:12 BoogieIcfgContainer [2022-07-14 07:06:12,040 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 07:06:12,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 07:06:12,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 07:06:12,043 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 07:06:12,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 07:06:11" (1/3) ... [2022-07-14 07:06:12,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b441c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 07:06:12, skipping insertion in model container [2022-07-14 07:06:12,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:11" (2/3) ... [2022-07-14 07:06:12,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b441c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 07:06:12, skipping insertion in model container [2022-07-14 07:06:12,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 07:06:12" (3/3) ... [2022-07-14 07:06:12,045 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_15-1.c [2022-07-14 07:06:12,054 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 07:06:12,054 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-14 07:06:12,102 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 07:06:12,119 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@25ceab43, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6d487176 [2022-07-14 07:06:12,120 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-14 07:06:12,124 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 55 states have internal predecessors, (103), 0 states have call successors, (0), 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-14 07:06:12,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 07:06:12,129 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:12,130 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 07:06:12,130 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:06:12,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:12,134 INFO L85 PathProgramCache]: Analyzing trace with hash 28959891, now seen corresponding path program 1 times [2022-07-14 07:06:12,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:06:12,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925278184] [2022-07-14 07:06:12,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:12,142 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:06:12,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:06:12,144 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-14 07:06:12,145 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-14 07:06:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:12,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-14 07:06:12,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:12,235 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-14 07:06:12,242 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:06:12,243 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:06:12,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [925278184] [2022-07-14 07:06:12,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [925278184] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:12,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:12,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 07:06:12,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992144977] [2022-07-14 07:06:12,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:12,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-14 07:06:12,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:06:12,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 07:06:12,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 07:06:12,270 INFO L87 Difference]: Start difference. First operand has 56 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 55 states have internal predecessors, (103), 0 states have call successors, (0), 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-14 07:06:12,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:12,281 INFO L93 Difference]: Finished difference Result 56 states and 100 transitions. [2022-07-14 07:06:12,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 07:06:12,283 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-14 07:06:12,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:12,288 INFO L225 Difference]: With dead ends: 56 [2022-07-14 07:06:12,288 INFO L226 Difference]: Without dead ends: 54 [2022-07-14 07:06:12,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 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-14 07:06:12,293 INFO L413 NwaCegarLoop]: 100 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, 100 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-14 07:06:12,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:06:12,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-14 07:06:12,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-07-14 07:06:12,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.8846153846153846) internal successors, (98), 53 states have internal predecessors, (98), 0 states have call successors, (0), 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-14 07:06:12,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 98 transitions. [2022-07-14 07:06:12,319 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 98 transitions. Word has length 5 [2022-07-14 07:06:12,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:12,319 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 98 transitions. [2022-07-14 07:06:12,320 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-14 07:06:12,320 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 98 transitions. [2022-07-14 07:06:12,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 07:06:12,320 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:12,320 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 07:06:12,329 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-14 07:06:12,520 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-14 07:06:12,521 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:06:12,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:12,523 INFO L85 PathProgramCache]: Analyzing trace with hash 889700683, now seen corresponding path program 1 times [2022-07-14 07:06:12,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:06:12,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42148430] [2022-07-14 07:06:12,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:12,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:06:12,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:06:12,525 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-14 07:06:12,526 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-14 07:06:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:12,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 07:06:12,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:12,629 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-14 07:06:12,630 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:06:12,630 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:06:12,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42148430] [2022-07-14 07:06:12,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [42148430] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:12,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:12,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 07:06:12,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694765882] [2022-07-14 07:06:12,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:12,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:06:12,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:06:12,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:06:12,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:06:12,634 INFO L87 Difference]: Start difference. First operand 54 states and 98 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-14 07:06:12,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:12,649 INFO L93 Difference]: Finished difference Result 53 states and 97 transitions. [2022-07-14 07:06:12,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:06:12,652 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-14 07:06:12,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:12,655 INFO L225 Difference]: With dead ends: 53 [2022-07-14 07:06:12,655 INFO L226 Difference]: Without dead ends: 51 [2022-07-14 07:06:12,655 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-14 07:06:12,656 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:06:12,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 97 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:06:12,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-14 07:06:12,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-07-14 07:06:12,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 0 states have call successors, (0), 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-14 07:06:12,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 95 transitions. [2022-07-14 07:06:12,661 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 95 transitions. Word has length 6 [2022-07-14 07:06:12,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:12,661 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 95 transitions. [2022-07-14 07:06:12,661 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-14 07:06:12,661 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 95 transitions. [2022-07-14 07:06:12,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 07:06:12,662 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:12,662 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:06:12,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-14 07:06:12,871 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-14 07:06:12,872 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:06:12,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:12,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1188553263, now seen corresponding path program 1 times [2022-07-14 07:06:12,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:06:12,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [526847200] [2022-07-14 07:06:12,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:12,875 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:06:12,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:06:12,889 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-14 07:06:12,890 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-14 07:06:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:12,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 07:06:12,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:12,982 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-14 07:06:12,982 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:06:12,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:06:12,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [526847200] [2022-07-14 07:06:12,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [526847200] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:12,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:12,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 07:06:12,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709190635] [2022-07-14 07:06:12,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:12,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:06:12,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:06:12,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:06:12,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:06:12,986 INFO L87 Difference]: Start difference. First operand 51 states and 95 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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-14 07:06:13,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:13,012 INFO L93 Difference]: Finished difference Result 99 states and 184 transitions. [2022-07-14 07:06:13,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:06:13,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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-14 07:06:13,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:13,014 INFO L225 Difference]: With dead ends: 99 [2022-07-14 07:06:13,015 INFO L226 Difference]: Without dead ends: 99 [2022-07-14 07:06:13,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-14 07:06:13,018 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 76 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:06:13,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 240 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:06:13,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-14 07:06:13,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2022-07-14 07:06:13,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.90625) internal successors, (183), 96 states have internal predecessors, (183), 0 states have call successors, (0), 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-14 07:06:13,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 183 transitions. [2022-07-14 07:06:13,034 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 183 transitions. Word has length 22 [2022-07-14 07:06:13,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:13,034 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 183 transitions. [2022-07-14 07:06:13,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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-14 07:06:13,035 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 183 transitions. [2022-07-14 07:06:13,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 07:06:13,036 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:13,037 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:06:13,055 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-14 07:06:13,243 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-14 07:06:13,243 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:06:13,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:13,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1188560455, now seen corresponding path program 1 times [2022-07-14 07:06:13,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:06:13,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234147960] [2022-07-14 07:06:13,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:13,251 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:06:13,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:06:13,252 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-14 07:06:13,254 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-14 07:06:13,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:13,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 07:06:13,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:13,313 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-14 07:06:13,314 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:06:13,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:06:13,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234147960] [2022-07-14 07:06:13,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [234147960] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:13,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:13,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 07:06:13,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599701840] [2022-07-14 07:06:13,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:13,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:06:13,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:06:13,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:06:13,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:06:13,316 INFO L87 Difference]: Start difference. First operand 97 states and 183 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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-14 07:06:13,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:13,326 INFO L93 Difference]: Finished difference Result 98 states and 184 transitions. [2022-07-14 07:06:13,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:06:13,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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-14 07:06:13,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:13,327 INFO L225 Difference]: With dead ends: 98 [2022-07-14 07:06:13,327 INFO L226 Difference]: Without dead ends: 98 [2022-07-14 07:06:13,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-14 07:06:13,328 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 14 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:06:13,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 184 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:06:13,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-14 07:06:13,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-07-14 07:06:13,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.8969072164948453) internal successors, (184), 97 states have internal predecessors, (184), 0 states have call successors, (0), 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-14 07:06:13,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 184 transitions. [2022-07-14 07:06:13,336 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 184 transitions. Word has length 22 [2022-07-14 07:06:13,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:13,336 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 184 transitions. [2022-07-14 07:06:13,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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-14 07:06:13,336 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 184 transitions. [2022-07-14 07:06:13,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 07:06:13,337 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:13,337 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:06:13,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-14 07:06:13,542 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-14 07:06:13,543 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:06:13,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:13,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1112269327, now seen corresponding path program 1 times [2022-07-14 07:06:13,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:06:13,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [802958228] [2022-07-14 07:06:13,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:13,544 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:06:13,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:06:13,546 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-14 07:06:13,547 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-14 07:06:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:13,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 07:06:13,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:13,645 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-14 07:06:13,646 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:06:13,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:06:13,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [802958228] [2022-07-14 07:06:13,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [802958228] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:13,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:13,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 07:06:13,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224437833] [2022-07-14 07:06:13,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:13,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:06:13,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:06:13,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:06:13,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:06:13,652 INFO L87 Difference]: Start difference. First operand 98 states and 184 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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-14 07:06:13,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:13,668 INFO L93 Difference]: Finished difference Result 137 states and 251 transitions. [2022-07-14 07:06:13,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:06:13,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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-14 07:06:13,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:13,670 INFO L225 Difference]: With dead ends: 137 [2022-07-14 07:06:13,670 INFO L226 Difference]: Without dead ends: 137 [2022-07-14 07:06:13,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-14 07:06:13,671 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 76 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:06:13,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 134 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:06:13,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-07-14 07:06:13,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-07-14 07:06:13,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.8656716417910448) internal successors, (250), 134 states have internal predecessors, (250), 0 states have call successors, (0), 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-14 07:06:13,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 250 transitions. [2022-07-14 07:06:13,685 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 250 transitions. Word has length 22 [2022-07-14 07:06:13,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:13,685 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 250 transitions. [2022-07-14 07:06:13,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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-14 07:06:13,685 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 250 transitions. [2022-07-14 07:06:13,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 07:06:13,692 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:13,692 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:06:13,702 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-14 07:06:13,902 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-14 07:06:13,903 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:06:13,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:13,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1112262135, now seen corresponding path program 1 times [2022-07-14 07:06:13,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:06:13,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1724760410] [2022-07-14 07:06:13,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:13,904 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:06:13,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:06:13,905 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-14 07:06:13,916 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-14 07:06:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:06:13,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 07:06:13,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:06:13,967 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-14 07:06:13,967 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:06:13,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:06:13,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1724760410] [2022-07-14 07:06:13,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1724760410] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:06:13,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:06:13,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 07:06:13,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922140134] [2022-07-14 07:06:13,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:06:13,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:06:13,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:06:13,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:06:13,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:06:13,969 INFO L87 Difference]: Start difference. First operand 135 states and 250 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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-14 07:06:13,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:06:13,984 INFO L93 Difference]: Finished difference Result 135 states and 244 transitions. [2022-07-14 07:06:13,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:06:13,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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-14 07:06:13,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:06:13,996 INFO L225 Difference]: With dead ends: 135 [2022-07-14 07:06:13,996 INFO L226 Difference]: Without dead ends: 135 [2022-07-14 07:06:13,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-14 07:06:13,997 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 74 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:06:13,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 212 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:06:13,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-14 07:06:14,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2022-07-14 07:06:14,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.8409090909090908) internal successors, (243), 132 states have internal predecessors, (243), 0 states have call successors, (0), 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-14 07:06:14,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 243 transitions. [2022-07-14 07:06:14,003 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 243 transitions. Word has length 22 [2022-07-14 07:06:14,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:06:14,003 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 243 transitions. [2022-07-14 07:06:14,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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-14 07:06:14,003 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 243 transitions. [2022-07-14 07:06:14,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 07:06:14,004 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:06:14,004 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:06:14,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-14 07:06:14,210 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-14 07:06:14,210 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-07-14 07:06:14,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:06:14,211 INFO L85 PathProgramCache]: Analyzing trace with hash -476078575, now seen corresponding path program 1 times [2022-07-14 07:06:14,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:06:14,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [681162939] [2022-07-14 07:06:14,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:06:14,211 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:06:14,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:06:14,212 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-14 07:06:14,214 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-14 07:06:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 07:06:14,243 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 07:06:14,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 07:06:14,282 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-14 07:06:14,282 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-14 07:06:14,283 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-07-14 07:06:14,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-07-14 07:06:14,303 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-14 07:06:14,503 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-14 07:06:14,506 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:06:14,508 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-14 07:06:14,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.07 07:06:14 BoogieIcfgContainer [2022-07-14 07:06:14,548 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-14 07:06:14,548 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 07:06:14,548 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 07:06:14,549 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 07:06:14,549 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 07:06:12" (3/4) ... [2022-07-14 07:06:14,551 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-14 07:06:14,551 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 07:06:14,551 INFO L158 Benchmark]: Toolchain (without parser) took 3244.73ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 47.9MB in the beginning and 61.3MB in the end (delta: -13.4MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. [2022-07-14 07:06:14,552 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 67.1MB. Free memory was 48.5MB in the beginning and 48.5MB in the end (delta: 49.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 07:06:14,552 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.59ms. Allocated memory is still 67.1MB. Free memory was 47.8MB in the beginning and 49.2MB in the end (delta: -1.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 07:06:14,552 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.16ms. Allocated memory is still 67.1MB. Free memory was 49.2MB in the beginning and 47.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 07:06:14,552 INFO L158 Benchmark]: Boogie Preprocessor took 40.60ms. Allocated memory is still 67.1MB. Free memory was 47.4MB in the beginning and 45.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 07:06:14,552 INFO L158 Benchmark]: RCFGBuilder took 319.48ms. Allocated memory is still 67.1MB. Free memory was 45.8MB in the beginning and 32.7MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-14 07:06:14,553 INFO L158 Benchmark]: TraceAbstraction took 2506.74ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 32.2MB in the beginning and 61.3MB in the end (delta: -29.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 07:06:14,553 INFO L158 Benchmark]: Witness Printer took 2.57ms. Allocated memory is still 88.1MB. Free memory is still 61.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 07:06:14,554 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.17ms. Allocated memory is still 67.1MB. Free memory was 48.5MB in the beginning and 48.5MB in the end (delta: 49.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 311.59ms. Allocated memory is still 67.1MB. Free memory was 47.8MB in the beginning and 49.2MB in the end (delta: -1.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.16ms. Allocated memory is still 67.1MB. Free memory was 49.2MB in the beginning and 47.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.60ms. Allocated memory is still 67.1MB. Free memory was 47.4MB in the beginning and 45.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 319.48ms. Allocated memory is still 67.1MB. Free memory was 45.8MB in the beginning and 32.7MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2506.74ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 32.2MB in the beginning and 61.3MB in the end (delta: -29.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.57ms. Allocated memory is still 88.1MB. Free memory is still 61.3MB. There was no memory consumed. Max. memory is 16.1GB. * 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: 233]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 233. Possible FailurePath: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L50] int p15 = __VERIFIER_nondet_int(); [L51] int lk15; [L54] int cond; [L56] COND TRUE 1 [L57] cond = __VERIFIER_nondet_int() [L58] COND FALSE !(cond == 0) [L61] lk1 = 0 [L63] lk2 = 0 [L65] lk3 = 0 [L67] lk4 = 0 [L69] lk5 = 0 [L71] lk6 = 0 [L73] lk7 = 0 [L75] lk8 = 0 [L77] lk9 = 0 [L79] lk10 = 0 [L81] lk11 = 0 [L83] lk12 = 0 [L85] lk13 = 0 [L87] lk14 = 0 [L89] lk15 = 0 VAL [cond=2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0] [L93] COND FALSE !(p1 != 0) VAL [cond=2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0] [L97] COND FALSE !(p2 != 0) VAL [cond=2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0] [L101] COND FALSE !(p3 != 0) VAL [cond=2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=0] [L105] COND TRUE p4 != 0 [L106] lk4 = 1 VAL [cond=2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=0, p4=2] [L109] COND TRUE p5 != 0 [L110] lk5 = 1 VAL [cond=2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=0, p4=2, p5=2] [L113] COND TRUE p6 != 0 [L114] lk6 = 1 VAL [cond=2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2] [L117] COND TRUE p7 != 0 [L118] lk7 = 1 VAL [cond=2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=0, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2] [L121] COND TRUE p8 != 0 [L122] lk8 = 1 VAL [cond=2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2] [L125] COND TRUE p9 != 0 [L126] lk9 = 1 VAL [cond=2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L129] COND TRUE p10 != 0 [L130] lk10 = 1 VAL [cond=2147483648, lk1=0, lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L133] COND FALSE !(p11 != 0) VAL [cond=2147483648, lk1=0, lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L137] COND TRUE p12 != 0 [L138] lk12 = 1 VAL [cond=2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p12=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L141] COND TRUE p13 != 0 [L142] lk13 = 1 VAL [cond=2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p12=2, p13=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L145] COND TRUE p14 != 0 [L146] lk14 = 1 VAL [cond=2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p12=2, p13=2, p14=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L149] COND TRUE p15 != 0 [L150] lk15 = 1 VAL [cond=2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p12=2, p13=2, p14=2, p15=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L155] COND FALSE !(p1 != 0) VAL [cond=2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p12=2, p13=2, p14=2, p15=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L160] COND FALSE !(p2 != 0) VAL [cond=2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p12=2, p13=2, p14=2, p15=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L233] reach_error() VAL [cond=2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p12=2, p13=2, p14=2, p15=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] - UnprovableResult [Line: 6]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 56 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 332 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 332 mSDsluCounter, 967 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 303 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21 IncrementalHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 664 mSDtfsCounter, 21 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=5, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 253 SizeOfPredicates, 0 NumberOfNonLiveVariables, 287 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 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-14 07:06:14,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample