./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_14-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7e1ff0e6 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_14-2.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 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c --- Real Ultimate output --- This is Ultimate 0.2.2-?-7e1ff0e [2023-02-15 01:43:14,598 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 01:43:14,600 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 01:43:14,622 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 01:43:14,623 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 01:43:14,624 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 01:43:14,625 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 01:43:14,626 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 01:43:14,627 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 01:43:14,628 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 01:43:14,629 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 01:43:14,630 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 01:43:14,630 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 01:43:14,631 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 01:43:14,632 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 01:43:14,633 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 01:43:14,633 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 01:43:14,634 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 01:43:14,635 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 01:43:14,637 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 01:43:14,638 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 01:43:14,639 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 01:43:14,640 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 01:43:14,641 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 01:43:14,644 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 01:43:14,644 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 01:43:14,644 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 01:43:14,645 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 01:43:14,645 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 01:43:14,646 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 01:43:14,647 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 01:43:14,647 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 01:43:14,648 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 01:43:14,648 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 01:43:14,649 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 01:43:14,650 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 01:43:14,650 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 01:43:14,650 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 01:43:14,651 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 01:43:14,651 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 01:43:14,652 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 01:43:14,654 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 01:43:14,679 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 01:43:14,680 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 01:43:14,680 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 01:43:14,680 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 01:43:14,681 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 01:43:14,681 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 01:43:14,682 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 01:43:14,682 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 01:43:14,682 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 01:43:14,682 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 01:43:14,682 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 01:43:14,683 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 01:43:14,683 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 01:43:14,683 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 01:43:14,683 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 01:43:14,683 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 01:43:14,683 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 01:43:14,684 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 01:43:14,684 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 01:43:14,684 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 01:43:14,684 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 01:43:14,684 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 01:43:14,685 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 01:43:14,685 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 01:43:14,685 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 01:43:14,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:43:14,686 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 01:43:14,686 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 01:43:14,686 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 01:43:14,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 01:43:14,686 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 01:43:14,686 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 01:43:14,687 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 01:43:14,687 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 01:43:14,687 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c [2023-02-15 01:43:14,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 01:43:14,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 01:43:14,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 01:43:14,893 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 01:43:14,894 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 01:43:14,895 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_14-2.c [2023-02-15 01:43:16,007 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 01:43:16,186 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 01:43:16,187 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-2.c [2023-02-15 01:43:16,194 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c36aed0f5/fe6a6ac84d9b44aab8e53fa08e5230ef/FLAG1d398fbcb [2023-02-15 01:43:16,211 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c36aed0f5/fe6a6ac84d9b44aab8e53fa08e5230ef [2023-02-15 01:43:16,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 01:43:16,215 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 01:43:16,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 01:43:16,218 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 01:43:16,221 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 01:43:16,221 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:43:16" (1/1) ... [2023-02-15 01:43:16,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f53aba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:16, skipping insertion in model container [2023-02-15 01:43:16,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:43:16" (1/1) ... [2023-02-15 01:43:16,230 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 01:43:16,261 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 01:43:16,395 WARN L237 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_14-2.c[5305,5318] [2023-02-15 01:43:16,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:43:16,411 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 01:43:16,435 WARN L237 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_14-2.c[5305,5318] [2023-02-15 01:43:16,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:43:16,449 INFO L208 MainTranslator]: Completed translation [2023-02-15 01:43:16,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:16 WrapperNode [2023-02-15 01:43:16,450 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 01:43:16,450 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 01:43:16,451 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 01:43:16,451 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 01:43:16,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:16" (1/1) ... [2023-02-15 01:43:16,474 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:16" (1/1) ... [2023-02-15 01:43:16,494 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 184 [2023-02-15 01:43:16,494 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 01:43:16,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 01:43:16,495 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 01:43:16,495 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 01:43:16,502 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:16" (1/1) ... [2023-02-15 01:43:16,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:16" (1/1) ... [2023-02-15 01:43:16,504 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:16" (1/1) ... [2023-02-15 01:43:16,505 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:16" (1/1) ... [2023-02-15 01:43:16,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:16" (1/1) ... [2023-02-15 01:43:16,512 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:16" (1/1) ... [2023-02-15 01:43:16,513 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:16" (1/1) ... [2023-02-15 01:43:16,514 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:16" (1/1) ... [2023-02-15 01:43:16,516 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 01:43:16,528 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 01:43:16,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 01:43:16,529 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 01:43:16,530 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:16" (1/1) ... [2023-02-15 01:43:16,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:43:16,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:43:16,552 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) [2023-02-15 01:43:16,558 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 [2023-02-15 01:43:16,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 01:43:16,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 01:43:16,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 01:43:16,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 01:43:16,637 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 01:43:16,638 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 01:43:16,921 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 01:43:16,927 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 01:43:16,927 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-15 01:43:16,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:43:16 BoogieIcfgContainer [2023-02-15 01:43:16,929 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 01:43:16,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 01:43:16,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 01:43:16,933 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 01:43:16,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:43:16" (1/3) ... [2023-02-15 01:43:16,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da8703f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:43:16, skipping insertion in model container [2023-02-15 01:43:16,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:16" (2/3) ... [2023-02-15 01:43:16,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da8703f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:43:16, skipping insertion in model container [2023-02-15 01:43:16,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:43:16" (3/3) ... [2023-02-15 01:43:16,936 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_14-2.c [2023-02-15 01:43:16,951 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 01:43:16,952 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-02-15 01:43:17,000 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 01:43:17,007 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=PETRI_NET, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@60badccf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 01:43:17,008 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-02-15 01:43:17,012 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 50 states have (on average 1.94) internal successors, (97), 52 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:17,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-15 01:43:17,017 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:43:17,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 01:43:17,018 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-15 01:43:17,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:43:17,021 INFO L85 PathProgramCache]: Analyzing trace with hash 28943010, now seen corresponding path program 1 times [2023-02-15 01:43:17,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:43:17,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062710841] [2023-02-15 01:43:17,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:43:17,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:43:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:43:17,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:43:17,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:43:17,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062710841] [2023-02-15 01:43:17,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062710841] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:43:17,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:43:17,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:43:17,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137823656] [2023-02-15 01:43:17,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:43:17,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 01:43:17,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:43:17,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 01:43:17,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 01:43:17,187 INFO L87 Difference]: Start difference. First operand has 53 states, 50 states have (on average 1.94) internal successors, (97), 52 states have internal predecessors, (97), 0 states have call successors, (0), 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) [2023-02-15 01:43:17,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:43:17,203 INFO L93 Difference]: Finished difference Result 53 states and 94 transitions. [2023-02-15 01:43:17,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 01:43:17,205 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 [2023-02-15 01:43:17,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:43:17,213 INFO L225 Difference]: With dead ends: 53 [2023-02-15 01:43:17,213 INFO L226 Difference]: Without dead ends: 51 [2023-02-15 01:43:17,214 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 [2023-02-15 01:43:17,217 INFO L413 NwaCegarLoop]: 94 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, 94 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 [2023-02-15 01:43:17,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:43:17,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-15 01:43:17,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-02-15 01:43:17,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 92 transitions. [2023-02-15 01:43:17,243 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 92 transitions. Word has length 5 [2023-02-15 01:43:17,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:43:17,243 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 92 transitions. [2023-02-15 01:43:17,243 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) [2023-02-15 01:43:17,243 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 92 transitions. [2023-02-15 01:43:17,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 01:43:17,244 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:43:17,244 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 01:43:17,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 01:43:17,245 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-15 01:43:17,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:43:17,246 INFO L85 PathProgramCache]: Analyzing trace with hash 889700139, now seen corresponding path program 1 times [2023-02-15 01:43:17,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:43:17,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242102175] [2023-02-15 01:43:17,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:43:17,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:43:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:43:17,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:43:17,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:43:17,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242102175] [2023-02-15 01:43:17,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242102175] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:43:17,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:43:17,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:43:17,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506085321] [2023-02-15 01:43:17,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:43:17,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:43:17,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:43:17,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:43:17,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:43:17,349 INFO L87 Difference]: Start difference. First operand 51 states and 92 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) [2023-02-15 01:43:17,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:43:17,378 INFO L93 Difference]: Finished difference Result 50 states and 91 transitions. [2023-02-15 01:43:17,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:43:17,379 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 [2023-02-15 01:43:17,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:43:17,380 INFO L225 Difference]: With dead ends: 50 [2023-02-15 01:43:17,380 INFO L226 Difference]: Without dead ends: 48 [2023-02-15 01:43:17,381 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 [2023-02-15 01:43:17,382 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 86 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 91 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 [2023-02-15 01:43:17,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 91 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:43:17,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-02-15 01:43:17,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-02-15 01:43:17,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:17,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 89 transitions. [2023-02-15 01:43:17,393 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 89 transitions. Word has length 6 [2023-02-15 01:43:17,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:43:17,393 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 89 transitions. [2023-02-15 01:43:17,393 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) [2023-02-15 01:43:17,393 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 89 transitions. [2023-02-15 01:43:17,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 01:43:17,394 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:43:17,394 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] [2023-02-15 01:43:17,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 01:43:17,395 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-15 01:43:17,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:43:17,395 INFO L85 PathProgramCache]: Analyzing trace with hash 792943379, now seen corresponding path program 1 times [2023-02-15 01:43:17,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:43:17,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753548657] [2023-02-15 01:43:17,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:43:17,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:43:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:43:17,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:43:17,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:43:17,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753548657] [2023-02-15 01:43:17,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753548657] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:43:17,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:43:17,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:43:17,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257342497] [2023-02-15 01:43:17,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:43:17,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:43:17,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:43:17,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:43:17,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:43:17,493 INFO L87 Difference]: Start difference. First operand 48 states and 89 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:17,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:43:17,528 INFO L93 Difference]: Finished difference Result 93 states and 173 transitions. [2023-02-15 01:43:17,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:43:17,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-15 01:43:17,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:43:17,541 INFO L225 Difference]: With dead ends: 93 [2023-02-15 01:43:17,541 INFO L226 Difference]: Without dead ends: 93 [2023-02-15 01:43:17,541 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 [2023-02-15 01:43:17,543 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 68 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:43:17,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 174 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:43:17,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-15 01:43:17,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 63. [2023-02-15 01:43:17,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.903225806451613) internal successors, (118), 62 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:17,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 118 transitions. [2023-02-15 01:43:17,555 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 118 transitions. Word has length 21 [2023-02-15 01:43:17,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:43:17,555 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 118 transitions. [2023-02-15 01:43:17,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:17,555 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 118 transitions. [2023-02-15 01:43:17,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 01:43:17,556 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:43:17,556 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] [2023-02-15 01:43:17,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 01:43:17,556 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-15 01:43:17,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:43:17,557 INFO L85 PathProgramCache]: Analyzing trace with hash 792950571, now seen corresponding path program 1 times [2023-02-15 01:43:17,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:43:17,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451101353] [2023-02-15 01:43:17,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:43:17,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:43:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:43:17,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:43:17,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:43:17,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451101353] [2023-02-15 01:43:17,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451101353] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:43:17,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:43:17,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:43:17,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480854033] [2023-02-15 01:43:17,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:43:17,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:43:17,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:43:17,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:43:17,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:43:17,650 INFO L87 Difference]: Start difference. First operand 63 states and 118 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:17,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:43:17,683 INFO L93 Difference]: Finished difference Result 94 states and 173 transitions. [2023-02-15 01:43:17,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:43:17,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-15 01:43:17,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:43:17,684 INFO L225 Difference]: With dead ends: 94 [2023-02-15 01:43:17,684 INFO L226 Difference]: Without dead ends: 94 [2023-02-15 01:43:17,685 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 [2023-02-15 01:43:17,686 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 71 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 224 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 [2023-02-15 01:43:17,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 224 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:43:17,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-02-15 01:43:17,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2023-02-15 01:43:17,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.89010989010989) internal successors, (172), 91 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:17,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 172 transitions. [2023-02-15 01:43:17,703 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 172 transitions. Word has length 21 [2023-02-15 01:43:17,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:43:17,703 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 172 transitions. [2023-02-15 01:43:17,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:17,704 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 172 transitions. [2023-02-15 01:43:17,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 01:43:17,704 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:43:17,705 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] [2023-02-15 01:43:17,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 01:43:17,705 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-15 01:43:17,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:43:17,706 INFO L85 PathProgramCache]: Analyzing trace with hash -795404523, now seen corresponding path program 1 times [2023-02-15 01:43:17,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:43:17,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968019866] [2023-02-15 01:43:17,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:43:17,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:43:17,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:43:17,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:43:17,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:43:17,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968019866] [2023-02-15 01:43:17,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968019866] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:43:17,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:43:17,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:43:17,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107956103] [2023-02-15 01:43:17,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:43:17,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:43:17,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:43:17,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:43:17,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:43:17,756 INFO L87 Difference]: Start difference. First operand 92 states and 172 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:17,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:43:17,770 INFO L93 Difference]: Finished difference Result 96 states and 173 transitions. [2023-02-15 01:43:17,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:43:17,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-15 01:43:17,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:43:17,772 INFO L225 Difference]: With dead ends: 96 [2023-02-15 01:43:17,772 INFO L226 Difference]: Without dead ends: 96 [2023-02-15 01:43:17,772 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 [2023-02-15 01:43:17,773 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 69 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 198 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 [2023-02-15 01:43:17,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 198 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:43:17,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-15 01:43:17,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2023-02-15 01:43:17,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 93 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:17,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 172 transitions. [2023-02-15 01:43:17,780 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 172 transitions. Word has length 21 [2023-02-15 01:43:17,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:43:17,782 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 172 transitions. [2023-02-15 01:43:17,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:17,783 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 172 transitions. [2023-02-15 01:43:17,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 01:43:17,783 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:43:17,784 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] [2023-02-15 01:43:17,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 01:43:17,784 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-15 01:43:17,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:43:17,785 INFO L85 PathProgramCache]: Analyzing trace with hash -795397331, now seen corresponding path program 1 times [2023-02-15 01:43:17,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:43:17,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898723273] [2023-02-15 01:43:17,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:43:17,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:43:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:43:17,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:43:17,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:43:17,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898723273] [2023-02-15 01:43:17,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898723273] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:43:17,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:43:17,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:43:17,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082211235] [2023-02-15 01:43:17,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:43:17,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:43:17,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:43:17,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:43:17,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:43:17,863 INFO L87 Difference]: Start difference. First operand 94 states and 172 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:17,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:43:17,880 INFO L93 Difference]: Finished difference Result 127 states and 228 transitions. [2023-02-15 01:43:17,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:43:17,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-15 01:43:17,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:43:17,882 INFO L225 Difference]: With dead ends: 127 [2023-02-15 01:43:17,882 INFO L226 Difference]: Without dead ends: 127 [2023-02-15 01:43:17,882 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 [2023-02-15 01:43:17,883 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 70 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 125 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 [2023-02-15 01:43:17,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 125 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:43:17,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-15 01:43:17,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2023-02-15 01:43:17,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.8306451612903225) internal successors, (227), 124 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:17,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 227 transitions. [2023-02-15 01:43:17,892 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 227 transitions. Word has length 21 [2023-02-15 01:43:17,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:43:17,892 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 227 transitions. [2023-02-15 01:43:17,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:17,893 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 227 transitions. [2023-02-15 01:43:17,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 01:43:17,893 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:43:17,894 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] [2023-02-15 01:43:17,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 01:43:17,894 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-15 01:43:17,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:43:17,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1816465685, now seen corresponding path program 1 times [2023-02-15 01:43:17,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:43:17,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644449025] [2023-02-15 01:43:17,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:43:17,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:43:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 01:43:17,906 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 01:43:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 01:43:17,941 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 01:43:17,941 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 01:43:17,942 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2023-02-15 01:43:17,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2023-02-15 01:43:17,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 01:43:17,946 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:43:17,948 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 01:43:18,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 01:43:18 BoogieIcfgContainer [2023-02-15 01:43:18,006 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 01:43:18,006 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 01:43:18,007 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 01:43:18,007 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 01:43:18,007 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:43:16" (3/4) ... [2023-02-15 01:43:18,010 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 01:43:18,010 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 01:43:18,010 INFO L158 Benchmark]: Toolchain (without parser) took 1795.26ms. Allocated memory was 111.1MB in the beginning and 136.3MB in the end (delta: 25.2MB). Free memory was 63.8MB in the beginning and 81.4MB in the end (delta: -17.6MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2023-02-15 01:43:18,011 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 111.1MB. Free memory is still 80.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 01:43:18,011 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.78ms. Allocated memory is still 111.1MB. Free memory was 63.5MB in the beginning and 52.2MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-15 01:43:18,013 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.01ms. Allocated memory is still 111.1MB. Free memory was 52.2MB in the beginning and 50.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 01:43:18,014 INFO L158 Benchmark]: Boogie Preprocessor took 21.18ms. Allocated memory is still 111.1MB. Free memory was 50.2MB in the beginning and 48.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 01:43:18,014 INFO L158 Benchmark]: RCFGBuilder took 400.63ms. Allocated memory was 111.1MB in the beginning and 136.3MB in the end (delta: 25.2MB). Free memory was 48.6MB in the beginning and 101.9MB in the end (delta: -53.3MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2023-02-15 01:43:18,017 INFO L158 Benchmark]: TraceAbstraction took 1075.10ms. Allocated memory is still 136.3MB. Free memory was 101.3MB in the beginning and 81.4MB in the end (delta: 19.9MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2023-02-15 01:43:18,018 INFO L158 Benchmark]: Witness Printer took 3.56ms. Allocated memory is still 136.3MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 01:43:18,019 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.18ms. Allocated memory is still 111.1MB. Free memory is still 80.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 231.78ms. Allocated memory is still 111.1MB. Free memory was 63.5MB in the beginning and 52.2MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.01ms. Allocated memory is still 111.1MB. Free memory was 52.2MB in the beginning and 50.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.18ms. Allocated memory is still 111.1MB. Free memory was 50.2MB in the beginning and 48.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 400.63ms. Allocated memory was 111.1MB in the beginning and 136.3MB in the end (delta: 25.2MB). Free memory was 48.6MB in the beginning and 101.9MB in the end (delta: -53.3MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1075.10ms. Allocated memory is still 136.3MB. Free memory was 101.3MB in the beginning and 81.4MB in the end (delta: 19.9MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * Witness Printer took 3.56ms. Allocated memory is still 136.3MB. Free memory is still 81.4MB. 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: 219]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 219. 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; [L51] int cond; VAL [p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L53] COND TRUE 1 [L54] cond = __VERIFIER_nondet_int() [L55] COND FALSE !(cond == 0) [L58] lk1 = 0 [L60] lk2 = 0 [L62] lk3 = 0 [L64] lk4 = 0 [L66] lk5 = 0 [L68] lk6 = 0 [L70] lk7 = 0 [L72] lk8 = 0 [L74] lk9 = 0 [L76] lk10 = 0 [L78] lk11 = 0 [L80] lk12 = 0 [L82] lk13 = 0 [L84] lk14 = 0 VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L88] COND FALSE !(p1 != 0) VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L92] COND FALSE !(p2 != 0) VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L96] COND FALSE !(p3 != 0) VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L100] COND TRUE p4 != 0 [L101] lk4 = 1 VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L104] COND TRUE p5 != 0 [L105] lk5 = 1 VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L108] COND TRUE p6 != 0 [L109] lk6 = 1 VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L112] COND TRUE p7 != 0 [L113] lk7 = 1 VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L116] COND TRUE p8 != 0 [L117] lk8 = 1 VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L120] COND TRUE p9 != 0 [L121] lk9 = 1 VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L124] COND TRUE p10 != 0 [L125] lk10 = 1 VAL [cond=-1, lk1=0, lk10=1, lk11=0, lk12=0, lk13=0, lk14=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, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L128] COND FALSE !(p11 != 0) VAL [cond=-1, lk1=0, lk10=1, lk11=0, lk12=0, lk13=0, lk14=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, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L132] COND TRUE p12 != 0 [L133] lk12 = 1 VAL [cond=-1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=0, lk14=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, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L136] COND TRUE p13 != 0 [L137] lk13 = 1 VAL [cond=-1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=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, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L140] COND TRUE p14 != 0 [L141] lk14 = 1 VAL [cond=-1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=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, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L146] COND FALSE !(p1 != 0) VAL [cond=-1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=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, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L151] COND FALSE !(p2 != 0) VAL [cond=-1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=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, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L219] reach_error() VAL [cond=-1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=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, 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, 53 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 364 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 364 mSDsluCounter, 906 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 282 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22 IncrementalHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 624 mSDtfsCounter, 22 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=125occurred in iteration=6, 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, 36 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 239 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 [2023-02-15 01:43:18,037 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 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_14-2.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 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c --- Real Ultimate output --- This is Ultimate 0.2.2-?-7e1ff0e [2023-02-15 01:43:20,155 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 01:43:20,158 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 01:43:20,195 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 01:43:20,198 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 01:43:20,200 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 01:43:20,202 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 01:43:20,205 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 01:43:20,209 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 01:43:20,213 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 01:43:20,214 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 01:43:20,216 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 01:43:20,217 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 01:43:20,219 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 01:43:20,220 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 01:43:20,223 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 01:43:20,223 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 01:43:20,225 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 01:43:20,226 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 01:43:20,231 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 01:43:20,232 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 01:43:20,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 01:43:20,234 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 01:43:20,235 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 01:43:20,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 01:43:20,241 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 01:43:20,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 01:43:20,243 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 01:43:20,244 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 01:43:20,244 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 01:43:20,245 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 01:43:20,253 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 01:43:20,254 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 01:43:20,255 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 01:43:20,256 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 01:43:20,256 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 01:43:20,257 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 01:43:20,257 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 01:43:20,257 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 01:43:20,258 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 01:43:20,258 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 01:43:20,259 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-15 01:43:20,289 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 01:43:20,289 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 01:43:20,290 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 01:43:20,290 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 01:43:20,291 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 01:43:20,291 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 01:43:20,292 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 01:43:20,292 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 01:43:20,292 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 01:43:20,292 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 01:43:20,293 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 01:43:20,293 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 01:43:20,293 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 01:43:20,293 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 01:43:20,294 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 01:43:20,294 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 01:43:20,294 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 01:43:20,294 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 01:43:20,294 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 01:43:20,294 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 01:43:20,295 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 01:43:20,295 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 01:43:20,295 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 01:43:20,295 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 01:43:20,295 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 01:43:20,296 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 01:43:20,296 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 01:43:20,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:43:20,296 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 01:43:20,296 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 01:43:20,297 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 01:43:20,297 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 01:43:20,297 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 01:43:20,297 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 01:43:20,297 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 01:43:20,297 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 01:43:20,298 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 01:43:20,298 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c [2023-02-15 01:43:20,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 01:43:20,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 01:43:20,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 01:43:20,635 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 01:43:20,635 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 01:43:20,637 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_14-2.c [2023-02-15 01:43:21,741 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 01:43:21,931 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 01:43:21,932 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-2.c [2023-02-15 01:43:21,944 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33cfb1cf0/824ed04f5d684882b6d0e3dbec0ded27/FLAGcdb53b701 [2023-02-15 01:43:21,966 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33cfb1cf0/824ed04f5d684882b6d0e3dbec0ded27 [2023-02-15 01:43:21,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 01:43:21,969 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 01:43:21,972 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 01:43:21,972 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 01:43:21,975 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 01:43:21,976 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:43:21" (1/1) ... [2023-02-15 01:43:21,977 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53ebc98d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:21, skipping insertion in model container [2023-02-15 01:43:21,977 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:43:21" (1/1) ... [2023-02-15 01:43:21,983 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 01:43:22,011 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 01:43:22,189 WARN L237 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_14-2.c[5305,5318] [2023-02-15 01:43:22,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:43:22,205 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 01:43:22,244 WARN L237 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_14-2.c[5305,5318] [2023-02-15 01:43:22,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:43:22,259 INFO L208 MainTranslator]: Completed translation [2023-02-15 01:43:22,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:22 WrapperNode [2023-02-15 01:43:22,260 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 01:43:22,261 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 01:43:22,261 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 01:43:22,261 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 01:43:22,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:22" (1/1) ... [2023-02-15 01:43:22,283 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:22" (1/1) ... [2023-02-15 01:43:22,308 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 169 [2023-02-15 01:43:22,309 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 01:43:22,309 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 01:43:22,310 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 01:43:22,310 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 01:43:22,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:22" (1/1) ... [2023-02-15 01:43:22,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:22" (1/1) ... [2023-02-15 01:43:22,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:22" (1/1) ... [2023-02-15 01:43:22,329 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:22" (1/1) ... [2023-02-15 01:43:22,341 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:22" (1/1) ... [2023-02-15 01:43:22,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:22" (1/1) ... [2023-02-15 01:43:22,351 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:22" (1/1) ... [2023-02-15 01:43:22,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:22" (1/1) ... [2023-02-15 01:43:22,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 01:43:22,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 01:43:22,362 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 01:43:22,362 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 01:43:22,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:22" (1/1) ... [2023-02-15 01:43:22,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:43:22,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:43:22,433 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) [2023-02-15 01:43:22,457 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 [2023-02-15 01:43:22,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 01:43:22,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 01:43:22,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 01:43:22,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-15 01:43:22,563 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 01:43:22,565 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 01:43:22,784 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 01:43:22,789 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 01:43:22,790 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-15 01:43:22,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:43:22 BoogieIcfgContainer [2023-02-15 01:43:22,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 01:43:22,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 01:43:22,794 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 01:43:22,796 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 01:43:22,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:43:21" (1/3) ... [2023-02-15 01:43:22,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aeea60a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:43:22, skipping insertion in model container [2023-02-15 01:43:22,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:43:22" (2/3) ... [2023-02-15 01:43:22,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aeea60a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:43:22, skipping insertion in model container [2023-02-15 01:43:22,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:43:22" (3/3) ... [2023-02-15 01:43:22,799 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_14-2.c [2023-02-15 01:43:22,814 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 01:43:22,815 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-02-15 01:43:22,862 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 01:43:22,868 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=PETRI_NET, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6c4368ed, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 01:43:22,869 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-02-15 01:43:22,872 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 50 states have (on average 1.94) internal successors, (97), 52 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:22,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-15 01:43:22,881 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:43:22,882 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 01:43:22,882 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-15 01:43:22,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:43:22,891 INFO L85 PathProgramCache]: Analyzing trace with hash 28943010, now seen corresponding path program 1 times [2023-02-15 01:43:22,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:43:22,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1431840946] [2023-02-15 01:43:22,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:43:22,903 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:43:22,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:43:22,913 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:43:22,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-15 01:43:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:43:23,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-15 01:43:23,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:43:23,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:43:23,051 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:43:23,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:43:23,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1431840946] [2023-02-15 01:43:23,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1431840946] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:43:23,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:43:23,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:43:23,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37440573] [2023-02-15 01:43:23,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:43:23,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 01:43:23,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:43:23,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 01:43:23,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 01:43:23,111 INFO L87 Difference]: Start difference. First operand has 53 states, 50 states have (on average 1.94) internal successors, (97), 52 states have internal predecessors, (97), 0 states have call successors, (0), 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) [2023-02-15 01:43:23,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:43:23,134 INFO L93 Difference]: Finished difference Result 53 states and 94 transitions. [2023-02-15 01:43:23,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 01:43:23,138 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 [2023-02-15 01:43:23,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:43:23,146 INFO L225 Difference]: With dead ends: 53 [2023-02-15 01:43:23,146 INFO L226 Difference]: Without dead ends: 51 [2023-02-15 01:43:23,148 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 [2023-02-15 01:43:23,151 INFO L413 NwaCegarLoop]: 94 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, 94 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 [2023-02-15 01:43:23,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:43:23,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-15 01:43:23,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-02-15 01:43:23,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:23,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 92 transitions. [2023-02-15 01:43:23,182 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 92 transitions. Word has length 5 [2023-02-15 01:43:23,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:43:23,182 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 92 transitions. [2023-02-15 01:43:23,183 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) [2023-02-15 01:43:23,183 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 92 transitions. [2023-02-15 01:43:23,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 01:43:23,183 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:43:23,183 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 01:43:23,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-02-15 01:43:23,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:43:23,391 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-15 01:43:23,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:43:23,392 INFO L85 PathProgramCache]: Analyzing trace with hash 889700139, now seen corresponding path program 1 times [2023-02-15 01:43:23,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:43:23,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1545770457] [2023-02-15 01:43:23,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:43:23,393 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:43:23,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:43:23,394 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:43:23,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-15 01:43:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:43:23,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 01:43:23,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:43:23,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:43:23,446 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:43:23,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:43:23,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1545770457] [2023-02-15 01:43:23,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1545770457] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:43:23,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:43:23,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:43:23,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133374917] [2023-02-15 01:43:23,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:43:23,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:43:23,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:43:23,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:43:23,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:43:23,450 INFO L87 Difference]: Start difference. First operand 51 states and 92 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) [2023-02-15 01:43:23,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:43:23,470 INFO L93 Difference]: Finished difference Result 50 states and 91 transitions. [2023-02-15 01:43:23,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:43:23,471 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 [2023-02-15 01:43:23,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:43:23,473 INFO L225 Difference]: With dead ends: 50 [2023-02-15 01:43:23,473 INFO L226 Difference]: Without dead ends: 48 [2023-02-15 01:43:23,473 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 [2023-02-15 01:43:23,475 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 86 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 91 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 [2023-02-15 01:43:23,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 91 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:43:23,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-02-15 01:43:23,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-02-15 01:43:23,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:23,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 89 transitions. [2023-02-15 01:43:23,481 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 89 transitions. Word has length 6 [2023-02-15 01:43:23,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:43:23,481 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 89 transitions. [2023-02-15 01:43:23,481 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) [2023-02-15 01:43:23,481 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 89 transitions. [2023-02-15 01:43:23,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 01:43:23,482 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:43:23,482 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] [2023-02-15 01:43:23,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-15 01:43:23,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:43:23,691 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-15 01:43:23,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:43:23,692 INFO L85 PathProgramCache]: Analyzing trace with hash 792943379, now seen corresponding path program 1 times [2023-02-15 01:43:23,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:43:23,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1630929474] [2023-02-15 01:43:23,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:43:23,693 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:43:23,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:43:23,694 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:43:23,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-15 01:43:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:43:23,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 01:43:23,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:43:23,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:43:23,824 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:43:23,824 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:43:23,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1630929474] [2023-02-15 01:43:23,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1630929474] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:43:23,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:43:23,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:43:23,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320125981] [2023-02-15 01:43:23,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:43:23,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:43:23,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:43:23,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:43:23,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:43:23,827 INFO L87 Difference]: Start difference. First operand 48 states and 89 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:23,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:43:23,879 INFO L93 Difference]: Finished difference Result 93 states and 173 transitions. [2023-02-15 01:43:23,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:43:23,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-15 01:43:23,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:43:23,888 INFO L225 Difference]: With dead ends: 93 [2023-02-15 01:43:23,888 INFO L226 Difference]: Without dead ends: 93 [2023-02-15 01:43:23,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:43:23,889 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 68 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:43:23,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 174 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:43:23,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-15 01:43:23,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 63. [2023-02-15 01:43:23,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.903225806451613) internal successors, (118), 62 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:23,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 118 transitions. [2023-02-15 01:43:23,897 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 118 transitions. Word has length 21 [2023-02-15 01:43:23,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:43:23,898 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 118 transitions. [2023-02-15 01:43:23,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:23,898 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 118 transitions. [2023-02-15 01:43:23,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 01:43:23,899 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:43:23,899 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] [2023-02-15 01:43:23,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-15 01:43:24,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:43:24,107 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-15 01:43:24,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:43:24,108 INFO L85 PathProgramCache]: Analyzing trace with hash 792950571, now seen corresponding path program 1 times [2023-02-15 01:43:24,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:43:24,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1620443540] [2023-02-15 01:43:24,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:43:24,109 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:43:24,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:43:24,111 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:43:24,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-15 01:43:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:43:24,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 01:43:24,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:43:24,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:43:24,244 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:43:24,245 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:43:24,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1620443540] [2023-02-15 01:43:24,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1620443540] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:43:24,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:43:24,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:43:24,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169198756] [2023-02-15 01:43:24,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:43:24,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:43:24,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:43:24,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:43:24,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:43:24,251 INFO L87 Difference]: Start difference. First operand 63 states and 118 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:24,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:43:24,284 INFO L93 Difference]: Finished difference Result 94 states and 173 transitions. [2023-02-15 01:43:24,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:43:24,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-15 01:43:24,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:43:24,286 INFO L225 Difference]: With dead ends: 94 [2023-02-15 01:43:24,286 INFO L226 Difference]: Without dead ends: 94 [2023-02-15 01:43:24,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:43:24,291 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 71 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 224 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 [2023-02-15 01:43:24,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 224 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:43:24,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-02-15 01:43:24,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2023-02-15 01:43:24,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.89010989010989) internal successors, (172), 91 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:24,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 172 transitions. [2023-02-15 01:43:24,301 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 172 transitions. Word has length 21 [2023-02-15 01:43:24,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:43:24,302 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 172 transitions. [2023-02-15 01:43:24,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:24,302 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 172 transitions. [2023-02-15 01:43:24,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 01:43:24,303 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:43:24,303 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] [2023-02-15 01:43:24,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-15 01:43:24,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:43:24,510 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-15 01:43:24,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:43:24,511 INFO L85 PathProgramCache]: Analyzing trace with hash -795404523, now seen corresponding path program 1 times [2023-02-15 01:43:24,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:43:24,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [853614345] [2023-02-15 01:43:24,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:43:24,512 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:43:24,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:43:24,513 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:43:24,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-15 01:43:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:43:24,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 01:43:24,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:43:24,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:43:24,582 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:43:24,582 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:43:24,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [853614345] [2023-02-15 01:43:24,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [853614345] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:43:24,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:43:24,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:43:24,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869290312] [2023-02-15 01:43:24,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:43:24,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:43:24,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:43:24,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:43:24,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:43:24,599 INFO L87 Difference]: Start difference. First operand 92 states and 172 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:24,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:43:24,630 INFO L93 Difference]: Finished difference Result 96 states and 173 transitions. [2023-02-15 01:43:24,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:43:24,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-15 01:43:24,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:43:24,631 INFO L225 Difference]: With dead ends: 96 [2023-02-15 01:43:24,631 INFO L226 Difference]: Without dead ends: 96 [2023-02-15 01:43:24,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:43:24,632 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 69 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 198 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 [2023-02-15 01:43:24,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 198 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:43:24,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-15 01:43:24,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2023-02-15 01:43:24,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 93 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:24,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 172 transitions. [2023-02-15 01:43:24,642 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 172 transitions. Word has length 21 [2023-02-15 01:43:24,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:43:24,643 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 172 transitions. [2023-02-15 01:43:24,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:24,643 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 172 transitions. [2023-02-15 01:43:24,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 01:43:24,648 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:43:24,649 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] [2023-02-15 01:43:24,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-15 01:43:24,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:43:24,857 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-15 01:43:24,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:43:24,858 INFO L85 PathProgramCache]: Analyzing trace with hash -795397331, now seen corresponding path program 1 times [2023-02-15 01:43:24,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:43:24,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [981630414] [2023-02-15 01:43:24,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:43:24,859 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:43:24,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:43:24,860 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:43:24,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-15 01:43:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:43:24,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 01:43:24,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:43:24,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:43:24,945 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:43:24,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:43:24,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [981630414] [2023-02-15 01:43:24,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [981630414] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:43:24,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:43:24,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:43:24,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609134465] [2023-02-15 01:43:24,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:43:24,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:43:24,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:43:24,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:43:24,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:43:24,947 INFO L87 Difference]: Start difference. First operand 94 states and 172 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:24,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:43:24,962 INFO L93 Difference]: Finished difference Result 127 states and 228 transitions. [2023-02-15 01:43:24,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:43:24,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-15 01:43:24,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:43:24,964 INFO L225 Difference]: With dead ends: 127 [2023-02-15 01:43:24,969 INFO L226 Difference]: Without dead ends: 127 [2023-02-15 01:43:24,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:43:24,970 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 70 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 125 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 [2023-02-15 01:43:24,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 125 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:43:24,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-15 01:43:24,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2023-02-15 01:43:24,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.8306451612903225) internal successors, (227), 124 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:24,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 227 transitions. [2023-02-15 01:43:24,980 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 227 transitions. Word has length 21 [2023-02-15 01:43:24,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:43:24,981 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 227 transitions. [2023-02-15 01:43:24,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:43:24,981 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 227 transitions. [2023-02-15 01:43:24,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 01:43:24,982 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:43:24,982 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] [2023-02-15 01:43:24,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-15 01:43:25,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:43:25,189 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-15 01:43:25,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:43:25,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1816465685, now seen corresponding path program 1 times [2023-02-15 01:43:25,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:43:25,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017259428] [2023-02-15 01:43:25,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:43:25,190 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:43:25,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:43:25,192 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:43:25,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-15 01:43:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 01:43:25,227 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 01:43:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 01:43:25,271 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-15 01:43:25,272 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 01:43:25,273 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2023-02-15 01:43:25,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2023-02-15 01:43:25,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-15 01:43:25,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:43:25,488 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:43:25,491 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 01:43:25,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 01:43:25 BoogieIcfgContainer [2023-02-15 01:43:25,538 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 01:43:25,538 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 01:43:25,539 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 01:43:25,539 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 01:43:25,539 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:43:22" (3/4) ... [2023-02-15 01:43:25,541 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 01:43:25,542 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 01:43:25,542 INFO L158 Benchmark]: Toolchain (without parser) took 3572.89ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 36.8MB in the beginning and 42.0MB in the end (delta: -5.2MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2023-02-15 01:43:25,543 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 52.4MB. Free memory was 29.1MB in the beginning and 29.0MB in the end (delta: 30.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 01:43:25,546 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.63ms. Allocated memory is still 65.0MB. Free memory was 36.6MB in the beginning and 40.4MB in the end (delta: -3.8MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2023-02-15 01:43:25,546 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.74ms. Allocated memory is still 65.0MB. Free memory was 40.2MB in the beginning and 38.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 01:43:25,546 INFO L158 Benchmark]: Boogie Preprocessor took 50.54ms. Allocated memory is still 65.0MB. Free memory was 38.4MB in the beginning and 37.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 01:43:25,546 INFO L158 Benchmark]: RCFGBuilder took 431.00ms. Allocated memory is still 65.0MB. Free memory was 36.8MB in the beginning and 35.8MB in the end (delta: 964.5kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 01:43:25,547 INFO L158 Benchmark]: TraceAbstraction took 2744.55ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 35.0MB in the beginning and 42.5MB in the end (delta: -7.4MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2023-02-15 01:43:25,547 INFO L158 Benchmark]: Witness Printer took 3.21ms. Allocated memory is still 79.7MB. Free memory is still 42.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 01:43:25,548 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.18ms. Allocated memory is still 52.4MB. Free memory was 29.1MB in the beginning and 29.0MB in the end (delta: 30.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.63ms. Allocated memory is still 65.0MB. Free memory was 36.6MB in the beginning and 40.4MB in the end (delta: -3.8MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.74ms. Allocated memory is still 65.0MB. Free memory was 40.2MB in the beginning and 38.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.54ms. Allocated memory is still 65.0MB. Free memory was 38.4MB in the beginning and 37.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 431.00ms. Allocated memory is still 65.0MB. Free memory was 36.8MB in the beginning and 35.8MB in the end (delta: 964.5kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2744.55ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 35.0MB in the beginning and 42.5MB in the end (delta: -7.4MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Witness Printer took 3.21ms. Allocated memory is still 79.7MB. Free memory is still 42.0MB. 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: 219]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 219. 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; [L51] int cond; [L53] COND TRUE 1 [L54] cond = __VERIFIER_nondet_int() [L55] COND FALSE !(cond == 0) [L58] lk1 = 0 [L60] lk2 = 0 [L62] lk3 = 0 [L64] lk4 = 0 [L66] lk5 = 0 [L68] lk6 = 0 [L70] lk7 = 0 [L72] lk8 = 0 [L74] lk9 = 0 [L76] lk10 = 0 [L78] lk11 = 0 [L80] lk12 = 0 [L82] lk13 = 0 [L84] lk14 = 0 VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0] [L88] COND FALSE !(p1 != 0) VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0] [L92] COND FALSE !(p2 != 0) VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0] [L96] COND FALSE !(p3 != 0) VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=0] [L100] COND TRUE p4 != 0 [L101] lk4 = 1 VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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] [L104] COND TRUE p5 != 0 [L105] lk5 = 1 VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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] [L108] COND TRUE p6 != 0 [L109] lk6 = 1 VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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] [L112] COND TRUE p7 != 0 [L113] lk7 = 1 VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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] [L116] COND TRUE p8 != 0 [L117] lk8 = 1 VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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] [L120] COND TRUE p9 != 0 [L121] lk9 = 1 VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=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] [L124] COND TRUE p10 != 0 [L125] lk10 = 1 VAL [cond=-2147483648, lk1=0, lk10=1, lk11=0, lk12=0, lk13=0, lk14=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] [L128] COND FALSE !(p11 != 0) VAL [cond=-2147483648, lk1=0, lk10=1, lk11=0, lk12=0, lk13=0, lk14=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] [L132] COND TRUE p12 != 0 [L133] lk12 = 1 VAL [cond=-2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=0, lk14=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] [L136] COND TRUE p13 != 0 [L137] lk13 = 1 VAL [cond=-2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=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] [L140] COND TRUE p14 != 0 [L141] lk14 = 1 VAL [cond=-2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=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, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L146] COND FALSE !(p1 != 0) VAL [cond=-2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=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, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L151] COND FALSE !(p2 != 0) VAL [cond=-2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=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, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L219] reach_error() VAL [cond=-2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=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, 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, 53 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 364 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 364 mSDsluCounter, 906 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 282 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22 IncrementalHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 624 mSDtfsCounter, 22 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=6, 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, 36 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 239 SizeOfPredicates, 0 NumberOfNonLiveVariables, 275 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 [2023-02-15 01:43:25,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample