./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/goblint-regression/13-privatized_41-traces-ex-7_unknown_1_pos.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d 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 ../../../trunk/examples/svcomp/goblint-regression/13-privatized_41-traces-ex-7_unknown_1_pos.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 64b25926fb6c7e27855d812b862643321480d6d0eb308c80224ee02bfde27516 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 00:25:06,331 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 00:25:06,334 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 00:25:06,383 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 00:25:06,386 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 00:25:06,389 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 00:25:06,391 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 00:25:06,393 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 00:25:06,395 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 00:25:06,399 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 00:25:06,401 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 00:25:06,403 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 00:25:06,403 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 00:25:06,405 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 00:25:06,406 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 00:25:06,413 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 00:25:06,414 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 00:25:06,415 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 00:25:06,417 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 00:25:06,422 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 00:25:06,423 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 00:25:06,424 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 00:25:06,424 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 00:25:06,425 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 00:25:06,432 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 00:25:06,432 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 00:25:06,433 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 00:25:06,434 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 00:25:06,435 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 00:25:06,436 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 00:25:06,436 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 00:25:06,438 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 00:25:06,439 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 00:25:06,440 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 00:25:06,441 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 00:25:06,441 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 00:25:06,442 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 00:25:06,442 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 00:25:06,442 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 00:25:06,443 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 00:25:06,443 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 00:25:06,445 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-09-01 00:25:06,487 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 00:25:06,487 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 00:25:06,488 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 00:25:06,488 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 00:25:06,489 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 00:25:06,489 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 00:25:06,490 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 00:25:06,490 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 00:25:06,490 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 00:25:06,491 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 00:25:06,491 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 00:25:06,492 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-01 00:25:06,492 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 00:25:06,492 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 00:25:06,492 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 00:25:06,492 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-09-01 00:25:06,492 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-09-01 00:25:06,493 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-09-01 00:25:06,493 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 00:25:06,493 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-09-01 00:25:06,493 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 00:25:06,493 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 00:25:06,493 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 00:25:06,494 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 00:25:06,494 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 00:25:06,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 00:25:06,494 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 00:25:06,494 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 00:25:06,495 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 00:25:06,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 00:25:06,495 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 00:25:06,495 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 00:25:06,495 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 00:25:06,496 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 00:25:06,496 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 -> 64b25926fb6c7e27855d812b862643321480d6d0eb308c80224ee02bfde27516 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 00:25:06,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 00:25:06,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 00:25:06,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 00:25:06,842 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 00:25:06,844 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 00:25:06,845 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_41-traces-ex-7_unknown_1_pos.i [2023-09-01 00:25:07,908 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 00:25:08,178 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 00:25:08,179 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_41-traces-ex-7_unknown_1_pos.i [2023-09-01 00:25:08,191 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/254d6943c/e3a6ae09a5484584964e29e6d5688bc5/FLAGdbcdb8967 [2023-09-01 00:25:08,206 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/254d6943c/e3a6ae09a5484584964e29e6d5688bc5 [2023-09-01 00:25:08,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 00:25:08,210 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 00:25:08,212 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 00:25:08,212 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 00:25:08,215 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 00:25:08,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 12:25:08" (1/1) ... [2023-09-01 00:25:08,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27de78f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:08, skipping insertion in model container [2023-09-01 00:25:08,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 12:25:08" (1/1) ... [2023-09-01 00:25:08,223 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 00:25:08,271 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 00:25:08,420 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_41-traces-ex-7_unknown_1_pos.i[1097,1110] [2023-09-01 00:25:08,583 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 00:25:08,597 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 00:25:08,611 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_41-traces-ex-7_unknown_1_pos.i[1097,1110] [2023-09-01 00:25:08,640 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 00:25:08,699 INFO L208 MainTranslator]: Completed translation [2023-09-01 00:25:08,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:08 WrapperNode [2023-09-01 00:25:08,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 00:25:08,700 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 00:25:08,700 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 00:25:08,700 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 00:25:08,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:08" (1/1) ... [2023-09-01 00:25:08,737 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:08" (1/1) ... [2023-09-01 00:25:08,752 INFO L138 Inliner]: procedures = 162, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2023-09-01 00:25:08,753 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 00:25:08,753 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 00:25:08,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 00:25:08,754 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 00:25:08,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:08" (1/1) ... [2023-09-01 00:25:08,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:08" (1/1) ... [2023-09-01 00:25:08,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:08" (1/1) ... [2023-09-01 00:25:08,764 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:08" (1/1) ... [2023-09-01 00:25:08,767 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:08" (1/1) ... [2023-09-01 00:25:08,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:08" (1/1) ... [2023-09-01 00:25:08,770 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:08" (1/1) ... [2023-09-01 00:25:08,771 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:08" (1/1) ... [2023-09-01 00:25:08,773 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 00:25:08,773 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 00:25:08,774 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 00:25:08,774 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 00:25:08,774 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:08" (1/1) ... [2023-09-01 00:25:08,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 00:25:08,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 00:25:08,810 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-01 00:25:08,825 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-09-01 00:25:08,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 00:25:08,861 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-09-01 00:25:08,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 00:25:08,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 00:25:08,861 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-09-01 00:25:08,861 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-09-01 00:25:08,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 00:25:08,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 00:25:08,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 00:25:08,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 00:25:08,863 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 00:25:09,016 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 00:25:09,018 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 00:25:09,199 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 00:25:09,204 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 00:25:09,204 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 00:25:09,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 12:25:09 BoogieIcfgContainer [2023-09-01 00:25:09,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 00:25:09,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 00:25:09,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 00:25:09,210 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 00:25:09,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 12:25:08" (1/3) ... [2023-09-01 00:25:09,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@554dbd96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 12:25:09, skipping insertion in model container [2023-09-01 00:25:09,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:08" (2/3) ... [2023-09-01 00:25:09,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@554dbd96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 12:25:09, skipping insertion in model container [2023-09-01 00:25:09,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 12:25:09" (3/3) ... [2023-09-01 00:25:09,214 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_41-traces-ex-7_unknown_1_pos.i [2023-09-01 00:25:09,229 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 00:25:09,229 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-09-01 00:25:09,229 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 00:25:09,292 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 00:25:09,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 66 transitions, 137 flow [2023-09-01 00:25:09,398 INFO L130 PetriNetUnfolder]: 1/65 cut-off events. [2023-09-01 00:25:09,398 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 00:25:09,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 65 events. 1/65 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 32 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2023-09-01 00:25:09,402 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 66 transitions, 137 flow [2023-09-01 00:25:09,407 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 61 transitions, 125 flow [2023-09-01 00:25:09,411 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 00:25:09,423 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 61 transitions, 125 flow [2023-09-01 00:25:09,427 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 61 transitions, 125 flow [2023-09-01 00:25:09,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 61 transitions, 125 flow [2023-09-01 00:25:09,459 INFO L130 PetriNetUnfolder]: 1/61 cut-off events. [2023-09-01 00:25:09,460 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 00:25:09,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 61 events. 1/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 31 event pairs, 0 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2023-09-01 00:25:09,461 INFO L119 LiptonReduction]: Number of co-enabled transitions 380 [2023-09-01 00:25:11,836 INFO L134 LiptonReduction]: Checked pairs total: 977 [2023-09-01 00:25:11,836 INFO L136 LiptonReduction]: Total number of compositions: 61 [2023-09-01 00:25:11,857 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 00:25:11,864 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;@ce05128, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 00:25:11,865 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-09-01 00:25:11,866 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-09-01 00:25:11,866 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 00:25:11,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:25:11,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-09-01 00:25:11,868 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 2 more)] === [2023-09-01 00:25:11,872 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:25:11,873 INFO L85 PathProgramCache]: Analyzing trace with hash 239, now seen corresponding path program 1 times [2023-09-01 00:25:11,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 00:25:11,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360000853] [2023-09-01 00:25:11,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:25:11,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 00:25:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:25:11,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:25:11,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 00:25:11,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360000853] [2023-09-01 00:25:11,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360000853] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:25:11,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:25:11,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-09-01 00:25:11,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830710462] [2023-09-01 00:25:11,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:25:11,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-01 00:25:11,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 00:25:12,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-01 00:25:12,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-01 00:25:12,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 127 [2023-09-01 00:25:12,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 15 transitions, 33 flow. Second operand has 2 states, 2 states have (on average 63.5) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 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-09-01 00:25:12,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:25:12,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 127 [2023-09-01 00:25:12,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:25:12,049 INFO L130 PetriNetUnfolder]: 15/44 cut-off events. [2023-09-01 00:25:12,050 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 00:25:12,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 44 events. 15/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 112 event pairs, 15 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 80. Up to 41 conditions per place. [2023-09-01 00:25:12,051 INFO L137 encePairwiseOnDemand]: 124/127 looper letters, 10 selfloop transitions, 0 changer transitions 0/12 dead transitions. [2023-09-01 00:25:12,051 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 12 transitions, 47 flow [2023-09-01 00:25:12,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-01 00:25:12,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-09-01 00:25:12,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 139 transitions. [2023-09-01 00:25:12,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.547244094488189 [2023-09-01 00:25:12,065 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 139 transitions. [2023-09-01 00:25:12,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 139 transitions. [2023-09-01 00:25:12,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:25:12,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 139 transitions. [2023-09-01 00:25:12,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 69.5) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:12,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 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-09-01 00:25:12,080 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 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-09-01 00:25:12,082 INFO L175 Difference]: Start difference. First operand has 18 places, 15 transitions, 33 flow. Second operand 2 states and 139 transitions. [2023-09-01 00:25:12,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 17 places, 12 transitions, 47 flow [2023-09-01 00:25:12,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 12 transitions, 46 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 00:25:12,086 INFO L231 Difference]: Finished difference. Result has 16 places, 12 transitions, 26 flow [2023-09-01 00:25:12,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=26, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=26, PETRI_PLACES=16, PETRI_TRANSITIONS=12} [2023-09-01 00:25:12,091 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, -2 predicate places. [2023-09-01 00:25:12,091 INFO L495 AbstractCegarLoop]: Abstraction has has 16 places, 12 transitions, 26 flow [2023-09-01 00:25:12,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 63.5) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 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-09-01 00:25:12,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:25:12,092 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-09-01 00:25:12,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 00:25:12,092 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 2 more)] === [2023-09-01 00:25:12,099 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:25:12,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1576489747, now seen corresponding path program 1 times [2023-09-01 00:25:12,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 00:25:12,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52923216] [2023-09-01 00:25:12,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:25:12,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 00:25:12,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:25:12,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:25:12,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 00:25:12,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52923216] [2023-09-01 00:25:12,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52923216] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:25:12,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:25:12,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 00:25:12,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475455822] [2023-09-01 00:25:12,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:25:12,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 00:25:12,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 00:25:12,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 00:25:12,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 00:25:12,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 127 [2023-09-01 00:25:12,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 16 places, 12 transitions, 26 flow. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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-09-01 00:25:12,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:25:12,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 127 [2023-09-01 00:25:12,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:25:12,357 INFO L130 PetriNetUnfolder]: 16/51 cut-off events. [2023-09-01 00:25:12,357 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 00:25:12,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 51 events. 16/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 132 event pairs, 9 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 99. Up to 27 conditions per place. [2023-09-01 00:25:12,358 INFO L137 encePairwiseOnDemand]: 123/127 looper letters, 13 selfloop transitions, 3 changer transitions 0/17 dead transitions. [2023-09-01 00:25:12,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 18 places, 17 transitions, 68 flow [2023-09-01 00:25:12,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 00:25:12,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 00:25:12,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 200 transitions. [2023-09-01 00:25:12,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5249343832020997 [2023-09-01 00:25:12,365 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 200 transitions. [2023-09-01 00:25:12,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 200 transitions. [2023-09-01 00:25:12,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:25:12,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 200 transitions. [2023-09-01 00:25:12,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 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-09-01 00:25:12,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 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-09-01 00:25:12,371 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 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-09-01 00:25:12,372 INFO L175 Difference]: Start difference. First operand has 16 places, 12 transitions, 26 flow. Second operand 3 states and 200 transitions. [2023-09-01 00:25:12,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 18 places, 17 transitions, 68 flow [2023-09-01 00:25:12,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 17 transitions, 68 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 00:25:12,374 INFO L231 Difference]: Finished difference. Result has 20 places, 13 transitions, 44 flow [2023-09-01 00:25:12,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=26, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=20, PETRI_TRANSITIONS=13} [2023-09-01 00:25:12,374 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 2 predicate places. [2023-09-01 00:25:12,375 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 13 transitions, 44 flow [2023-09-01 00:25:12,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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-09-01 00:25:12,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:25:12,375 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-09-01 00:25:12,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 00:25:12,376 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 2 more)] === [2023-09-01 00:25:12,376 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:25:12,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1576489744, now seen corresponding path program 1 times [2023-09-01 00:25:12,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 00:25:12,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310772572] [2023-09-01 00:25:12,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:25:12,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 00:25:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:25:12,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:25:12,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 00:25:12,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310772572] [2023-09-01 00:25:12,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310772572] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:25:12,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:25:12,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 00:25:12,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900374851] [2023-09-01 00:25:12,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:25:12,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 00:25:12,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 00:25:12,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 00:25:12,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 00:25:12,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 127 [2023-09-01 00:25:12,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 13 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 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-09-01 00:25:12,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:25:12,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 127 [2023-09-01 00:25:12,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:25:12,530 INFO L130 PetriNetUnfolder]: 10/33 cut-off events. [2023-09-01 00:25:12,530 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-09-01 00:25:12,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 33 events. 10/33 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 66 event pairs, 10 based on Foata normal form. 5/36 useless extension candidates. Maximal degree in co-relation 72. Up to 29 conditions per place. [2023-09-01 00:25:12,531 INFO L137 encePairwiseOnDemand]: 125/127 looper letters, 8 selfloop transitions, 1 changer transitions 0/11 dead transitions. [2023-09-01 00:25:12,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 11 transitions, 52 flow [2023-09-01 00:25:12,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 00:25:12,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 00:25:12,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2023-09-01 00:25:12,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49081364829396323 [2023-09-01 00:25:12,533 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 187 transitions. [2023-09-01 00:25:12,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 187 transitions. [2023-09-01 00:25:12,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:25:12,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 187 transitions. [2023-09-01 00:25:12,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 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-09-01 00:25:12,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 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-09-01 00:25:12,538 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 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-09-01 00:25:12,538 INFO L175 Difference]: Start difference. First operand has 20 places, 13 transitions, 44 flow. Second operand 3 states and 187 transitions. [2023-09-01 00:25:12,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 11 transitions, 52 flow [2023-09-01 00:25:12,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 11 transitions, 46 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-09-01 00:25:12,539 INFO L231 Difference]: Finished difference. Result has 18 places, 11 transitions, 30 flow [2023-09-01 00:25:12,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=28, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=11, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=30, PETRI_PLACES=18, PETRI_TRANSITIONS=11} [2023-09-01 00:25:12,540 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 0 predicate places. [2023-09-01 00:25:12,540 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 11 transitions, 30 flow [2023-09-01 00:25:12,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 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-09-01 00:25:12,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:25:12,541 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 00:25:12,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 00:25:12,541 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 2 more)] === [2023-09-01 00:25:12,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:25:12,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1763131108, now seen corresponding path program 1 times [2023-09-01 00:25:12,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 00:25:12,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042329208] [2023-09-01 00:25:12,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:25:12,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 00:25:12,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:25:12,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:25:12,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 00:25:12,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042329208] [2023-09-01 00:25:12,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042329208] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:25:12,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:25:12,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 00:25:12,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824213564] [2023-09-01 00:25:12,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:25:12,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 00:25:12,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 00:25:12,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 00:25:12,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 00:25:12,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 127 [2023-09-01 00:25:12,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 11 transitions, 30 flow. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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-09-01 00:25:12,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:25:12,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 127 [2023-09-01 00:25:12,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:25:12,693 INFO L130 PetriNetUnfolder]: 6/30 cut-off events. [2023-09-01 00:25:12,693 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-09-01 00:25:12,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 30 events. 6/30 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 53 event pairs, 2 based on Foata normal form. 4/34 useless extension candidates. Maximal degree in co-relation 66. Up to 18 conditions per place. [2023-09-01 00:25:12,694 INFO L137 encePairwiseOnDemand]: 122/127 looper letters, 9 selfloop transitions, 5 changer transitions 0/15 dead transitions. [2023-09-01 00:25:12,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 15 transitions, 68 flow [2023-09-01 00:25:12,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 00:25:12,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 00:25:12,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2023-09-01 00:25:12,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49081364829396323 [2023-09-01 00:25:12,696 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 187 transitions. [2023-09-01 00:25:12,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 187 transitions. [2023-09-01 00:25:12,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:25:12,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 187 transitions. [2023-09-01 00:25:12,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 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-09-01 00:25:12,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 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-09-01 00:25:12,700 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 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-09-01 00:25:12,701 INFO L175 Difference]: Start difference. First operand has 18 places, 11 transitions, 30 flow. Second operand 3 states and 187 transitions. [2023-09-01 00:25:12,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 15 transitions, 68 flow [2023-09-01 00:25:12,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 15 transitions, 67 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 00:25:12,702 INFO L231 Difference]: Finished difference. Result has 20 places, 13 transitions, 52 flow [2023-09-01 00:25:12,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=29, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=11, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=20, PETRI_TRANSITIONS=13} [2023-09-01 00:25:12,703 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 2 predicate places. [2023-09-01 00:25:12,703 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 13 transitions, 52 flow [2023-09-01 00:25:12,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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-09-01 00:25:12,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:25:12,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 00:25:12,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 00:25:12,704 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 2 more)] === [2023-09-01 00:25:12,704 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:25:12,705 INFO L85 PathProgramCache]: Analyzing trace with hash 260460892, now seen corresponding path program 2 times [2023-09-01 00:25:12,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 00:25:12,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730174856] [2023-09-01 00:25:12,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:25:12,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 00:25:12,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:25:12,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:25:12,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 00:25:12,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730174856] [2023-09-01 00:25:12,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730174856] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:25:12,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:25:12,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 00:25:12,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020570773] [2023-09-01 00:25:12,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:25:12,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 00:25:12,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 00:25:12,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 00:25:12,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-09-01 00:25:12,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 127 [2023-09-01 00:25:12,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 13 transitions, 52 flow. Second operand has 5 states, 5 states have (on average 57.6) internal successors, (288), 5 states have internal predecessors, (288), 0 states have call successors, (0), 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-09-01 00:25:12,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:25:12,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 127 [2023-09-01 00:25:12,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:25:13,022 INFO L130 PetriNetUnfolder]: 4/25 cut-off events. [2023-09-01 00:25:13,023 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-09-01 00:25:13,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 25 events. 4/25 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 36 event pairs, 0 based on Foata normal form. 1/26 useless extension candidates. Maximal degree in co-relation 76. Up to 15 conditions per place. [2023-09-01 00:25:13,023 INFO L137 encePairwiseOnDemand]: 123/127 looper letters, 10 selfloop transitions, 4 changer transitions 1/16 dead transitions. [2023-09-01 00:25:13,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 16 transitions, 96 flow [2023-09-01 00:25:13,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 00:25:13,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 00:25:13,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 237 transitions. [2023-09-01 00:25:13,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46653543307086615 [2023-09-01 00:25:13,025 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 237 transitions. [2023-09-01 00:25:13,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 237 transitions. [2023-09-01 00:25:13,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:25:13,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 237 transitions. [2023-09-01 00:25:13,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 0 states have call successors, (0), 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-09-01 00:25:13,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 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-09-01 00:25:13,028 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 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-09-01 00:25:13,028 INFO L175 Difference]: Start difference. First operand has 20 places, 13 transitions, 52 flow. Second operand 4 states and 237 transitions. [2023-09-01 00:25:13,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 16 transitions, 96 flow [2023-09-01 00:25:13,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 16 transitions, 89 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 00:25:13,029 INFO L231 Difference]: Finished difference. Result has 22 places, 13 transitions, 55 flow [2023-09-01 00:25:13,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=47, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=55, PETRI_PLACES=22, PETRI_TRANSITIONS=13} [2023-09-01 00:25:13,031 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 4 predicate places. [2023-09-01 00:25:13,032 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 13 transitions, 55 flow [2023-09-01 00:25:13,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.6) internal successors, (288), 5 states have internal predecessors, (288), 0 states have call successors, (0), 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-09-01 00:25:13,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:25:13,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 00:25:13,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 00:25:13,032 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 2 more)] === [2023-09-01 00:25:13,033 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:25:13,033 INFO L85 PathProgramCache]: Analyzing trace with hash 920422271, now seen corresponding path program 1 times [2023-09-01 00:25:13,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 00:25:13,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118468446] [2023-09-01 00:25:13,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:25:13,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 00:25:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:25:13,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:25:13,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 00:25:13,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118468446] [2023-09-01 00:25:13,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118468446] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:25:13,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:25:13,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 00:25:13,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402053021] [2023-09-01 00:25:13,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:25:13,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 00:25:13,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 00:25:13,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 00:25:13,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 00:25:13,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 127 [2023-09-01 00:25:13,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 13 transitions, 55 flow. Second operand has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 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-09-01 00:25:13,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:25:13,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 127 [2023-09-01 00:25:13,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:25:13,197 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2023-09-01 00:25:13,197 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-09-01 00:25:13,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 15 events. 0/15 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 7 event pairs, 0 based on Foata normal form. 1/16 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2023-09-01 00:25:13,198 INFO L137 encePairwiseOnDemand]: 122/127 looper letters, 4 selfloop transitions, 5 changer transitions 0/11 dead transitions. [2023-09-01 00:25:13,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 11 transitions, 65 flow [2023-09-01 00:25:13,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 00:25:13,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 00:25:13,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 238 transitions. [2023-09-01 00:25:13,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.468503937007874 [2023-09-01 00:25:13,199 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 238 transitions. [2023-09-01 00:25:13,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 238 transitions. [2023-09-01 00:25:13,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:25:13,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 238 transitions. [2023-09-01 00:25:13,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 59.5) internal successors, (238), 4 states have internal predecessors, (238), 0 states have call successors, (0), 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-09-01 00:25:13,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 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-09-01 00:25:13,202 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 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-09-01 00:25:13,202 INFO L175 Difference]: Start difference. First operand has 22 places, 13 transitions, 55 flow. Second operand 4 states and 238 transitions. [2023-09-01 00:25:13,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 11 transitions, 65 flow [2023-09-01 00:25:13,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 11 transitions, 55 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-09-01 00:25:13,203 INFO L231 Difference]: Finished difference. Result has 22 places, 11 transitions, 47 flow [2023-09-01 00:25:13,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=37, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=11, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=47, PETRI_PLACES=22, PETRI_TRANSITIONS=11} [2023-09-01 00:25:13,204 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 4 predicate places. [2023-09-01 00:25:13,204 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 11 transitions, 47 flow [2023-09-01 00:25:13,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 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-09-01 00:25:13,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:25:13,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 00:25:13,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 00:25:13,205 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 2 more)] === [2023-09-01 00:25:13,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:25:13,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1543089406, now seen corresponding path program 1 times [2023-09-01 00:25:13,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 00:25:13,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130102728] [2023-09-01 00:25:13,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:25:13,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 00:25:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 00:25:13,220 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 00:25:13,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 00:25:13,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 00:25:13,254 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 00:25:13,255 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2023-09-01 00:25:13,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-09-01 00:25:13,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-09-01 00:25:13,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (1 of 5 remaining) [2023-09-01 00:25:13,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2023-09-01 00:25:13,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 00:25:13,258 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-09-01 00:25:13,262 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 00:25:13,262 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 00:25:13,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 12:25:13 BasicIcfg [2023-09-01 00:25:13,281 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 00:25:13,282 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 00:25:13,282 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 00:25:13,282 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 00:25:13,283 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 12:25:09" (3/4) ... [2023-09-01 00:25:13,285 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-09-01 00:25:13,285 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 00:25:13,286 INFO L158 Benchmark]: Toolchain (without parser) took 5075.86ms. Allocated memory was 77.6MB in the beginning and 113.2MB in the end (delta: 35.7MB). Free memory was 53.6MB in the beginning and 32.1MB in the end (delta: 21.5MB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. [2023-09-01 00:25:13,286 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 54.5MB. Free memory is still 32.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 00:25:13,287 INFO L158 Benchmark]: CACSL2BoogieTranslator took 487.64ms. Allocated memory is still 77.6MB. Free memory was 53.3MB in the beginning and 54.9MB in the end (delta: -1.6MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2023-09-01 00:25:13,287 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.70ms. Allocated memory is still 77.6MB. Free memory was 54.9MB in the beginning and 53.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 00:25:13,287 INFO L158 Benchmark]: Boogie Preprocessor took 19.33ms. Allocated memory is still 77.6MB. Free memory was 53.1MB in the beginning and 51.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 00:25:13,288 INFO L158 Benchmark]: RCFGBuilder took 432.47ms. Allocated memory is still 77.6MB. Free memory was 51.7MB in the beginning and 39.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-09-01 00:25:13,288 INFO L158 Benchmark]: TraceAbstraction took 4073.72ms. Allocated memory was 77.6MB in the beginning and 113.2MB in the end (delta: 35.7MB). Free memory was 38.5MB in the beginning and 32.1MB in the end (delta: 6.4MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. [2023-09-01 00:25:13,289 INFO L158 Benchmark]: Witness Printer took 3.33ms. Allocated memory is still 113.2MB. Free memory is still 32.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 00:25:13,291 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.16ms. Allocated memory is still 54.5MB. Free memory is still 32.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 487.64ms. Allocated memory is still 77.6MB. Free memory was 53.3MB in the beginning and 54.9MB in the end (delta: -1.6MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.70ms. Allocated memory is still 77.6MB. Free memory was 54.9MB in the beginning and 53.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.33ms. Allocated memory is still 77.6MB. Free memory was 53.1MB in the beginning and 51.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 432.47ms. Allocated memory is still 77.6MB. Free memory was 51.7MB in the beginning and 39.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4073.72ms. Allocated memory was 77.6MB in the beginning and 113.2MB in the end (delta: 35.7MB). Free memory was 38.5MB in the beginning and 32.1MB in the end (delta: 6.4MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. * Witness Printer took 3.33ms. Allocated memory is still 113.2MB. Free memory is still 32.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 64 PlacesBefore, 18 PlacesAfterwards, 61 TransitionsBefore, 15 TransitionsAfterwards, 380 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 19 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 61 TotalNumberOfCompositions, 977 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 457, independent: 351, independent conditional: 0, independent unconditional: 351, dependent: 106, dependent conditional: 0, dependent unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 223, independent: 202, independent conditional: 0, independent unconditional: 202, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 457, independent: 149, independent conditional: 0, independent unconditional: 149, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 223, unknown conditional: 0, unknown unconditional: 223] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 11, Positive conditional cache size: 0, Positive unconditional cache size: 11, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L681] 0 int g = 0; [L682] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t D = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L693] 0 pthread_t id; [L694] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [A={3:0}, D={4:0}, arg={0:0}, g=0, id={5:0}, pthread_create(&id, ((void *)0), t_fun, ((void *)0))=-1] [L687] 1 g = 17 VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17] [L690] 1 return ((void *)0); [L698] CALL 0 __VERIFIER_assert(g == 0) [L19] COND TRUE 0 !(cond) [L19] 0 reach_error() VAL [A={3:0}, D={4:0}, \old(cond)=0, \result={0:0}, arg={0:0}, arg={0:0}, cond=0, g=17] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 78 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.9s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 204 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 90 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 318 IncrementalHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 32 mSDtfsCounter, 318 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=5, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 52 NumberOfCodeBlocks, 52 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 163 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-09-01 00:25:13,320 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 ../../../trunk/examples/svcomp/goblint-regression/13-privatized_41-traces-ex-7_unknown_1_pos.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 64b25926fb6c7e27855d812b862643321480d6d0eb308c80224ee02bfde27516 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 00:25:15,164 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 00:25:15,165 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 00:25:15,200 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 00:25:15,203 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 00:25:15,206 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 00:25:15,208 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 00:25:15,211 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 00:25:15,215 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 00:25:15,220 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 00:25:15,221 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 00:25:15,221 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 00:25:15,222 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 00:25:15,224 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 00:25:15,226 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 00:25:15,227 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 00:25:15,227 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 00:25:15,228 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 00:25:15,229 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 00:25:15,231 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 00:25:15,245 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 00:25:15,247 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 00:25:15,248 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 00:25:15,249 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 00:25:15,252 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 00:25:15,257 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 00:25:15,257 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 00:25:15,258 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 00:25:15,260 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 00:25:15,260 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 00:25:15,261 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 00:25:15,261 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 00:25:15,263 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 00:25:15,264 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 00:25:15,265 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 00:25:15,265 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 00:25:15,266 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 00:25:15,266 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 00:25:15,266 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 00:25:15,267 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 00:25:15,268 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 00:25:15,269 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-09-01 00:25:15,299 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 00:25:15,300 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 00:25:15,300 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 00:25:15,300 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 00:25:15,301 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 00:25:15,301 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 00:25:15,302 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 00:25:15,302 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 00:25:15,302 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 00:25:15,302 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 00:25:15,303 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 00:25:15,303 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-01 00:25:15,303 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 00:25:15,303 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 00:25:15,303 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 00:25:15,304 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-09-01 00:25:15,304 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-09-01 00:25:15,304 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-09-01 00:25:15,304 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 00:25:15,304 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-09-01 00:25:15,305 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-09-01 00:25:15,305 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-09-01 00:25:15,305 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 00:25:15,305 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 00:25:15,305 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 00:25:15,306 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 00:25:15,306 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 00:25:15,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 00:25:15,306 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 00:25:15,306 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 00:25:15,307 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-09-01 00:25:15,307 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-09-01 00:25:15,307 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 00:25:15,307 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 00:25:15,307 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 00:25:15,308 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-09-01 00:25:15,308 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 00:25:15,308 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 -> 64b25926fb6c7e27855d812b862643321480d6d0eb308c80224ee02bfde27516 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 00:25:15,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 00:25:15,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 00:25:15,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 00:25:15,628 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 00:25:15,629 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 00:25:15,630 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_41-traces-ex-7_unknown_1_pos.i [2023-09-01 00:25:16,829 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 00:25:17,067 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 00:25:17,068 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_41-traces-ex-7_unknown_1_pos.i [2023-09-01 00:25:17,081 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/562783da0/1177525e80774737aa41b0c717d28b0c/FLAGe5bcd64cf [2023-09-01 00:25:17,092 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/562783da0/1177525e80774737aa41b0c717d28b0c [2023-09-01 00:25:17,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 00:25:17,096 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 00:25:17,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 00:25:17,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 00:25:17,104 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 00:25:17,105 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 12:25:17" (1/1) ... [2023-09-01 00:25:17,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1555282a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:17, skipping insertion in model container [2023-09-01 00:25:17,108 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 12:25:17" (1/1) ... [2023-09-01 00:25:17,115 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 00:25:17,150 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 00:25:17,299 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_41-traces-ex-7_unknown_1_pos.i[1097,1110] [2023-09-01 00:25:17,463 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 00:25:17,480 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 00:25:17,493 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_41-traces-ex-7_unknown_1_pos.i[1097,1110] [2023-09-01 00:25:17,530 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 00:25:17,579 INFO L208 MainTranslator]: Completed translation [2023-09-01 00:25:17,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:17 WrapperNode [2023-09-01 00:25:17,579 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 00:25:17,581 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 00:25:17,581 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 00:25:17,581 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 00:25:17,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:17" (1/1) ... [2023-09-01 00:25:17,617 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:17" (1/1) ... [2023-09-01 00:25:17,634 INFO L138 Inliner]: procedures = 166, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 49 [2023-09-01 00:25:17,635 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 00:25:17,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 00:25:17,637 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 00:25:17,637 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 00:25:17,644 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:17" (1/1) ... [2023-09-01 00:25:17,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:17" (1/1) ... [2023-09-01 00:25:17,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:17" (1/1) ... [2023-09-01 00:25:17,649 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:17" (1/1) ... [2023-09-01 00:25:17,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:17" (1/1) ... [2023-09-01 00:25:17,671 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:17" (1/1) ... [2023-09-01 00:25:17,674 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:17" (1/1) ... [2023-09-01 00:25:17,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:17" (1/1) ... [2023-09-01 00:25:17,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 00:25:17,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 00:25:17,685 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 00:25:17,685 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 00:25:17,686 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:17" (1/1) ... [2023-09-01 00:25:17,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 00:25:17,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 00:25:17,724 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-09-01 00:25:17,745 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-09-01 00:25:17,758 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-09-01 00:25:17,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 00:25:17,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 00:25:17,760 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-09-01 00:25:17,760 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-09-01 00:25:17,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 00:25:17,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-09-01 00:25:17,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-09-01 00:25:17,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-09-01 00:25:17,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 00:25:17,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 00:25:17,762 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 00:25:17,942 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 00:25:17,947 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 00:25:18,144 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 00:25:18,150 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 00:25:18,150 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 00:25:18,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 12:25:18 BoogieIcfgContainer [2023-09-01 00:25:18,152 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 00:25:18,154 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 00:25:18,154 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 00:25:18,157 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 00:25:18,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 12:25:17" (1/3) ... [2023-09-01 00:25:18,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc4d456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 12:25:18, skipping insertion in model container [2023-09-01 00:25:18,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:25:17" (2/3) ... [2023-09-01 00:25:18,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc4d456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 12:25:18, skipping insertion in model container [2023-09-01 00:25:18,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 12:25:18" (3/3) ... [2023-09-01 00:25:18,162 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_41-traces-ex-7_unknown_1_pos.i [2023-09-01 00:25:18,178 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 00:25:18,178 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-09-01 00:25:18,179 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 00:25:18,223 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 00:25:18,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 67 transitions, 139 flow [2023-09-01 00:25:18,281 INFO L130 PetriNetUnfolder]: 1/66 cut-off events. [2023-09-01 00:25:18,287 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 00:25:18,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 66 events. 1/66 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 32 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2023-09-01 00:25:18,292 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 67 transitions, 139 flow [2023-09-01 00:25:18,295 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 62 transitions, 127 flow [2023-09-01 00:25:18,298 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 00:25:18,306 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 62 transitions, 127 flow [2023-09-01 00:25:18,309 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 62 transitions, 127 flow [2023-09-01 00:25:18,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 62 transitions, 127 flow [2023-09-01 00:25:18,322 INFO L130 PetriNetUnfolder]: 1/62 cut-off events. [2023-09-01 00:25:18,323 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 00:25:18,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 62 events. 1/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 31 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2023-09-01 00:25:18,324 INFO L119 LiptonReduction]: Number of co-enabled transitions 380 [2023-09-01 00:25:22,208 INFO L134 LiptonReduction]: Checked pairs total: 967 [2023-09-01 00:25:22,208 INFO L136 LiptonReduction]: Total number of compositions: 58 [2023-09-01 00:25:22,221 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 00:25:22,227 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;@2df9e2a8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 00:25:22,227 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-09-01 00:25:22,229 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-09-01 00:25:22,229 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 00:25:22,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:25:22,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-09-01 00:25:22,231 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 2 more)] === [2023-09-01 00:25:22,235 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:25:22,235 INFO L85 PathProgramCache]: Analyzing trace with hash 238, now seen corresponding path program 1 times [2023-09-01 00:25:22,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 00:25:22,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76330519] [2023-09-01 00:25:22,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:25:22,246 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-09-01 00:25:22,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 00:25:22,253 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-09-01 00:25:22,260 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-09-01 00:25:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:25:22,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-09-01 00:25:22,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 00:25:22,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:25:22,312 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 00:25:22,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 00:25:22,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [76330519] [2023-09-01 00:25:22,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [76330519] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:25:22,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:25:22,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-09-01 00:25:22,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125553945] [2023-09-01 00:25:22,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:25:22,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-01 00:25:22,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 00:25:22,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-01 00:25:22,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-01 00:25:22,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 125 [2023-09-01 00:25:22,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 15 transitions, 33 flow. Second operand has 2 states, 2 states have (on average 64.5) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:22,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:25:22,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 125 [2023-09-01 00:25:22,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:25:22,398 INFO L130 PetriNetUnfolder]: 15/46 cut-off events. [2023-09-01 00:25:22,398 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 00:25:22,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 46 events. 15/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 114 event pairs, 15 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 82. Up to 41 conditions per place. [2023-09-01 00:25:22,399 INFO L137 encePairwiseOnDemand]: 122/125 looper letters, 10 selfloop transitions, 0 changer transitions 0/12 dead transitions. [2023-09-01 00:25:22,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 12 transitions, 47 flow [2023-09-01 00:25:22,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-01 00:25:22,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-09-01 00:25:22,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 141 transitions. [2023-09-01 00:25:22,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.564 [2023-09-01 00:25:22,419 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 141 transitions. [2023-09-01 00:25:22,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 141 transitions. [2023-09-01 00:25:22,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:25:22,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 141 transitions. [2023-09-01 00:25:22,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 70.5) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 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-09-01 00:25:22,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 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-09-01 00:25:22,427 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 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-09-01 00:25:22,429 INFO L175 Difference]: Start difference. First operand has 18 places, 15 transitions, 33 flow. Second operand 2 states and 141 transitions. [2023-09-01 00:25:22,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 17 places, 12 transitions, 47 flow [2023-09-01 00:25:22,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 12 transitions, 46 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 00:25:22,432 INFO L231 Difference]: Finished difference. Result has 16 places, 12 transitions, 26 flow [2023-09-01 00:25:22,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=26, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=26, PETRI_PLACES=16, PETRI_TRANSITIONS=12} [2023-09-01 00:25:22,453 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, -2 predicate places. [2023-09-01 00:25:22,453 INFO L495 AbstractCegarLoop]: Abstraction has has 16 places, 12 transitions, 26 flow [2023-09-01 00:25:22,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 64.5) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 00:25:22,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:25:22,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-09-01 00:25:22,465 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 (2)] Forceful destruction successful, exit code 0 [2023-09-01 00:25:22,654 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-09-01 00:25:22,655 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 2 more)] === [2023-09-01 00:25:22,655 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:25:22,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1603269871, now seen corresponding path program 1 times [2023-09-01 00:25:22,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 00:25:22,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [22275832] [2023-09-01 00:25:22,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:25:22,657 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-09-01 00:25:22,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 00:25:22,658 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-09-01 00:25:22,685 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-09-01 00:25:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:25:22,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-01 00:25:22,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 00:25:22,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:25:22,749 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 00:25:22,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 00:25:22,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [22275832] [2023-09-01 00:25:22,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [22275832] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:25:22,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:25:22,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 00:25:22,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326414622] [2023-09-01 00:25:22,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:25:22,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 00:25:22,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 00:25:22,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 00:25:22,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 00:25:22,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 125 [2023-09-01 00:25:22,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 16 places, 12 transitions, 26 flow. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 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-09-01 00:25:22,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:25:22,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 125 [2023-09-01 00:25:22,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:25:22,816 INFO L130 PetriNetUnfolder]: 16/51 cut-off events. [2023-09-01 00:25:22,817 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 00:25:22,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 51 events. 16/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 129 event pairs, 9 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 99. Up to 27 conditions per place. [2023-09-01 00:25:22,820 INFO L137 encePairwiseOnDemand]: 121/125 looper letters, 13 selfloop transitions, 3 changer transitions 0/17 dead transitions. [2023-09-01 00:25:22,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 18 places, 17 transitions, 68 flow [2023-09-01 00:25:22,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 00:25:22,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 00:25:22,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 203 transitions. [2023-09-01 00:25:22,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5413333333333333 [2023-09-01 00:25:22,827 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 203 transitions. [2023-09-01 00:25:22,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 203 transitions. [2023-09-01 00:25:22,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:25:22,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 203 transitions. [2023-09-01 00:25:22,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 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-09-01 00:25:22,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 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-09-01 00:25:22,833 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 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-09-01 00:25:22,833 INFO L175 Difference]: Start difference. First operand has 16 places, 12 transitions, 26 flow. Second operand 3 states and 203 transitions. [2023-09-01 00:25:22,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 18 places, 17 transitions, 68 flow [2023-09-01 00:25:22,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 17 transitions, 68 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 00:25:22,835 INFO L231 Difference]: Finished difference. Result has 20 places, 13 transitions, 44 flow [2023-09-01 00:25:22,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=26, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=20, PETRI_TRANSITIONS=13} [2023-09-01 00:25:22,837 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 2 predicate places. [2023-09-01 00:25:22,837 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 13 transitions, 44 flow [2023-09-01 00:25:22,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 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-09-01 00:25:22,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:25:22,838 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-09-01 00:25:22,848 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 (3)] Ended with exit code 0 [2023-09-01 00:25:23,046 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-09-01 00:25:23,047 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 2 more)] === [2023-09-01 00:25:23,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:25:23,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1603269868, now seen corresponding path program 1 times [2023-09-01 00:25:23,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 00:25:23,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [204987220] [2023-09-01 00:25:23,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:25:23,049 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-09-01 00:25:23,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 00:25:23,053 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-09-01 00:25:23,056 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-09-01 00:25:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:25:23,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2023-09-01 00:25:23,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 00:25:23,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:25:23,205 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 00:25:23,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 00:25:23,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [204987220] [2023-09-01 00:25:23,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [204987220] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:25:23,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:25:23,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 00:25:23,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096538566] [2023-09-01 00:25:23,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:25:23,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 00:25:23,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 00:25:23,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 00:25:23,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 00:25:23,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 125 [2023-09-01 00:25:23,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 13 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 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-09-01 00:25:23,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:25:23,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 125 [2023-09-01 00:25:23,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:25:23,296 INFO L130 PetriNetUnfolder]: 10/35 cut-off events. [2023-09-01 00:25:23,296 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2023-09-01 00:25:23,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 35 events. 10/35 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 10 based on Foata normal form. 5/39 useless extension candidates. Maximal degree in co-relation 76. Up to 29 conditions per place. [2023-09-01 00:25:23,297 INFO L137 encePairwiseOnDemand]: 123/125 looper letters, 8 selfloop transitions, 1 changer transitions 0/11 dead transitions. [2023-09-01 00:25:23,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 11 transitions, 52 flow [2023-09-01 00:25:23,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 00:25:23,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 00:25:23,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2023-09-01 00:25:23,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49866666666666665 [2023-09-01 00:25:23,299 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 187 transitions. [2023-09-01 00:25:23,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 187 transitions. [2023-09-01 00:25:23,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:25:23,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 187 transitions. [2023-09-01 00:25:23,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 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-09-01 00:25:23,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 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-09-01 00:25:23,301 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 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-09-01 00:25:23,302 INFO L175 Difference]: Start difference. First operand has 20 places, 13 transitions, 44 flow. Second operand 3 states and 187 transitions. [2023-09-01 00:25:23,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 11 transitions, 52 flow [2023-09-01 00:25:23,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 11 transitions, 46 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-09-01 00:25:23,302 INFO L231 Difference]: Finished difference. Result has 18 places, 11 transitions, 30 flow [2023-09-01 00:25:23,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=28, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=11, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=30, PETRI_PLACES=18, PETRI_TRANSITIONS=11} [2023-09-01 00:25:23,303 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 0 predicate places. [2023-09-01 00:25:23,303 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 11 transitions, 30 flow [2023-09-01 00:25:23,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 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-09-01 00:25:23,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:25:23,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 00:25:23,317 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-09-01 00:25:23,504 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-09-01 00:25:23,505 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 2 more)] === [2023-09-01 00:25:23,505 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:25:23,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1091075141, now seen corresponding path program 1 times [2023-09-01 00:25:23,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 00:25:23,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2102041073] [2023-09-01 00:25:23,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:25:23,506 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-09-01 00:25:23,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 00:25:23,507 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-09-01 00:25:23,509 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-09-01 00:25:23,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:25:23,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2023-09-01 00:25:23,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 00:25:23,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-09-01 00:25:23,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:25:23,616 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 00:25:23,616 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 00:25:23,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2102041073] [2023-09-01 00:25:23,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2102041073] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:25:23,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:25:23,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 00:25:23,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365976900] [2023-09-01 00:25:23,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:25:23,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 00:25:23,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 00:25:23,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 00:25:23,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 00:25:23,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 125 [2023-09-01 00:25:23,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 11 transitions, 30 flow. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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-09-01 00:25:23,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:25:23,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 125 [2023-09-01 00:25:23,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:25:23,709 INFO L130 PetriNetUnfolder]: 6/30 cut-off events. [2023-09-01 00:25:23,709 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-09-01 00:25:23,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 30 events. 6/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 50 event pairs, 2 based on Foata normal form. 4/34 useless extension candidates. Maximal degree in co-relation 66. Up to 18 conditions per place. [2023-09-01 00:25:23,710 INFO L137 encePairwiseOnDemand]: 120/125 looper letters, 9 selfloop transitions, 5 changer transitions 0/15 dead transitions. [2023-09-01 00:25:23,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 15 transitions, 68 flow [2023-09-01 00:25:23,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 00:25:23,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 00:25:23,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 190 transitions. [2023-09-01 00:25:23,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5066666666666667 [2023-09-01 00:25:23,711 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 190 transitions. [2023-09-01 00:25:23,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 190 transitions. [2023-09-01 00:25:23,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:25:23,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 190 transitions. [2023-09-01 00:25:23,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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-09-01 00:25:23,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 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-09-01 00:25:23,715 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 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-09-01 00:25:23,715 INFO L175 Difference]: Start difference. First operand has 18 places, 11 transitions, 30 flow. Second operand 3 states and 190 transitions. [2023-09-01 00:25:23,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 15 transitions, 68 flow [2023-09-01 00:25:23,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 15 transitions, 67 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 00:25:23,716 INFO L231 Difference]: Finished difference. Result has 20 places, 13 transitions, 52 flow [2023-09-01 00:25:23,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=29, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=11, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=20, PETRI_TRANSITIONS=13} [2023-09-01 00:25:23,718 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 2 predicate places. [2023-09-01 00:25:23,718 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 13 transitions, 52 flow [2023-09-01 00:25:23,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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-09-01 00:25:23,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:25:23,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 00:25:23,731 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-09-01 00:25:23,927 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-09-01 00:25:23,928 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 2 more)] === [2023-09-01 00:25:23,928 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:25:23,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1317736601, now seen corresponding path program 2 times [2023-09-01 00:25:23,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 00:25:23,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926454903] [2023-09-01 00:25:23,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 00:25:23,929 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-09-01 00:25:23,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 00:25:23,930 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-09-01 00:25:23,931 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-09-01 00:25:23,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-09-01 00:25:23,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 00:25:23,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjunts are in the unsatisfiable core [2023-09-01 00:25:23,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 00:25:24,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-09-01 00:25:24,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-09-01 00:25:24,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-09-01 00:25:24,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:25:24,096 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 00:25:24,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 00:25:24,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [926454903] [2023-09-01 00:25:24,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [926454903] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:25:24,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:25:24,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 00:25:24,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066398123] [2023-09-01 00:25:24,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:25:24,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 00:25:24,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 00:25:24,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 00:25:24,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-09-01 00:25:24,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 125 [2023-09-01 00:25:24,205 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 13 transitions, 52 flow. Second operand has 5 states, 5 states have (on average 58.6) internal successors, (293), 5 states have internal predecessors, (293), 0 states have call successors, (0), 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-09-01 00:25:24,205 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:25:24,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 125 [2023-09-01 00:25:24,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:25:24,265 INFO L130 PetriNetUnfolder]: 4/25 cut-off events. [2023-09-01 00:25:24,265 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-09-01 00:25:24,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 25 events. 4/25 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 36 event pairs, 0 based on Foata normal form. 1/26 useless extension candidates. Maximal degree in co-relation 76. Up to 15 conditions per place. [2023-09-01 00:25:24,265 INFO L137 encePairwiseOnDemand]: 121/125 looper letters, 10 selfloop transitions, 4 changer transitions 1/16 dead transitions. [2023-09-01 00:25:24,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 16 transitions, 96 flow [2023-09-01 00:25:24,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 00:25:24,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 00:25:24,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 241 transitions. [2023-09-01 00:25:24,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.482 [2023-09-01 00:25:24,270 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 241 transitions. [2023-09-01 00:25:24,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 241 transitions. [2023-09-01 00:25:24,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:25:24,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 241 transitions. [2023-09-01 00:25:24,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 60.25) internal successors, (241), 4 states have internal predecessors, (241), 0 states have call successors, (0), 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-09-01 00:25:24,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 0 states have call successors, (0), 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-09-01 00:25:24,273 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 0 states have call successors, (0), 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-09-01 00:25:24,273 INFO L175 Difference]: Start difference. First operand has 20 places, 13 transitions, 52 flow. Second operand 4 states and 241 transitions. [2023-09-01 00:25:24,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 16 transitions, 96 flow [2023-09-01 00:25:24,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 16 transitions, 89 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 00:25:24,274 INFO L231 Difference]: Finished difference. Result has 22 places, 13 transitions, 55 flow [2023-09-01 00:25:24,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=47, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=55, PETRI_PLACES=22, PETRI_TRANSITIONS=13} [2023-09-01 00:25:24,275 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 4 predicate places. [2023-09-01 00:25:24,275 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 13 transitions, 55 flow [2023-09-01 00:25:24,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 58.6) internal successors, (293), 5 states have internal predecessors, (293), 0 states have call successors, (0), 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-09-01 00:25:24,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:25:24,276 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 00:25:24,290 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-09-01 00:25:24,490 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-09-01 00:25:24,491 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 2 more)] === [2023-09-01 00:25:24,491 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:25:24,491 INFO L85 PathProgramCache]: Analyzing trace with hash -585701404, now seen corresponding path program 1 times [2023-09-01 00:25:24,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 00:25:24,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [63958437] [2023-09-01 00:25:24,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:25:24,492 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-09-01 00:25:24,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 00:25:24,493 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-09-01 00:25:24,493 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-09-01 00:25:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 00:25:24,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2023-09-01 00:25:24,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 00:25:24,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-09-01 00:25:24,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-09-01 00:25:24,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-09-01 00:25:24,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 00:25:24,641 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 00:25:24,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 00:25:24,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [63958437] [2023-09-01 00:25:24,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [63958437] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 00:25:24,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 00:25:24,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 00:25:24,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606629964] [2023-09-01 00:25:24,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 00:25:24,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 00:25:24,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 00:25:24,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 00:25:24,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-09-01 00:25:24,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 125 [2023-09-01 00:25:24,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 13 transitions, 55 flow. Second operand has 5 states, 5 states have (on average 58.8) internal successors, (294), 5 states have internal predecessors, (294), 0 states have call successors, (0), 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-09-01 00:25:24,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 00:25:24,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 125 [2023-09-01 00:25:24,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 00:25:24,764 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2023-09-01 00:25:24,764 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-09-01 00:25:24,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 15 events. 0/15 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 7 event pairs, 0 based on Foata normal form. 1/16 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2023-09-01 00:25:24,764 INFO L137 encePairwiseOnDemand]: 120/125 looper letters, 5 selfloop transitions, 5 changer transitions 0/11 dead transitions. [2023-09-01 00:25:24,764 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 11 transitions, 67 flow [2023-09-01 00:25:24,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 00:25:24,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 00:25:24,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2023-09-01 00:25:24,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.478 [2023-09-01 00:25:24,766 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 239 transitions. [2023-09-01 00:25:24,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 239 transitions. [2023-09-01 00:25:24,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 00:25:24,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 239 transitions. [2023-09-01 00:25:24,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 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-09-01 00:25:24,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 0 states have call successors, (0), 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-09-01 00:25:24,768 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 0 states have call successors, (0), 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-09-01 00:25:24,768 INFO L175 Difference]: Start difference. First operand has 22 places, 13 transitions, 55 flow. Second operand 4 states and 239 transitions. [2023-09-01 00:25:24,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 11 transitions, 67 flow [2023-09-01 00:25:24,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 11 transitions, 57 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-09-01 00:25:24,770 INFO L231 Difference]: Finished difference. Result has 22 places, 11 transitions, 47 flow [2023-09-01 00:25:24,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=37, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=11, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=47, PETRI_PLACES=22, PETRI_TRANSITIONS=11} [2023-09-01 00:25:24,770 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 4 predicate places. [2023-09-01 00:25:24,771 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 11 transitions, 47 flow [2023-09-01 00:25:24,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 58.8) internal successors, (294), 5 states have internal predecessors, (294), 0 states have call successors, (0), 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-09-01 00:25:24,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 00:25:24,771 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 00:25:24,783 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-09-01 00:25:24,980 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-09-01 00:25:24,980 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 2 more)] === [2023-09-01 00:25:24,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 00:25:24,981 INFO L85 PathProgramCache]: Analyzing trace with hash -985572062, now seen corresponding path program 1 times [2023-09-01 00:25:24,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 00:25:24,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66667903] [2023-09-01 00:25:24,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 00:25:24,981 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-09-01 00:25:24,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 00:25:24,983 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-09-01 00:25:24,985 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-09-01 00:25:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 00:25:25,048 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 00:25:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 00:25:25,112 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-09-01 00:25:25,113 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 00:25:25,113 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2023-09-01 00:25:25,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-09-01 00:25:25,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-09-01 00:25:25,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (1 of 5 remaining) [2023-09-01 00:25:25,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2023-09-01 00:25:25,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-09-01 00:25:25,316 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-09-01 00:25:25,316 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-09-01 00:25:25,320 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 00:25:25,320 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 00:25:25,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 12:25:25 BasicIcfg [2023-09-01 00:25:25,352 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 00:25:25,353 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 00:25:25,353 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 00:25:25,353 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 00:25:25,354 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 12:25:18" (3/4) ... [2023-09-01 00:25:25,356 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-09-01 00:25:25,356 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 00:25:25,359 INFO L158 Benchmark]: Toolchain (without parser) took 8260.82ms. Allocated memory was 81.8MB in the beginning and 100.7MB in the end (delta: 18.9MB). Free memory was 57.0MB in the beginning and 72.4MB in the end (delta: -15.4MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. [2023-09-01 00:25:25,359 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 58.7MB. Free memory is still 36.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 00:25:25,360 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.59ms. Allocated memory is still 81.8MB. Free memory was 56.8MB in the beginning and 55.3MB in the end (delta: 1.4MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2023-09-01 00:25:25,360 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.77ms. Allocated memory is still 81.8MB. Free memory was 55.3MB in the beginning and 53.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 00:25:25,360 INFO L158 Benchmark]: Boogie Preprocessor took 47.25ms. Allocated memory is still 81.8MB. Free memory was 53.2MB in the beginning and 51.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 00:25:25,361 INFO L158 Benchmark]: RCFGBuilder took 468.08ms. Allocated memory is still 81.8MB. Free memory was 51.6MB in the beginning and 36.9MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-09-01 00:25:25,361 INFO L158 Benchmark]: TraceAbstraction took 7198.69ms. Allocated memory was 81.8MB in the beginning and 100.7MB in the end (delta: 18.9MB). Free memory was 36.5MB in the beginning and 72.4MB in the end (delta: -35.9MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. [2023-09-01 00:25:25,363 INFO L158 Benchmark]: Witness Printer took 3.22ms. Allocated memory is still 100.7MB. Free memory is still 72.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 00:25:25,366 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.12ms. Allocated memory is still 58.7MB. Free memory is still 36.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 478.59ms. Allocated memory is still 81.8MB. Free memory was 56.8MB in the beginning and 55.3MB in the end (delta: 1.4MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.77ms. Allocated memory is still 81.8MB. Free memory was 55.3MB in the beginning and 53.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.25ms. Allocated memory is still 81.8MB. Free memory was 53.2MB in the beginning and 51.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 468.08ms. Allocated memory is still 81.8MB. Free memory was 51.6MB in the beginning and 36.9MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7198.69ms. Allocated memory was 81.8MB in the beginning and 100.7MB in the end (delta: 18.9MB). Free memory was 36.5MB in the beginning and 72.4MB in the end (delta: -35.9MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. * Witness Printer took 3.22ms. Allocated memory is still 100.7MB. Free memory is still 72.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 65 PlacesBefore, 18 PlacesAfterwards, 62 TransitionsBefore, 15 TransitionsAfterwards, 380 CoEnabledTransitionPairs, 6 FixpointIterations, 33 TrivialSequentialCompositions, 19 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 58 TotalNumberOfCompositions, 967 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 441, independent: 337, independent conditional: 0, independent unconditional: 337, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 231, independent: 210, independent conditional: 0, independent unconditional: 210, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 441, independent: 127, independent conditional: 0, independent unconditional: 127, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 231, unknown conditional: 0, unknown unconditional: 231] , Statistics on independence cache: Total cache size (in pairs): 22, Positive cache size: 12, Positive conditional cache size: 0, Positive unconditional cache size: 12, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L681] 0 int g = 0; [L682] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t D = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L693] 0 pthread_t id; [L694] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [A={3:0}, D={4:0}, arg={0:0}, g=0, id={7:0}, pthread_create(&id, ((void *)0), t_fun, ((void *)0))=0] [L687] 1 g = 17 VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17] [L690] 1 return ((void *)0); [L698] CALL 0 __VERIFIER_assert(g == 0) [L19] COND TRUE 0 !(cond) [L19] 0 reach_error() VAL [A={3:0}, D={4:0}, \old(cond)=0, \result={0:0}, arg={0:0}, arg={0:0}, cond=0, g=17] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 79 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.1s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 231 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 106 mSDsluCounter, 50 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 357 IncrementalHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 37 mSDtfsCounter, 357 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=5, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 52 NumberOfCodeBlocks, 52 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 35 ConstructedInterpolants, 5 QuantifiedInterpolants, 242 SizeOfPredicates, 2 NumberOfNonLiveVariables, 371 ConjunctsInSsa, 31 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-09-01 00:25:25,391 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