./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_15-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5317dae Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/locks/test_locks_15-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:52:22,266 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:52:22,269 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:52:22,308 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:52:22,309 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:52:22,312 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:52:22,314 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:52:22,317 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:52:22,319 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:52:22,323 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:52:22,325 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:52:22,326 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:52:22,327 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:52:22,329 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:52:22,330 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:52:22,332 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:52:22,333 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:52:22,334 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:52:22,335 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:52:22,340 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:52:22,342 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:52:22,343 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:52:22,344 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:52:22,345 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:52:22,352 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:52:22,353 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:52:22,353 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:52:22,355 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:52:22,355 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:52:22,356 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:52:22,356 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:52:22,357 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:52:22,358 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:52:22,360 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:52:22,361 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:52:22,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:52:22,362 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:52:22,362 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:52:22,362 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:52:22,364 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:52:22,364 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:52:22,366 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-16 03:52:22,394 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:52:22,394 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:52:22,395 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:52:22,395 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:52:22,396 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:52:22,396 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:52:22,397 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:52:22,397 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:52:22,397 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:52:22,397 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:52:22,398 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:52:22,398 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:52:22,398 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:52:22,399 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:52:22,399 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:52:22,399 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:52:22,399 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:52:22,399 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:52:22,400 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:52:22,400 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:52:22,400 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:52:22,400 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:52:22,401 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:52:22,401 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:52:22,401 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:52:22,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:52:22,402 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:52:22,402 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:52:22,402 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 03:52:22,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 03:52:22,402 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:52:22,403 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:52:22,403 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:52:22,403 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:52:22,403 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 -> 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 [2023-02-16 03:52:22,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:52:22,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:52:22,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:52:22,693 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:52:22,693 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:52:22,695 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_15-1.c [2023-02-16 03:52:23,792 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:52:23,991 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:52:24,000 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-1.c [2023-02-16 03:52:24,010 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82e3f990f/ffb123ea526a4508b3cefe6e0640776a/FLAG6f289c689 [2023-02-16 03:52:24,028 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82e3f990f/ffb123ea526a4508b3cefe6e0640776a [2023-02-16 03:52:24,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:52:24,032 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:52:24,035 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:52:24,035 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:52:24,038 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:52:24,039 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:52:24" (1/1) ... [2023-02-16 03:52:24,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50035f93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:52:24, skipping insertion in model container [2023-02-16 03:52:24,040 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:52:24" (1/1) ... [2023-02-16 03:52:24,046 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:52:24,075 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:52:24,253 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_15-1.c[5654,5667] [2023-02-16 03:52:24,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:52:24,265 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 03:52:24,287 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_15-1.c[5654,5667] [2023-02-16 03:52:24,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:52:24,300 INFO L208 MainTranslator]: Completed translation [2023-02-16 03:52:24,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:52:24 WrapperNode [2023-02-16 03:52:24,301 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:52:24,302 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 03:52:24,302 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 03:52:24,302 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 03:52:24,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:52:24" (1/1) ... [2023-02-16 03:52:24,315 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:52:24" (1/1) ... [2023-02-16 03:52:24,339 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 195 [2023-02-16 03:52:24,340 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 03:52:24,340 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 03:52:24,341 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 03:52:24,341 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 03:52:24,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:52:24" (1/1) ... [2023-02-16 03:52:24,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:52:24" (1/1) ... [2023-02-16 03:52:24,360 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:52:24" (1/1) ... [2023-02-16 03:52:24,361 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:52:24" (1/1) ... [2023-02-16 03:52:24,364 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:52:24" (1/1) ... [2023-02-16 03:52:24,368 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:52:24" (1/1) ... [2023-02-16 03:52:24,369 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:52:24" (1/1) ... [2023-02-16 03:52:24,370 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:52:24" (1/1) ... [2023-02-16 03:52:24,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 03:52:24,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 03:52:24,373 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 03:52:24,374 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 03:52:24,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:52:24" (1/1) ... [2023-02-16 03:52:24,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:52:24,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:52:24,401 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-16 03:52:24,407 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-16 03:52:24,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 03:52:24,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 03:52:24,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 03:52:24,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 03:52:24,512 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 03:52:24,514 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 03:52:24,729 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 03:52:24,739 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 03:52:24,752 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-16 03:52:24,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:52:24 BoogieIcfgContainer [2023-02-16 03:52:24,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 03:52:24,757 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 03:52:24,757 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 03:52:24,760 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 03:52:24,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 03:52:24" (1/3) ... [2023-02-16 03:52:24,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d17634d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:52:24, skipping insertion in model container [2023-02-16 03:52:24,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:52:24" (2/3) ... [2023-02-16 03:52:24,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d17634d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:52:24, skipping insertion in model container [2023-02-16 03:52:24,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:52:24" (3/3) ... [2023-02-16 03:52:24,763 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_15-1.c [2023-02-16 03:52:24,777 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 03:52:24,778 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-02-16 03:52:24,815 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 03:52:24,821 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;@2adba900, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 03:52:24,821 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-02-16 03:52:24,825 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 55 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:52:24,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-16 03:52:24,829 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:52:24,830 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-16 03:52:24,830 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-16 03:52:24,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:52:24,834 INFO L85 PathProgramCache]: Analyzing trace with hash 28959891, now seen corresponding path program 1 times [2023-02-16 03:52:24,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:52:24,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356234222] [2023-02-16 03:52:24,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:52:24,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:52:24,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:52:25,039 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-16 03:52:25,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:52:25,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356234222] [2023-02-16 03:52:25,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356234222] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:52:25,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:52:25,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:52:25,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299862973] [2023-02-16 03:52:25,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:52:25,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 03:52:25,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:52:25,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 03:52:25,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 03:52:25,082 INFO L87 Difference]: Start difference. First operand has 56 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 55 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:52:25,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:52:25,108 INFO L93 Difference]: Finished difference Result 56 states and 100 transitions. [2023-02-16 03:52:25,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 03:52:25,110 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-16 03:52:25,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:52:25,119 INFO L225 Difference]: With dead ends: 56 [2023-02-16 03:52:25,121 INFO L226 Difference]: Without dead ends: 54 [2023-02-16 03:52:25,122 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-16 03:52:25,128 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:52:25,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:52:25,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-02-16 03:52:25,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-02-16 03:52:25,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.8846153846153846) internal successors, (98), 53 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:52:25,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 98 transitions. [2023-02-16 03:52:25,163 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 98 transitions. Word has length 5 [2023-02-16 03:52:25,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:52:25,164 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 98 transitions. [2023-02-16 03:52:25,164 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-16 03:52:25,164 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 98 transitions. [2023-02-16 03:52:25,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-16 03:52:25,165 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:52:25,165 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-16 03:52:25,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 03:52:25,166 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-16 03:52:25,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:52:25,169 INFO L85 PathProgramCache]: Analyzing trace with hash 889700683, now seen corresponding path program 1 times [2023-02-16 03:52:25,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:52:25,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005657382] [2023-02-16 03:52:25,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:52:25,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:52:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:52:25,244 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-16 03:52:25,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:52:25,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005657382] [2023-02-16 03:52:25,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005657382] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:52:25,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:52:25,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:52:25,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862973920] [2023-02-16 03:52:25,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:52:25,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:52:25,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:52:25,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:52:25,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:52:25,248 INFO L87 Difference]: Start difference. First operand 54 states and 98 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:52:25,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:52:25,258 INFO L93 Difference]: Finished difference Result 53 states and 97 transitions. [2023-02-16 03:52:25,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:52:25,259 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-16 03:52:25,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:52:25,260 INFO L225 Difference]: With dead ends: 53 [2023-02-16 03:52:25,260 INFO L226 Difference]: Without dead ends: 51 [2023-02-16 03:52:25,260 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-16 03:52:25,262 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:52:25,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 97 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:52:25,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-16 03:52:25,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-02-16 03:52:25,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:52:25,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 95 transitions. [2023-02-16 03:52:25,268 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 95 transitions. Word has length 6 [2023-02-16 03:52:25,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:52:25,269 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 95 transitions. [2023-02-16 03:52:25,269 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-16 03:52:25,269 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 95 transitions. [2023-02-16 03:52:25,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-16 03:52:25,270 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:52:25,270 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:52:25,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 03:52:25,271 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-16 03:52:25,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:52:25,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1188553263, now seen corresponding path program 1 times [2023-02-16 03:52:25,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:52:25,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155996870] [2023-02-16 03:52:25,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:52:25,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:52:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:52:25,388 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-16 03:52:25,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:52:25,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155996870] [2023-02-16 03:52:25,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155996870] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:52:25,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:52:25,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:52:25,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457098993] [2023-02-16 03:52:25,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:52:25,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:52:25,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:52:25,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:52:25,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:52:25,391 INFO L87 Difference]: Start difference. First operand 51 states and 95 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:52:25,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:52:25,423 INFO L93 Difference]: Finished difference Result 99 states and 184 transitions. [2023-02-16 03:52:25,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:52:25,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-16 03:52:25,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:52:25,425 INFO L225 Difference]: With dead ends: 99 [2023-02-16 03:52:25,425 INFO L226 Difference]: Without dead ends: 99 [2023-02-16 03:52:25,425 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-16 03:52:25,427 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 76 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:52:25,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 240 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:52:25,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-16 03:52:25,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2023-02-16 03:52:25,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.90625) internal successors, (183), 96 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:52:25,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 183 transitions. [2023-02-16 03:52:25,438 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 183 transitions. Word has length 22 [2023-02-16 03:52:25,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:52:25,439 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 183 transitions. [2023-02-16 03:52:25,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:52:25,439 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 183 transitions. [2023-02-16 03:52:25,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-16 03:52:25,440 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:52:25,440 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:52:25,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-16 03:52:25,441 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-16 03:52:25,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:52:25,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1188560455, now seen corresponding path program 1 times [2023-02-16 03:52:25,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:52:25,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895915275] [2023-02-16 03:52:25,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:52:25,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:52:25,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:52:25,490 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-16 03:52:25,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:52:25,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895915275] [2023-02-16 03:52:25,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895915275] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:52:25,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:52:25,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:52:25,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993985908] [2023-02-16 03:52:25,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:52:25,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:52:25,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:52:25,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:52:25,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:52:25,493 INFO L87 Difference]: Start difference. First operand 97 states and 183 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:52:25,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:52:25,509 INFO L93 Difference]: Finished difference Result 98 states and 184 transitions. [2023-02-16 03:52:25,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:52:25,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-16 03:52:25,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:52:25,518 INFO L225 Difference]: With dead ends: 98 [2023-02-16 03:52:25,521 INFO L226 Difference]: Without dead ends: 98 [2023-02-16 03:52:25,522 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-16 03:52:25,523 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 14 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:52:25,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 184 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:52:25,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-16 03:52:25,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-02-16 03:52:25,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.8969072164948453) internal successors, (184), 97 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:52:25,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 184 transitions. [2023-02-16 03:52:25,544 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 184 transitions. Word has length 22 [2023-02-16 03:52:25,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:52:25,544 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 184 transitions. [2023-02-16 03:52:25,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:52:25,545 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 184 transitions. [2023-02-16 03:52:25,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-16 03:52:25,545 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:52:25,546 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:52:25,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-16 03:52:25,546 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-16 03:52:25,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:52:25,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1112269327, now seen corresponding path program 1 times [2023-02-16 03:52:25,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:52:25,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62101293] [2023-02-16 03:52:25,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:52:25,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:52:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:52:25,606 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-16 03:52:25,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:52:25,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62101293] [2023-02-16 03:52:25,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62101293] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:52:25,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:52:25,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:52:25,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364727179] [2023-02-16 03:52:25,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:52:25,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:52:25,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:52:25,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:52:25,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:52:25,617 INFO L87 Difference]: Start difference. First operand 98 states and 184 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:52:25,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:52:25,644 INFO L93 Difference]: Finished difference Result 137 states and 251 transitions. [2023-02-16 03:52:25,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:52:25,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-16 03:52:25,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:52:25,653 INFO L225 Difference]: With dead ends: 137 [2023-02-16 03:52:25,653 INFO L226 Difference]: Without dead ends: 137 [2023-02-16 03:52:25,653 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-16 03:52:25,654 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 76 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:52:25,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 134 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:52:25,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-02-16 03:52:25,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2023-02-16 03:52:25,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.8656716417910448) internal successors, (250), 134 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:52:25,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 250 transitions. [2023-02-16 03:52:25,667 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 250 transitions. Word has length 22 [2023-02-16 03:52:25,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:52:25,667 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 250 transitions. [2023-02-16 03:52:25,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:52:25,668 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 250 transitions. [2023-02-16 03:52:25,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-16 03:52:25,668 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:52:25,669 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:52:25,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-16 03:52:25,669 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-16 03:52:25,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:52:25,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1112262135, now seen corresponding path program 1 times [2023-02-16 03:52:25,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:52:25,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323498772] [2023-02-16 03:52:25,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:52:25,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:52:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:52:25,733 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-16 03:52:25,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:52:25,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323498772] [2023-02-16 03:52:25,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323498772] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:52:25,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:52:25,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:52:25,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752188270] [2023-02-16 03:52:25,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:52:25,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:52:25,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:52:25,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:52:25,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:52:25,738 INFO L87 Difference]: Start difference. First operand 135 states and 250 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:52:25,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:52:25,759 INFO L93 Difference]: Finished difference Result 135 states and 244 transitions. [2023-02-16 03:52:25,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:52:25,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-16 03:52:25,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:52:25,760 INFO L225 Difference]: With dead ends: 135 [2023-02-16 03:52:25,760 INFO L226 Difference]: Without dead ends: 135 [2023-02-16 03:52:25,761 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-16 03:52:25,762 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 74 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:52:25,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 212 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:52:25,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-02-16 03:52:25,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2023-02-16 03:52:25,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.8409090909090908) internal successors, (243), 132 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:52:25,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 243 transitions. [2023-02-16 03:52:25,769 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 243 transitions. Word has length 22 [2023-02-16 03:52:25,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:52:25,770 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 243 transitions. [2023-02-16 03:52:25,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:52:25,770 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 243 transitions. [2023-02-16 03:52:25,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-16 03:52:25,771 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:52:25,771 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:52:25,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-16 03:52:25,772 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-16 03:52:25,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:52:25,772 INFO L85 PathProgramCache]: Analyzing trace with hash -476078575, now seen corresponding path program 1 times [2023-02-16 03:52:25,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:52:25,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407711065] [2023-02-16 03:52:25,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:52:25,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:52:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 03:52:25,796 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 03:52:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 03:52:25,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 03:52:25,839 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-16 03:52:25,841 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2023-02-16 03:52:25,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2023-02-16 03:52:25,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-16 03:52:25,845 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:52:25,848 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-16 03:52:25,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 03:52:25 BoogieIcfgContainer [2023-02-16 03:52:25,897 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-16 03:52:25,898 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 03:52:25,898 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 03:52:25,898 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 03:52:25,899 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:52:24" (3/4) ... [2023-02-16 03:52:25,901 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-16 03:52:25,901 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 03:52:25,902 INFO L158 Benchmark]: Toolchain (without parser) took 1869.86ms. Allocated memory is still 136.3MB. Free memory was 107.5MB in the beginning and 83.4MB in the end (delta: 24.1MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. [2023-02-16 03:52:25,902 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 113.2MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 03:52:25,903 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.30ms. Allocated memory is still 136.3MB. Free memory was 107.5MB in the beginning and 95.8MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-16 03:52:25,903 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.82ms. Allocated memory is still 136.3MB. Free memory was 95.8MB in the beginning and 93.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 03:52:25,903 INFO L158 Benchmark]: Boogie Preprocessor took 32.03ms. Allocated memory is still 136.3MB. Free memory was 93.8MB in the beginning and 92.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 03:52:25,904 INFO L158 Benchmark]: RCFGBuilder took 381.85ms. Allocated memory is still 136.3MB. Free memory was 92.3MB in the beginning and 75.2MB in the end (delta: 17.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-02-16 03:52:25,904 INFO L158 Benchmark]: TraceAbstraction took 1140.99ms. Allocated memory is still 136.3MB. Free memory was 74.5MB in the beginning and 84.2MB in the end (delta: -9.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 03:52:25,905 INFO L158 Benchmark]: Witness Printer took 3.54ms. Allocated memory is still 136.3MB. Free memory was 84.2MB in the beginning and 83.4MB in the end (delta: 770.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 03:52:25,906 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.19ms. Allocated memory is still 113.2MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.30ms. Allocated memory is still 136.3MB. Free memory was 107.5MB in the beginning and 95.8MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.82ms. Allocated memory is still 136.3MB. Free memory was 95.8MB in the beginning and 93.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.03ms. Allocated memory is still 136.3MB. Free memory was 93.8MB in the beginning and 92.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 381.85ms. Allocated memory is still 136.3MB. Free memory was 92.3MB in the beginning and 75.2MB in the end (delta: 17.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1140.99ms. Allocated memory is still 136.3MB. Free memory was 74.5MB in the beginning and 84.2MB in the end (delta: -9.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.54ms. Allocated memory is still 136.3MB. Free memory was 84.2MB in the beginning and 83.4MB in the end (delta: 770.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 233]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 233. Possible FailurePath: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L50] int p15 = __VERIFIER_nondet_int(); [L51] int lk15; [L54] int cond; VAL [p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L56] COND TRUE 1 [L57] cond = __VERIFIER_nondet_int() [L58] COND FALSE !(cond == 0) [L61] lk1 = 0 [L63] lk2 = 0 [L65] lk3 = 0 [L67] lk4 = 0 [L69] lk5 = 0 [L71] lk6 = 0 [L73] lk7 = 0 [L75] lk8 = 0 [L77] lk9 = 0 [L79] lk10 = 0 [L81] lk11 = 0 [L83] lk12 = 0 [L85] lk13 = 0 [L87] lk14 = 0 [L89] lk15 = 0 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L93] COND FALSE !(p1 != 0) VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L97] COND FALSE !(p2 != 0) VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L101] COND FALSE !(p3 != 0) VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L105] COND TRUE p4 != 0 [L106] lk4 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L109] COND TRUE p5 != 0 [L110] lk5 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L113] COND TRUE p6 != 0 [L114] lk6 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L117] COND TRUE p7 != 0 [L118] lk7 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L121] COND TRUE p8 != 0 [L122] lk8 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L125] COND TRUE p9 != 0 [L126] lk9 = 1 VAL [cond=1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L129] COND TRUE p10 != 0 [L130] lk10 = 1 VAL [cond=1, lk1=0, lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L133] COND FALSE !(p11 != 0) VAL [cond=1, lk1=0, lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L137] COND TRUE p12 != 0 [L138] lk12 = 1 VAL [cond=1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L141] COND TRUE p13 != 0 [L142] lk13 = 1 VAL [cond=1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L145] COND TRUE p14 != 0 [L146] lk14 = 1 VAL [cond=1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L149] COND TRUE p15 != 0 [L150] lk15 = 1 VAL [cond=1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L155] COND FALSE !(p1 != 0) VAL [cond=1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L160] COND FALSE !(p2 != 0) VAL [cond=1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L233] reach_error() VAL [cond=1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p15=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] - UnprovableResult [Line: 6]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 56 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 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, 332 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 332 mSDsluCounter, 967 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 303 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21 IncrementalHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 664 mSDtfsCounter, 21 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=5, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 253 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-02-16 03:52:25,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/locks/test_locks_15-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:52:27,969 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:52:27,971 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:52:28,009 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:52:28,009 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:52:28,012 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:52:28,014 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:52:28,017 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:52:28,021 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:52:28,025 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:52:28,026 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:52:28,028 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:52:28,029 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:52:28,030 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:52:28,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:52:28,034 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:52:28,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:52:28,036 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:52:28,038 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:52:28,043 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:52:28,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:52:28,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:52:28,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:52:28,046 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:52:28,052 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:52:28,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:52:28,053 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:52:28,055 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:52:28,055 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:52:28,056 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:52:28,056 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:52:28,058 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:52:28,059 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:52:28,059 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:52:28,060 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:52:28,060 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:52:28,061 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:52:28,061 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:52:28,061 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:52:28,062 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:52:28,063 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:52:28,063 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-16 03:52:28,095 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:52:28,095 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:52:28,096 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:52:28,096 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:52:28,097 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:52:28,097 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:52:28,098 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:52:28,098 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:52:28,098 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:52:28,098 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:52:28,099 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:52:28,099 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:52:28,100 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:52:28,100 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:52:28,100 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:52:28,100 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:52:28,100 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:52:28,100 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:52:28,101 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:52:28,101 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:52:28,101 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-16 03:52:28,101 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-16 03:52:28,101 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:52:28,101 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:52:28,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:52:28,102 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:52:28,109 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:52:28,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:52:28,110 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:52:28,110 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:52:28,110 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-16 03:52:28,111 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-16 03:52:28,111 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:52:28,111 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:52:28,111 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:52:28,111 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-16 03:52:28,112 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:52:28,112 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 -> 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 [2023-02-16 03:52:28,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:52:28,444 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:52:28,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:52:28,448 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:52:28,449 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:52:28,450 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_15-1.c [2023-02-16 03:52:29,723 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:52:29,931 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:52:29,931 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-1.c [2023-02-16 03:52:29,939 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18635abf0/bd18d77fb8f84556a1948c2cd9351770/FLAG08dbdf7cb [2023-02-16 03:52:29,958 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18635abf0/bd18d77fb8f84556a1948c2cd9351770 [2023-02-16 03:52:29,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:52:29,961 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:52:29,963 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:52:29,963 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:52:29,966 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:52:29,966 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:52:29" (1/1) ... [2023-02-16 03:52:29,968 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23832587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:52:29, skipping insertion in model container [2023-02-16 03:52:29,968 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:52:29" (1/1) ... [2023-02-16 03:52:29,973 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:52:30,004 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:52:30,129 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_15-1.c[5654,5667] [2023-02-16 03:52:30,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:52:30,143 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 03:52:30,166 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_15-1.c[5654,5667] [2023-02-16 03:52:30,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:52:30,179 INFO L208 MainTranslator]: Completed translation [2023-02-16 03:52:30,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:52:30 WrapperNode [2023-02-16 03:52:30,180 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:52:30,181 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 03:52:30,181 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 03:52:30,182 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 03:52:30,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:52:30" (1/1) ... [2023-02-16 03:52:30,199 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:52:30" (1/1) ... [2023-02-16 03:52:30,216 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 179 [2023-02-16 03:52:30,217 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 03:52:30,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 03:52:30,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 03:52:30,218 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 03:52:30,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:52:30" (1/1) ... [2023-02-16 03:52:30,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:52:30" (1/1) ... [2023-02-16 03:52:30,229 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:52:30" (1/1) ... [2023-02-16 03:52:30,229 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:52:30" (1/1) ... [2023-02-16 03:52:30,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:52:30" (1/1) ... [2023-02-16 03:52:30,239 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:52:30" (1/1) ... [2023-02-16 03:52:30,241 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:52:30" (1/1) ... [2023-02-16 03:52:30,242 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:52:30" (1/1) ... [2023-02-16 03:52:30,245 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 03:52:30,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 03:52:30,246 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 03:52:30,246 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 03:52:30,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:52:30" (1/1) ... [2023-02-16 03:52:30,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:52:30,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:52:30,278 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-16 03:52:30,288 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-16 03:52:30,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 03:52:30,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 03:52:30,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 03:52:30,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-16 03:52:30,373 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 03:52:30,375 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 03:52:30,642 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 03:52:30,655 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 03:52:30,656 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-16 03:52:30,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:52:30 BoogieIcfgContainer [2023-02-16 03:52:30,657 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 03:52:30,659 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 03:52:30,659 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 03:52:30,662 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 03:52:30,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 03:52:29" (1/3) ... [2023-02-16 03:52:30,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aef85d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:52:30, skipping insertion in model container [2023-02-16 03:52:30,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:52:30" (2/3) ... [2023-02-16 03:52:30,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aef85d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:52:30, skipping insertion in model container [2023-02-16 03:52:30,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:52:30" (3/3) ... [2023-02-16 03:52:30,676 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_15-1.c [2023-02-16 03:52:30,691 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 03:52:30,692 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-02-16 03:52:30,743 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 03:52:30,751 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;@1f68bbf2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 03:52:30,752 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-02-16 03:52:30,755 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 55 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:52:30,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-16 03:52:30,760 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:52:30,760 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-16 03:52:30,761 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-16 03:52:30,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:52:30,764 INFO L85 PathProgramCache]: Analyzing trace with hash 28959891, now seen corresponding path program 1 times [2023-02-16 03:52:30,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:52:30,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190952902] [2023-02-16 03:52:30,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:52:30,776 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-16 03:52:30,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:52:30,783 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-16 03:52:30,783 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-16 03:52:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:52:30,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-16 03:52:30,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:52:30,922 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-16 03:52:30,922 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:52:30,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:52:30,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [190952902] [2023-02-16 03:52:30,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [190952902] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:52:30,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:52:30,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:52:30,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677903623] [2023-02-16 03:52:30,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:52:30,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 03:52:30,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:52:30,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 03:52:30,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 03:52:30,961 INFO L87 Difference]: Start difference. First operand has 56 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 55 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:52:30,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:52:30,979 INFO L93 Difference]: Finished difference Result 56 states and 100 transitions. [2023-02-16 03:52:30,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 03:52:30,981 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-16 03:52:30,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:52:30,987 INFO L225 Difference]: With dead ends: 56 [2023-02-16 03:52:30,987 INFO L226 Difference]: Without dead ends: 54 [2023-02-16 03:52:30,988 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-16 03:52:30,991 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:52:30,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:52:31,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-02-16 03:52:31,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-02-16 03:52:31,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.8846153846153846) internal successors, (98), 53 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:52:31,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 98 transitions. [2023-02-16 03:52:31,018 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 98 transitions. Word has length 5 [2023-02-16 03:52:31,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:52:31,019 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 98 transitions. [2023-02-16 03:52:31,019 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-16 03:52:31,019 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 98 transitions. [2023-02-16 03:52:31,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-16 03:52:31,020 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:52:31,020 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-16 03:52:31,026 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-16 03:52:31,221 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-16 03:52:31,221 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-16 03:52:31,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:52:31,222 INFO L85 PathProgramCache]: Analyzing trace with hash 889700683, now seen corresponding path program 1 times [2023-02-16 03:52:31,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:52:31,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1382554326] [2023-02-16 03:52:31,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:52:31,223 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-16 03:52:31,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:52:31,224 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-16 03:52:31,226 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-16 03:52:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:52:31,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 03:52:31,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:52:31,273 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-16 03:52:31,273 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:52:31,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:52:31,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1382554326] [2023-02-16 03:52:31,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1382554326] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:52:31,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:52:31,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:52:31,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044722233] [2023-02-16 03:52:31,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:52:31,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:52:31,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:52:31,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:52:31,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:52:31,276 INFO L87 Difference]: Start difference. First operand 54 states and 98 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:52:31,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:52:31,287 INFO L93 Difference]: Finished difference Result 53 states and 97 transitions. [2023-02-16 03:52:31,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:52:31,288 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-16 03:52:31,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:52:31,289 INFO L225 Difference]: With dead ends: 53 [2023-02-16 03:52:31,289 INFO L226 Difference]: Without dead ends: 51 [2023-02-16 03:52:31,290 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-16 03:52:31,291 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:52:31,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 97 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:52:31,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-16 03:52:31,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-02-16 03:52:31,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:52:31,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 95 transitions. [2023-02-16 03:52:31,297 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 95 transitions. Word has length 6 [2023-02-16 03:52:31,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:52:31,297 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 95 transitions. [2023-02-16 03:52:31,298 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-16 03:52:31,298 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 95 transitions. [2023-02-16 03:52:31,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-16 03:52:31,298 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:52:31,299 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:52:31,314 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-16 03:52:31,506 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-16 03:52:31,507 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-16 03:52:31,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:52:31,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1188553263, now seen corresponding path program 1 times [2023-02-16 03:52:31,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:52:31,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [83635846] [2023-02-16 03:52:31,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:52:31,509 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-16 03:52:31,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:52:31,513 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-16 03:52:31,515 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-16 03:52:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:52:31,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 03:52:31,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:52:31,634 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-16 03:52:31,639 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:52:31,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:52:31,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [83635846] [2023-02-16 03:52:31,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [83635846] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:52:31,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:52:31,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:52:31,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510031472] [2023-02-16 03:52:31,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:52:31,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:52:31,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:52:31,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:52:31,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:52:31,642 INFO L87 Difference]: Start difference. First operand 51 states and 95 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:52:31,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:52:31,682 INFO L93 Difference]: Finished difference Result 99 states and 184 transitions. [2023-02-16 03:52:31,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:52:31,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-16 03:52:31,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:52:31,691 INFO L225 Difference]: With dead ends: 99 [2023-02-16 03:52:31,691 INFO L226 Difference]: Without dead ends: 99 [2023-02-16 03:52:31,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:52:31,693 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 76 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:52:31,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 240 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:52:31,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-16 03:52:31,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2023-02-16 03:52:31,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.90625) internal successors, (183), 96 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:52:31,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 183 transitions. [2023-02-16 03:52:31,705 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 183 transitions. Word has length 22 [2023-02-16 03:52:31,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:52:31,706 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 183 transitions. [2023-02-16 03:52:31,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:52:31,706 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 183 transitions. [2023-02-16 03:52:31,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-16 03:52:31,707 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:52:31,707 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:52:31,718 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-16 03:52:31,916 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-16 03:52:31,916 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-16 03:52:31,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:52:31,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1188560455, now seen corresponding path program 1 times [2023-02-16 03:52:31,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:52:31,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1893187691] [2023-02-16 03:52:31,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:52:31,918 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-16 03:52:31,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:52:31,926 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-16 03:52:31,929 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-16 03:52:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:52:31,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 03:52:31,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:52:32,055 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-16 03:52:32,055 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:52:32,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:52:32,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1893187691] [2023-02-16 03:52:32,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1893187691] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:52:32,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:52:32,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:52:32,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191043116] [2023-02-16 03:52:32,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:52:32,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:52:32,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:52:32,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:52:32,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:52:32,064 INFO L87 Difference]: Start difference. First operand 97 states and 183 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:52:32,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:52:32,086 INFO L93 Difference]: Finished difference Result 98 states and 184 transitions. [2023-02-16 03:52:32,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:52:32,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-16 03:52:32,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:52:32,088 INFO L225 Difference]: With dead ends: 98 [2023-02-16 03:52:32,088 INFO L226 Difference]: Without dead ends: 98 [2023-02-16 03:52:32,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:52:32,090 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 14 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:52:32,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 184 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:52:32,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-16 03:52:32,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-02-16 03:52:32,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.8969072164948453) internal successors, (184), 97 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:52:32,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 184 transitions. [2023-02-16 03:52:32,101 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 184 transitions. Word has length 22 [2023-02-16 03:52:32,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:52:32,101 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 184 transitions. [2023-02-16 03:52:32,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:52:32,101 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 184 transitions. [2023-02-16 03:52:32,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-16 03:52:32,102 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:52:32,102 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:52:32,113 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-16 03:52:32,302 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-16 03:52:32,303 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-16 03:52:32,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:52:32,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1112269327, now seen corresponding path program 1 times [2023-02-16 03:52:32,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:52:32,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1416518865] [2023-02-16 03:52:32,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:52:32,305 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-16 03:52:32,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:52:32,306 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-16 03:52:32,308 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-16 03:52:32,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:52:32,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 03:52:32,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:52:32,373 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-16 03:52:32,373 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:52:32,373 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:52:32,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1416518865] [2023-02-16 03:52:32,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1416518865] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:52:32,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:52:32,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:52:32,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747096443] [2023-02-16 03:52:32,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:52:32,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:52:32,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:52:32,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:52:32,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:52:32,376 INFO L87 Difference]: Start difference. First operand 98 states and 184 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:52:32,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:52:32,388 INFO L93 Difference]: Finished difference Result 137 states and 251 transitions. [2023-02-16 03:52:32,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:52:32,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-16 03:52:32,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:52:32,390 INFO L225 Difference]: With dead ends: 137 [2023-02-16 03:52:32,390 INFO L226 Difference]: Without dead ends: 137 [2023-02-16 03:52:32,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:52:32,391 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 76 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:52:32,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 134 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:52:32,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-02-16 03:52:32,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2023-02-16 03:52:32,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.8656716417910448) internal successors, (250), 134 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:52:32,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 250 transitions. [2023-02-16 03:52:32,401 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 250 transitions. Word has length 22 [2023-02-16 03:52:32,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:52:32,401 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 250 transitions. [2023-02-16 03:52:32,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:52:32,401 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 250 transitions. [2023-02-16 03:52:32,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-16 03:52:32,402 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:52:32,402 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:52:32,412 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-16 03:52:32,610 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-16 03:52:32,610 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-16 03:52:32,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:52:32,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1112262135, now seen corresponding path program 1 times [2023-02-16 03:52:32,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:52:32,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148272722] [2023-02-16 03:52:32,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:52:32,612 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-16 03:52:32,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:52:32,613 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-16 03:52:32,615 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-16 03:52:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:52:32,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 03:52:32,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:52:32,676 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-16 03:52:32,676 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:52:32,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:52:32,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1148272722] [2023-02-16 03:52:32,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1148272722] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:52:32,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:52:32,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:52:32,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814077196] [2023-02-16 03:52:32,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:52:32,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:52:32,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:52:32,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:52:32,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:52:32,679 INFO L87 Difference]: Start difference. First operand 135 states and 250 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:52:32,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:52:32,691 INFO L93 Difference]: Finished difference Result 135 states and 244 transitions. [2023-02-16 03:52:32,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:52:32,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-16 03:52:32,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:52:32,693 INFO L225 Difference]: With dead ends: 135 [2023-02-16 03:52:32,693 INFO L226 Difference]: Without dead ends: 135 [2023-02-16 03:52:32,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:52:32,706 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 74 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:52:32,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 212 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:52:32,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-02-16 03:52:32,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2023-02-16 03:52:32,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.8409090909090908) internal successors, (243), 132 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:52:32,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 243 transitions. [2023-02-16 03:52:32,725 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 243 transitions. Word has length 22 [2023-02-16 03:52:32,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:52:32,725 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 243 transitions. [2023-02-16 03:52:32,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:52:32,726 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 243 transitions. [2023-02-16 03:52:32,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-16 03:52:32,727 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:52:32,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:52:32,735 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-16 03:52:32,935 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-16 03:52:32,936 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-16 03:52:32,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:52:32,936 INFO L85 PathProgramCache]: Analyzing trace with hash -476078575, now seen corresponding path program 1 times [2023-02-16 03:52:32,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:52:32,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1067328957] [2023-02-16 03:52:32,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:52:32,937 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-16 03:52:32,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:52:32,938 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-16 03:52:32,941 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-16 03:52:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 03:52:32,972 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 03:52:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 03:52:33,046 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-16 03:52:33,061 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-16 03:52:33,062 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2023-02-16 03:52:33,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2023-02-16 03:52:33,089 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 (8)] Ended with exit code 0 [2023-02-16 03:52:33,289 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-16 03:52:33,291 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:52:33,294 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-16 03:52:33,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 03:52:33 BoogieIcfgContainer [2023-02-16 03:52:33,330 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-16 03:52:33,331 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 03:52:33,331 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 03:52:33,331 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 03:52:33,331 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:52:30" (3/4) ... [2023-02-16 03:52:33,334 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-16 03:52:33,334 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 03:52:33,335 INFO L158 Benchmark]: Toolchain (without parser) took 3373.70ms. Allocated memory was 71.3MB in the beginning and 90.2MB in the end (delta: 18.9MB). Free memory was 40.1MB in the beginning and 55.2MB in the end (delta: -15.2MB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. [2023-02-16 03:52:33,335 INFO L158 Benchmark]: CDTParser took 1.54ms. Allocated memory is still 71.3MB. Free memory is still 48.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 03:52:33,335 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.69ms. Allocated memory was 71.3MB in the beginning and 90.2MB in the end (delta: 18.9MB). Free memory was 39.9MB in the beginning and 66.8MB in the end (delta: -26.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-16 03:52:33,335 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.44ms. Allocated memory is still 90.2MB. Free memory was 66.8MB in the beginning and 64.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 03:52:33,336 INFO L158 Benchmark]: Boogie Preprocessor took 27.54ms. Allocated memory is still 90.2MB. Free memory was 64.9MB in the beginning and 63.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 03:52:33,336 INFO L158 Benchmark]: RCFGBuilder took 412.01ms. Allocated memory is still 90.2MB. Free memory was 63.2MB in the beginning and 46.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-16 03:52:33,336 INFO L158 Benchmark]: TraceAbstraction took 2671.27ms. Allocated memory is still 90.2MB. Free memory was 45.8MB in the beginning and 55.8MB in the end (delta: -10.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 03:52:33,345 INFO L158 Benchmark]: Witness Printer took 3.31ms. Allocated memory is still 90.2MB. Free memory was 55.8MB in the beginning and 55.2MB in the end (delta: 615.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 03:52:33,347 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.54ms. Allocated memory is still 71.3MB. Free memory is still 48.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 217.69ms. Allocated memory was 71.3MB in the beginning and 90.2MB in the end (delta: 18.9MB). Free memory was 39.9MB in the beginning and 66.8MB in the end (delta: -26.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.44ms. Allocated memory is still 90.2MB. Free memory was 66.8MB in the beginning and 64.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.54ms. Allocated memory is still 90.2MB. Free memory was 64.9MB in the beginning and 63.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 412.01ms. Allocated memory is still 90.2MB. Free memory was 63.2MB in the beginning and 46.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2671.27ms. Allocated memory is still 90.2MB. Free memory was 45.8MB in the beginning and 55.8MB in the end (delta: -10.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.31ms. Allocated memory is still 90.2MB. Free memory was 55.8MB in the beginning and 55.2MB in the end (delta: 615.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 233]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 233. Possible FailurePath: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L50] int p15 = __VERIFIER_nondet_int(); [L51] int lk15; [L54] int cond; [L56] COND TRUE 1 [L57] cond = __VERIFIER_nondet_int() [L58] COND FALSE !(cond == 0) [L61] lk1 = 0 [L63] lk2 = 0 [L65] lk3 = 0 [L67] lk4 = 0 [L69] lk5 = 0 [L71] lk6 = 0 [L73] lk7 = 0 [L75] lk8 = 0 [L77] lk9 = 0 [L79] lk10 = 0 [L81] lk11 = 0 [L83] lk12 = 0 [L85] lk13 = 0 [L87] lk14 = 0 [L89] lk15 = 0 VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0] [L93] COND FALSE !(p1 != 0) VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0] [L97] COND FALSE !(p2 != 0) VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0] [L101] COND FALSE !(p3 != 0) VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=0] [L105] COND TRUE p4 != 0 [L106] lk4 = 1 VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=0, p4=2] [L109] COND TRUE p5 != 0 [L110] lk5 = 1 VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=0, p4=2, p5=2] [L113] COND TRUE p6 != 0 [L114] lk6 = 1 VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2] [L117] COND TRUE p7 != 0 [L118] lk7 = 1 VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=0, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2] [L121] COND TRUE p8 != 0 [L122] lk8 = 1 VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2] [L125] COND TRUE p9 != 0 [L126] lk9 = 1 VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L129] COND TRUE p10 != 0 [L130] lk10 = 1 VAL [cond=-2147483648, lk1=0, lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L133] COND FALSE !(p11 != 0) VAL [cond=-2147483648, lk1=0, lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L137] COND TRUE p12 != 0 [L138] lk12 = 1 VAL [cond=-2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=0, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p12=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L141] COND TRUE p13 != 0 [L142] lk13 = 1 VAL [cond=-2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=0, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p12=2, p13=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L145] COND TRUE p14 != 0 [L146] lk14 = 1 VAL [cond=-2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p12=2, p13=2, p14=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L149] COND TRUE p15 != 0 [L150] lk15 = 1 VAL [cond=-2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p12=2, p13=2, p14=2, p15=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L155] COND FALSE !(p1 != 0) VAL [cond=-2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p12=2, p13=2, p14=2, p15=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L160] COND FALSE !(p2 != 0) VAL [cond=-2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p12=2, p13=2, p14=2, p15=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L233] reach_error() VAL [cond=-2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p12=2, p13=2, p14=2, p15=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] - UnprovableResult [Line: 6]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 56 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 332 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 332 mSDsluCounter, 967 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 303 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21 IncrementalHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 664 mSDtfsCounter, 21 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=5, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 253 SizeOfPredicates, 1 NumberOfNonLiveVariables, 287 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-02-16 03:52:33,371 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