./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix000.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --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/pthread-wmm/mix000.opt.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 fd6a5bc5d3f013f4ace97b77d830608c8280eaa5bc8f461c3acae231027617e4 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:11:01,607 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:11:01,609 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:11:01,633 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:11:01,634 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:11:01,635 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:11:01,636 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:11:01,637 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:11:01,638 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:11:01,639 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:11:01,640 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:11:01,641 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:11:01,641 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:11:01,642 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:11:01,643 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:11:01,644 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:11:01,645 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:11:01,645 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:11:01,647 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:11:01,648 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:11:01,650 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:11:01,651 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:11:01,652 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:11:01,653 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:11:01,656 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:11:01,657 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:11:01,657 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:11:01,658 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:11:01,658 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:11:01,659 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:11:01,659 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:11:01,660 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:11:01,661 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:11:01,661 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:11:01,662 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:11:01,662 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:11:01,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:11:01,663 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:11:01,663 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:11:01,664 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:11:01,665 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:11:01,666 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 20:11:01,689 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:11:01,690 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:11:01,691 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:11:01,691 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:11:01,692 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:11:01,692 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:11:01,694 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:11:01,694 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:11:01,694 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:11:01,694 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:11:01,695 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:11:01,695 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:11:01,696 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:11:01,696 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:11:01,696 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:11:01,696 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:11:01,696 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:11:01,697 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:11:01,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:11:01,697 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:11:01,697 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:11:01,697 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:11:01,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:11:01,698 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:11:01,698 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:11:01,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:11:01,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:11:01,699 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:11:01,699 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:11:01,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:11:01,699 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:11:01,699 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:11:01,700 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:11:01,700 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:11:01,700 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 -> fd6a5bc5d3f013f4ace97b77d830608c8280eaa5bc8f461c3acae231027617e4 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 -> AFTER [2023-08-29 20:11:02,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:11:02,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:11:02,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:11:02,070 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:11:02,071 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:11:02,072 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000.opt.i [2023-08-29 20:11:03,202 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:11:03,436 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:11:03,437 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.opt.i [2023-08-29 20:11:03,447 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/187b919e8/18defc9a5db84d6facc95d64e6e293fe/FLAGda084d917 [2023-08-29 20:11:03,460 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/187b919e8/18defc9a5db84d6facc95d64e6e293fe [2023-08-29 20:11:03,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:11:03,463 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:11:03,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:11:03,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:11:03,467 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:11:03,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:11:03" (1/1) ... [2023-08-29 20:11:03,468 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cc339d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:03, skipping insertion in model container [2023-08-29 20:11:03,468 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:11:03" (1/1) ... [2023-08-29 20:11:03,474 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:11:03,509 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:11:03,671 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.opt.i[987,1000] [2023-08-29 20:11:03,893 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:11:03,904 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:11:03,930 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.opt.i[987,1000] [2023-08-29 20:11:03,996 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:11:04,035 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:11:04,036 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:11:04,041 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:11:04,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:04 WrapperNode [2023-08-29 20:11:04,042 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:11:04,043 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:11:04,043 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:11:04,044 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:11:04,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:04" (1/1) ... [2023-08-29 20:11:04,078 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:04" (1/1) ... [2023-08-29 20:11:04,114 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2023-08-29 20:11:04,115 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:11:04,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:11:04,116 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:11:04,116 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:11:04,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:04" (1/1) ... [2023-08-29 20:11:04,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:04" (1/1) ... [2023-08-29 20:11:04,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:04" (1/1) ... [2023-08-29 20:11:04,141 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:04" (1/1) ... [2023-08-29 20:11:04,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:04" (1/1) ... [2023-08-29 20:11:04,159 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:04" (1/1) ... [2023-08-29 20:11:04,161 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:04" (1/1) ... [2023-08-29 20:11:04,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:04" (1/1) ... [2023-08-29 20:11:04,171 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:11:04,173 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:11:04,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:11:04,174 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:11:04,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:04" (1/1) ... [2023-08-29 20:11:04,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:11:04,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:11:04,205 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-08-29 20:11:04,228 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-08-29 20:11:04,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:11:04,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:11:04,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:11:04,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:11:04,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:11:04,243 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:11:04,243 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:11:04,243 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:11:04,243 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:11:04,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:11:04,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:11:04,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:11:04,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:11:04,245 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:11:04,408 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:11:04,409 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:11:04,717 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:11:04,818 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:11:04,818 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:11:04,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:11:04 BoogieIcfgContainer [2023-08-29 20:11:04,820 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:11:04,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:11:04,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:11:04,825 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:11:04,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:11:03" (1/3) ... [2023-08-29 20:11:04,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@386b09e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:11:04, skipping insertion in model container [2023-08-29 20:11:04,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:04" (2/3) ... [2023-08-29 20:11:04,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@386b09e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:11:04, skipping insertion in model container [2023-08-29 20:11:04,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:11:04" (3/3) ... [2023-08-29 20:11:04,827 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000.opt.i [2023-08-29 20:11:04,841 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:11:04,842 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-08-29 20:11:04,842 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:11:04,886 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:11:04,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 99 transitions, 208 flow [2023-08-29 20:11:04,948 INFO L130 PetriNetUnfolder]: 2/97 cut-off events. [2023-08-29 20:11:04,949 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:11:04,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-08-29 20:11:04,954 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 99 transitions, 208 flow [2023-08-29 20:11:04,958 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 97 transitions, 200 flow [2023-08-29 20:11:04,961 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:11:04,968 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 97 transitions, 200 flow [2023-08-29 20:11:04,970 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 97 transitions, 200 flow [2023-08-29 20:11:04,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 97 transitions, 200 flow [2023-08-29 20:11:05,002 INFO L130 PetriNetUnfolder]: 2/97 cut-off events. [2023-08-29 20:11:05,003 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:11:05,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-08-29 20:11:05,005 INFO L119 LiptonReduction]: Number of co-enabled transitions 1212 [2023-08-29 20:11:08,535 INFO L134 LiptonReduction]: Checked pairs total: 3322 [2023-08-29 20:11:08,536 INFO L136 LiptonReduction]: Total number of compositions: 101 [2023-08-29 20:11:08,549 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:11:08,554 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;@1f8a7e0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:11:08,555 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-08-29 20:11:08,556 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:11:08,556 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:11:08,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:11:08,557 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:11:08,557 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:11:08,561 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:11:08,562 INFO L85 PathProgramCache]: Analyzing trace with hash 475, now seen corresponding path program 1 times [2023-08-29 20:11:08,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:11:08,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489185173] [2023-08-29 20:11:08,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:11:08,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:11:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:11:08,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:11:08,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:11:08,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489185173] [2023-08-29 20:11:08,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489185173] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:11:08,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:11:08,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:11:08,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780316493] [2023-08-29 20:11:08,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:11:08,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:11:08,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:11:08,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:11:08,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:11:08,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 200 [2023-08-29 20:11:08,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 52 flow. Second operand has 2 states, 2 states have (on average 88.5) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 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-08-29 20:11:08,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:11:08,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 200 [2023-08-29 20:11:08,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:11:08,811 INFO L130 PetriNetUnfolder]: 211/377 cut-off events. [2023-08-29 20:11:08,811 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-29 20:11:08,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 755 conditions, 377 events. 211/377 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1551 event pairs, 211 based on Foata normal form. 0/292 useless extension candidates. Maximal degree in co-relation 745. Up to 365 conditions per place. [2023-08-29 20:11:08,815 INFO L137 encePairwiseOnDemand]: 196/200 looper letters, 17 selfloop transitions, 0 changer transitions 0/19 dead transitions. [2023-08-29 20:11:08,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 19 transitions, 78 flow [2023-08-29 20:11:08,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:11:08,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:11:08,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 197 transitions. [2023-08-29 20:11:08,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4925 [2023-08-29 20:11:08,827 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 197 transitions. [2023-08-29 20:11:08,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 197 transitions. [2023-08-29 20:11:08,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:11:08,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 197 transitions. [2023-08-29 20:11:08,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 98.5) internal successors, (197), 2 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:11:08,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 0 states have call successors, (0), 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-08-29 20:11:08,838 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 0 states have call successors, (0), 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-08-29 20:11:08,839 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 52 flow. Second operand 2 states and 197 transitions. [2023-08-29 20:11:08,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 19 transitions, 78 flow [2023-08-29 20:11:08,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 19 transitions, 76 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:11:08,843 INFO L231 Difference]: Finished difference. Result has 25 places, 19 transitions, 42 flow [2023-08-29 20:11:08,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=42, PETRI_PLACES=25, PETRI_TRANSITIONS=19} [2023-08-29 20:11:08,847 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -5 predicate places. [2023-08-29 20:11:08,848 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 42 flow [2023-08-29 20:11:08,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 88.5) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 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-08-29 20:11:08,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:11:08,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 20:11:08,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:11:08,849 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:11:08,849 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:11:08,850 INFO L85 PathProgramCache]: Analyzing trace with hash 451154421, now seen corresponding path program 1 times [2023-08-29 20:11:08,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:11:08,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298023146] [2023-08-29 20:11:08,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:11:08,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:11:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:11:09,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:11:09,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:11:09,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298023146] [2023-08-29 20:11:09,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298023146] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:11:09,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:11:09,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:11:09,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360548876] [2023-08-29 20:11:09,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:11:09,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:11:09,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:11:09,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:11:09,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:11:09,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 200 [2023-08-29 20:11:09,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 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-08-29 20:11:09,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:11:09,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 200 [2023-08-29 20:11:09,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:11:09,240 INFO L130 PetriNetUnfolder]: 173/327 cut-off events. [2023-08-29 20:11:09,240 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:11:09,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 327 events. 173/327 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1385 event pairs, 21 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 639. Up to 249 conditions per place. [2023-08-29 20:11:09,245 INFO L137 encePairwiseOnDemand]: 197/200 looper letters, 20 selfloop transitions, 2 changer transitions 2/26 dead transitions. [2023-08-29 20:11:09,245 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 26 transitions, 104 flow [2023-08-29 20:11:09,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:11:09,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:11:09,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2023-08-29 20:11:09,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4766666666666667 [2023-08-29 20:11:09,252 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 286 transitions. [2023-08-29 20:11:09,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 286 transitions. [2023-08-29 20:11:09,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:11:09,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 286 transitions. [2023-08-29 20:11:09,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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-08-29 20:11:09,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 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-08-29 20:11:09,258 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 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-08-29 20:11:09,258 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 42 flow. Second operand 3 states and 286 transitions. [2023-08-29 20:11:09,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 26 transitions, 104 flow [2023-08-29 20:11:09,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 26 transitions, 104 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:11:09,260 INFO L231 Difference]: Finished difference. Result has 26 places, 17 transitions, 42 flow [2023-08-29 20:11:09,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=26, PETRI_TRANSITIONS=17} [2023-08-29 20:11:09,261 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -4 predicate places. [2023-08-29 20:11:09,261 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 17 transitions, 42 flow [2023-08-29 20:11:09,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 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-08-29 20:11:09,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:11:09,262 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:11:09,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:11:09,262 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:11:09,264 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:11:09,264 INFO L85 PathProgramCache]: Analyzing trace with hash -232246113, now seen corresponding path program 1 times [2023-08-29 20:11:09,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:11:09,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728946436] [2023-08-29 20:11:09,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:11:09,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:11:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:11:09,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:11:09,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:11:09,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728946436] [2023-08-29 20:11:09,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728946436] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:11:09,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:11:09,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:11:09,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392233567] [2023-08-29 20:11:09,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:11:09,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:11:09,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:11:09,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:11:09,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:11:09,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 200 [2023-08-29 20:11:09,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 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-08-29 20:11:09,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:11:09,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 200 [2023-08-29 20:11:09,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:11:09,608 INFO L130 PetriNetUnfolder]: 231/414 cut-off events. [2023-08-29 20:11:09,609 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2023-08-29 20:11:09,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 871 conditions, 414 events. 231/414 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1603 event pairs, 88 based on Foata normal form. 0/388 useless extension candidates. Maximal degree in co-relation 867. Up to 330 conditions per place. [2023-08-29 20:11:09,611 INFO L137 encePairwiseOnDemand]: 193/200 looper letters, 25 selfloop transitions, 6 changer transitions 0/31 dead transitions. [2023-08-29 20:11:09,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 31 transitions, 136 flow [2023-08-29 20:11:09,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:11:09,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:11:09,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2023-08-29 20:11:09,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4633333333333333 [2023-08-29 20:11:09,613 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 278 transitions. [2023-08-29 20:11:09,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 278 transitions. [2023-08-29 20:11:09,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:11:09,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 278 transitions. [2023-08-29 20:11:09,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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-08-29 20:11:09,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 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-08-29 20:11:09,616 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 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-08-29 20:11:09,616 INFO L175 Difference]: Start difference. First operand has 26 places, 17 transitions, 42 flow. Second operand 3 states and 278 transitions. [2023-08-29 20:11:09,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 31 transitions, 136 flow [2023-08-29 20:11:09,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 31 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:11:09,618 INFO L231 Difference]: Finished difference. Result has 27 places, 22 transitions, 84 flow [2023-08-29 20:11:09,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=27, PETRI_TRANSITIONS=22} [2023-08-29 20:11:09,619 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2023-08-29 20:11:09,619 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 22 transitions, 84 flow [2023-08-29 20:11:09,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 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-08-29 20:11:09,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:11:09,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:11:09,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:11:09,620 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:11:09,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:11:09,620 INFO L85 PathProgramCache]: Analyzing trace with hash -232246103, now seen corresponding path program 1 times [2023-08-29 20:11:09,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:11:09,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599174404] [2023-08-29 20:11:09,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:11:09,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:11:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:11:09,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:11:09,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:11:09,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599174404] [2023-08-29 20:11:09,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599174404] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:11:09,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:11:09,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:11:09,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828746660] [2023-08-29 20:11:09,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:11:09,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:11:09,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:11:09,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:11:09,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:11:09,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 200 [2023-08-29 20:11:09,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 22 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 0 states have call successors, (0), 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-08-29 20:11:09,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:11:09,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 200 [2023-08-29 20:11:09,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:11:10,028 INFO L130 PetriNetUnfolder]: 134/254 cut-off events. [2023-08-29 20:11:10,029 INFO L131 PetriNetUnfolder]: For 100/106 co-relation queries the response was YES. [2023-08-29 20:11:10,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 602 conditions, 254 events. 134/254 cut-off events. For 100/106 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 892 event pairs, 59 based on Foata normal form. 36/290 useless extension candidates. Maximal degree in co-relation 597. Up to 220 conditions per place. [2023-08-29 20:11:10,033 INFO L137 encePairwiseOnDemand]: 197/200 looper letters, 16 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2023-08-29 20:11:10,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 21 transitions, 106 flow [2023-08-29 20:11:10,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:11:10,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:11:10,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 330 transitions. [2023-08-29 20:11:10,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4125 [2023-08-29 20:11:10,035 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 330 transitions. [2023-08-29 20:11:10,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 330 transitions. [2023-08-29 20:11:10,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:11:10,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 330 transitions. [2023-08-29 20:11:10,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 82.5) internal successors, (330), 4 states have internal predecessors, (330), 0 states have call successors, (0), 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-08-29 20:11:10,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 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-08-29 20:11:10,042 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 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-08-29 20:11:10,042 INFO L175 Difference]: Start difference. First operand has 27 places, 22 transitions, 84 flow. Second operand 4 states and 330 transitions. [2023-08-29 20:11:10,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 21 transitions, 106 flow [2023-08-29 20:11:10,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 21 transitions, 100 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:11:10,044 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 60 flow [2023-08-29 20:11:10,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=60, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2023-08-29 20:11:10,046 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2023-08-29 20:11:10,046 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 60 flow [2023-08-29 20:11:10,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 0 states have call successors, (0), 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-08-29 20:11:10,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:11:10,046 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:11:10,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:11:10,047 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:11:10,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:11:10,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1454016043, now seen corresponding path program 1 times [2023-08-29 20:11:10,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:11:10,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639806048] [2023-08-29 20:11:10,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:11:10,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:11:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:11:10,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:11:10,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:11:10,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639806048] [2023-08-29 20:11:10,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639806048] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:11:10,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:11:10,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:11:10,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899137836] [2023-08-29 20:11:10,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:11:10,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:11:10,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:11:10,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:11:10,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:11:10,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 200 [2023-08-29 20:11:10,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 0 states have call successors, (0), 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-08-29 20:11:10,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:11:10,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 200 [2023-08-29 20:11:10,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:11:10,282 INFO L130 PetriNetUnfolder]: 157/278 cut-off events. [2023-08-29 20:11:10,282 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2023-08-29 20:11:10,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 683 conditions, 278 events. 157/278 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 877 event pairs, 53 based on Foata normal form. 6/284 useless extension candidates. Maximal degree in co-relation 678. Up to 200 conditions per place. [2023-08-29 20:11:10,284 INFO L137 encePairwiseOnDemand]: 197/200 looper letters, 20 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2023-08-29 20:11:10,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 23 transitions, 118 flow [2023-08-29 20:11:10,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:11:10,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:11:10,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 269 transitions. [2023-08-29 20:11:10,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4483333333333333 [2023-08-29 20:11:10,286 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 269 transitions. [2023-08-29 20:11:10,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 269 transitions. [2023-08-29 20:11:10,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:11:10,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 269 transitions. [2023-08-29 20:11:10,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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-08-29 20:11:10,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 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-08-29 20:11:10,289 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 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-08-29 20:11:10,289 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 60 flow. Second operand 3 states and 269 transitions. [2023-08-29 20:11:10,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 23 transitions, 118 flow [2023-08-29 20:11:10,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 23 transitions, 115 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:11:10,292 INFO L231 Difference]: Finished difference. Result has 28 places, 18 transitions, 68 flow [2023-08-29 20:11:10,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=28, PETRI_TRANSITIONS=18} [2023-08-29 20:11:10,294 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -2 predicate places. [2023-08-29 20:11:10,294 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 18 transitions, 68 flow [2023-08-29 20:11:10,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 0 states have call successors, (0), 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-08-29 20:11:10,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:11:10,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:11:10,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:11:10,296 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:11:10,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:11:10,297 INFO L85 PathProgramCache]: Analyzing trace with hash 147559400, now seen corresponding path program 1 times [2023-08-29 20:11:10,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:11:10,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564182018] [2023-08-29 20:11:10,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:11:10,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:11:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:11:10,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:11:10,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:11:10,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564182018] [2023-08-29 20:11:10,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564182018] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:11:10,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:11:10,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:11:10,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116216113] [2023-08-29 20:11:10,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:11:10,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:11:10,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:11:10,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:11:10,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:11:10,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 200 [2023-08-29 20:11:10,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 18 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 0 states have call successors, (0), 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-08-29 20:11:10,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:11:10,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 200 [2023-08-29 20:11:10,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:11:10,661 INFO L130 PetriNetUnfolder]: 143/256 cut-off events. [2023-08-29 20:11:10,661 INFO L131 PetriNetUnfolder]: For 80/80 co-relation queries the response was YES. [2023-08-29 20:11:10,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 668 conditions, 256 events. 143/256 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 813 event pairs, 80 based on Foata normal form. 8/264 useless extension candidates. Maximal degree in co-relation 662. Up to 177 conditions per place. [2023-08-29 20:11:10,663 INFO L137 encePairwiseOnDemand]: 197/200 looper letters, 23 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2023-08-29 20:11:10,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 26 transitions, 141 flow [2023-08-29 20:11:10,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:11:10,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:11:10,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 272 transitions. [2023-08-29 20:11:10,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4533333333333333 [2023-08-29 20:11:10,665 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 272 transitions. [2023-08-29 20:11:10,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 272 transitions. [2023-08-29 20:11:10,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:11:10,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 272 transitions. [2023-08-29 20:11:10,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 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-08-29 20:11:10,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 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-08-29 20:11:10,668 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 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-08-29 20:11:10,668 INFO L175 Difference]: Start difference. First operand has 28 places, 18 transitions, 68 flow. Second operand 3 states and 272 transitions. [2023-08-29 20:11:10,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 26 transitions, 141 flow [2023-08-29 20:11:10,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 26 transitions, 135 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:11:10,670 INFO L231 Difference]: Finished difference. Result has 29 places, 18 transitions, 73 flow [2023-08-29 20:11:10,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=29, PETRI_TRANSITIONS=18} [2023-08-29 20:11:10,671 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2023-08-29 20:11:10,671 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 18 transitions, 73 flow [2023-08-29 20:11:10,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 0 states have call successors, (0), 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-08-29 20:11:10,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:11:10,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:11:10,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:11:10,672 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:11:10,672 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:11:10,672 INFO L85 PathProgramCache]: Analyzing trace with hash 918783402, now seen corresponding path program 1 times [2023-08-29 20:11:10,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:11:10,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185536042] [2023-08-29 20:11:10,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:11:10,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:11:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:11:10,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:11:10,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:11:10,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185536042] [2023-08-29 20:11:10,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185536042] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:11:10,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:11:10,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:11:10,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873596062] [2023-08-29 20:11:10,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:11:10,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:11:10,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:11:10,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:11:10,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:11:10,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 200 [2023-08-29 20:11:10,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 18 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 85.5) internal successors, (342), 4 states have internal predecessors, (342), 0 states have call successors, (0), 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-08-29 20:11:10,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:11:10,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 200 [2023-08-29 20:11:10,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:11:10,963 INFO L130 PetriNetUnfolder]: 68/156 cut-off events. [2023-08-29 20:11:10,963 INFO L131 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2023-08-29 20:11:10,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 156 events. 68/156 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 548 event pairs, 32 based on Foata normal form. 23/177 useless extension candidates. Maximal degree in co-relation 397. Up to 66 conditions per place. [2023-08-29 20:11:10,964 INFO L137 encePairwiseOnDemand]: 195/200 looper letters, 28 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2023-08-29 20:11:10,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 35 transitions, 184 flow [2023-08-29 20:11:10,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:11:10,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:11:10,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 365 transitions. [2023-08-29 20:11:10,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45625 [2023-08-29 20:11:10,966 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 365 transitions. [2023-08-29 20:11:10,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 365 transitions. [2023-08-29 20:11:10,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:11:10,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 365 transitions. [2023-08-29 20:11:10,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 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-08-29 20:11:10,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 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-08-29 20:11:10,969 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 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-08-29 20:11:10,969 INFO L175 Difference]: Start difference. First operand has 29 places, 18 transitions, 73 flow. Second operand 4 states and 365 transitions. [2023-08-29 20:11:10,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 35 transitions, 184 flow [2023-08-29 20:11:10,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 35 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:11:10,971 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 97 flow [2023-08-29 20:11:10,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-08-29 20:11:10,972 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2023-08-29 20:11:10,972 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 97 flow [2023-08-29 20:11:10,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.5) internal successors, (342), 4 states have internal predecessors, (342), 0 states have call successors, (0), 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-08-29 20:11:10,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:11:10,973 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:11:10,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:11:10,973 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:11:10,973 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:11:10,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1760546463, now seen corresponding path program 1 times [2023-08-29 20:11:10,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:11:10,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343273518] [2023-08-29 20:11:10,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:11:10,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:11:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:11:11,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:11:11,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:11:11,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343273518] [2023-08-29 20:11:11,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343273518] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:11:11,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:11:11,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:11:11,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075403406] [2023-08-29 20:11:11,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:11:11,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:11:11,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:11:11,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:11:11,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:11:11,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 200 [2023-08-29 20:11:11,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 97 flow. Second operand has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 0 states have call successors, (0), 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-08-29 20:11:11,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:11:11,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 200 [2023-08-29 20:11:11,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:11:11,424 INFO L130 PetriNetUnfolder]: 55/131 cut-off events. [2023-08-29 20:11:11,424 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2023-08-29 20:11:11,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 408 conditions, 131 events. 55/131 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 435 event pairs, 31 based on Foata normal form. 9/139 useless extension candidates. Maximal degree in co-relation 399. Up to 66 conditions per place. [2023-08-29 20:11:11,425 INFO L137 encePairwiseOnDemand]: 195/200 looper letters, 20 selfloop transitions, 6 changer transitions 0/29 dead transitions. [2023-08-29 20:11:11,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 29 transitions, 176 flow [2023-08-29 20:11:11,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:11:11,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:11:11,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2023-08-29 20:11:11,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.442 [2023-08-29 20:11:11,428 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 442 transitions. [2023-08-29 20:11:11,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 442 transitions. [2023-08-29 20:11:11,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:11:11,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 442 transitions. [2023-08-29 20:11:11,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 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-08-29 20:11:11,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 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-08-29 20:11:11,431 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 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-08-29 20:11:11,431 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 97 flow. Second operand 5 states and 442 transitions. [2023-08-29 20:11:11,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 29 transitions, 176 flow [2023-08-29 20:11:11,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 29 transitions, 160 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-29 20:11:11,433 INFO L231 Difference]: Finished difference. Result has 35 places, 22 transitions, 112 flow [2023-08-29 20:11:11,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2023-08-29 20:11:11,434 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2023-08-29 20:11:11,434 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 22 transitions, 112 flow [2023-08-29 20:11:11,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 0 states have call successors, (0), 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-08-29 20:11:11,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:11:11,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:11:11,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:11:11,435 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:11:11,435 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:11:11,436 INFO L85 PathProgramCache]: Analyzing trace with hash -889026928, now seen corresponding path program 1 times [2023-08-29 20:11:11,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:11:11,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028082301] [2023-08-29 20:11:11,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:11:11,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:11:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:11:11,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:11:11,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:11:11,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028082301] [2023-08-29 20:11:11,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028082301] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:11:11,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:11:11,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:11:11,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057261145] [2023-08-29 20:11:11,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:11:11,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:11:11,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:11:11,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:11:11,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:11:11,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 200 [2023-08-29 20:11:11,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 22 transitions, 112 flow. Second operand has 6 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 0 states have call successors, (0), 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-08-29 20:11:11,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:11:11,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 200 [2023-08-29 20:11:11,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:11:11,873 INFO L130 PetriNetUnfolder]: 95/211 cut-off events. [2023-08-29 20:11:11,873 INFO L131 PetriNetUnfolder]: For 337/337 co-relation queries the response was YES. [2023-08-29 20:11:11,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 211 events. 95/211 cut-off events. For 337/337 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 794 event pairs, 0 based on Foata normal form. 1/212 useless extension candidates. Maximal degree in co-relation 702. Up to 111 conditions per place. [2023-08-29 20:11:11,874 INFO L137 encePairwiseOnDemand]: 192/200 looper letters, 23 selfloop transitions, 14 changer transitions 18/55 dead transitions. [2023-08-29 20:11:11,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 55 transitions, 383 flow [2023-08-29 20:11:11,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:11:11,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:11:11,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 677 transitions. [2023-08-29 20:11:11,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.423125 [2023-08-29 20:11:11,877 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 677 transitions. [2023-08-29 20:11:11,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 677 transitions. [2023-08-29 20:11:11,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:11:11,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 677 transitions. [2023-08-29 20:11:11,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 84.625) internal successors, (677), 8 states have internal predecessors, (677), 0 states have call successors, (0), 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-08-29 20:11:11,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 200.0) internal successors, (1800), 9 states have internal predecessors, (1800), 0 states have call successors, (0), 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-08-29 20:11:11,882 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 200.0) internal successors, (1800), 9 states have internal predecessors, (1800), 0 states have call successors, (0), 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-08-29 20:11:11,882 INFO L175 Difference]: Start difference. First operand has 35 places, 22 transitions, 112 flow. Second operand 8 states and 677 transitions. [2023-08-29 20:11:11,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 55 transitions, 383 flow [2023-08-29 20:11:11,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 55 transitions, 365 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-29 20:11:11,886 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 171 flow [2023-08-29 20:11:11,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=171, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-08-29 20:11:11,888 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2023-08-29 20:11:11,888 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 171 flow [2023-08-29 20:11:11,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 0 states have call successors, (0), 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-08-29 20:11:11,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:11:11,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:11:11,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:11:11,889 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:11:11,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:11:11,889 INFO L85 PathProgramCache]: Analyzing trace with hash -278853518, now seen corresponding path program 2 times [2023-08-29 20:11:11,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:11:11,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262906217] [2023-08-29 20:11:11,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:11:11,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:11:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:11:12,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:11:12,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:11:12,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262906217] [2023-08-29 20:11:12,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262906217] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:11:12,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:11:12,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:11:12,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244928531] [2023-08-29 20:11:12,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:11:12,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:11:12,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:11:12,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:11:12,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:11:12,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 200 [2023-08-29 20:11:12,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 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-08-29 20:11:12,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:11:12,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 200 [2023-08-29 20:11:12,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:11:12,231 INFO L130 PetriNetUnfolder]: 30/97 cut-off events. [2023-08-29 20:11:12,231 INFO L131 PetriNetUnfolder]: For 143/147 co-relation queries the response was YES. [2023-08-29 20:11:12,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 97 events. 30/97 cut-off events. For 143/147 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 305 event pairs, 7 based on Foata normal form. 3/100 useless extension candidates. Maximal degree in co-relation 373. Up to 47 conditions per place. [2023-08-29 20:11:12,232 INFO L137 encePairwiseOnDemand]: 197/200 looper letters, 18 selfloop transitions, 1 changer transitions 21/41 dead transitions. [2023-08-29 20:11:12,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 41 transitions, 314 flow [2023-08-29 20:11:12,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:11:12,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:11:12,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 365 transitions. [2023-08-29 20:11:12,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45625 [2023-08-29 20:11:12,234 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 365 transitions. [2023-08-29 20:11:12,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 365 transitions. [2023-08-29 20:11:12,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:11:12,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 365 transitions. [2023-08-29 20:11:12,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 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-08-29 20:11:12,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 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-08-29 20:11:12,237 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 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-08-29 20:11:12,237 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 171 flow. Second operand 4 states and 365 transitions. [2023-08-29 20:11:12,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 41 transitions, 314 flow [2023-08-29 20:11:12,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 41 transitions, 259 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-08-29 20:11:12,239 INFO L231 Difference]: Finished difference. Result has 40 places, 18 transitions, 80 flow [2023-08-29 20:11:12,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=40, PETRI_TRANSITIONS=18} [2023-08-29 20:11:12,240 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2023-08-29 20:11:12,240 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 18 transitions, 80 flow [2023-08-29 20:11:12,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 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-08-29 20:11:12,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:11:12,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:11:12,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 20:11:12,241 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:11:12,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:11:12,241 INFO L85 PathProgramCache]: Analyzing trace with hash -205542926, now seen corresponding path program 3 times [2023-08-29 20:11:12,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:11:12,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556354919] [2023-08-29 20:11:12,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:11:12,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:11:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:11:13,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:11:13,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:11:13,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556354919] [2023-08-29 20:11:13,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556354919] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:11:13,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:11:13,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:11:13,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978378800] [2023-08-29 20:11:13,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:11:13,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:11:13,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:11:13,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:11:13,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:11:13,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 200 [2023-08-29 20:11:13,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 18 transitions, 80 flow. Second operand has 7 states, 7 states have (on average 85.0) internal successors, (595), 7 states have internal predecessors, (595), 0 states have call successors, (0), 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-08-29 20:11:13,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:11:13,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 200 [2023-08-29 20:11:13,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:11:13,334 INFO L130 PetriNetUnfolder]: 6/38 cut-off events. [2023-08-29 20:11:13,334 INFO L131 PetriNetUnfolder]: For 30/32 co-relation queries the response was YES. [2023-08-29 20:11:13,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 38 events. 6/38 cut-off events. For 30/32 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 72 event pairs, 0 based on Foata normal form. 1/39 useless extension candidates. Maximal degree in co-relation 119. Up to 13 conditions per place. [2023-08-29 20:11:13,335 INFO L137 encePairwiseOnDemand]: 193/200 looper letters, 12 selfloop transitions, 5 changer transitions 8/27 dead transitions. [2023-08-29 20:11:13,335 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 27 transitions, 167 flow [2023-08-29 20:11:13,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:11:13,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:11:13,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 686 transitions. [2023-08-29 20:11:13,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42875 [2023-08-29 20:11:13,339 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 686 transitions. [2023-08-29 20:11:13,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 686 transitions. [2023-08-29 20:11:13,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:11:13,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 686 transitions. [2023-08-29 20:11:13,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 85.75) internal successors, (686), 8 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:11:13,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 200.0) internal successors, (1800), 9 states have internal predecessors, (1800), 0 states have call successors, (0), 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-08-29 20:11:13,358 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 200.0) internal successors, (1800), 9 states have internal predecessors, (1800), 0 states have call successors, (0), 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-08-29 20:11:13,358 INFO L175 Difference]: Start difference. First operand has 40 places, 18 transitions, 80 flow. Second operand 8 states and 686 transitions. [2023-08-29 20:11:13,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 27 transitions, 167 flow [2023-08-29 20:11:13,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 27 transitions, 143 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-08-29 20:11:13,360 INFO L231 Difference]: Finished difference. Result has 39 places, 18 transitions, 77 flow [2023-08-29 20:11:13,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=77, PETRI_PLACES=39, PETRI_TRANSITIONS=18} [2023-08-29 20:11:13,361 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2023-08-29 20:11:13,361 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 18 transitions, 77 flow [2023-08-29 20:11:13,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 85.0) internal successors, (595), 7 states have internal predecessors, (595), 0 states have call successors, (0), 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-08-29 20:11:13,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:11:13,362 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:11:13,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 20:11:13,362 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:11:13,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:11:13,363 INFO L85 PathProgramCache]: Analyzing trace with hash -910376808, now seen corresponding path program 4 times [2023-08-29 20:11:13,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:11:13,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860146865] [2023-08-29 20:11:13,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:11:13,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:11:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:11:13,412 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:11:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:11:13,479 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:11:13,479 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:11:13,480 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-08-29 20:11:13,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-08-29 20:11:13,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-08-29 20:11:13,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-08-29 20:11:13,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-08-29 20:11:13,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-08-29 20:11:13,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-08-29 20:11:13,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-08-29 20:11:13,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-08-29 20:11:13,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-08-29 20:11:13,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 20:11:13,484 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:11:13,488 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:11:13,489 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:11:13,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:11:13 BasicIcfg [2023-08-29 20:11:13,538 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:11:13,538 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:11:13,539 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:11:13,539 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:11:13,539 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:11:04" (3/4) ... [2023-08-29 20:11:13,542 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:11:13,542 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:11:13,543 INFO L158 Benchmark]: Toolchain (without parser) took 10079.50ms. Allocated memory was 73.4MB in the beginning and 228.6MB in the end (delta: 155.2MB). Free memory was 49.3MB in the beginning and 167.5MB in the end (delta: -118.2MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2023-08-29 20:11:13,543 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 73.4MB. Free memory is still 50.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:11:13,543 INFO L158 Benchmark]: CACSL2BoogieTranslator took 578.42ms. Allocated memory was 73.4MB in the beginning and 96.5MB in the end (delta: 23.1MB). Free memory was 49.2MB in the beginning and 67.3MB in the end (delta: -18.1MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2023-08-29 20:11:13,543 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.52ms. Allocated memory is still 96.5MB. Free memory was 67.3MB in the beginning and 64.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:11:13,544 INFO L158 Benchmark]: Boogie Preprocessor took 56.88ms. Allocated memory is still 96.5MB. Free memory was 64.6MB in the beginning and 62.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:11:13,544 INFO L158 Benchmark]: RCFGBuilder took 647.58ms. Allocated memory is still 96.5MB. Free memory was 62.5MB in the beginning and 52.5MB in the end (delta: 10.0MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2023-08-29 20:11:13,544 INFO L158 Benchmark]: TraceAbstraction took 8715.82ms. Allocated memory was 96.5MB in the beginning and 228.6MB in the end (delta: 132.1MB). Free memory was 51.6MB in the beginning and 167.5MB in the end (delta: -115.9MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2023-08-29 20:11:13,545 INFO L158 Benchmark]: Witness Printer took 3.60ms. Allocated memory is still 228.6MB. Free memory is still 167.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:11:13,546 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.20ms. Allocated memory is still 73.4MB. Free memory is still 50.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 578.42ms. Allocated memory was 73.4MB in the beginning and 96.5MB in the end (delta: 23.1MB). Free memory was 49.2MB in the beginning and 67.3MB in the end (delta: -18.1MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.52ms. Allocated memory is still 96.5MB. Free memory was 67.3MB in the beginning and 64.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.88ms. Allocated memory is still 96.5MB. Free memory was 64.6MB in the beginning and 62.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 647.58ms. Allocated memory is still 96.5MB. Free memory was 62.5MB in the beginning and 52.5MB in the end (delta: 10.0MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8715.82ms. Allocated memory was 96.5MB in the beginning and 228.6MB in the end (delta: 132.1MB). Free memory was 51.6MB in the beginning and 167.5MB in the end (delta: -115.9MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Witness Printer took 3.60ms. Allocated memory is still 228.6MB. Free memory is still 167.5MB. 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.6s, 102 PlacesBefore, 30 PlacesAfterwards, 97 TransitionsBefore, 23 TransitionsAfterwards, 1212 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 101 TotalNumberOfCompositions, 3322 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1560, independent: 1408, independent conditional: 0, independent unconditional: 1408, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 694, independent: 660, independent conditional: 0, independent unconditional: 660, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1560, independent: 748, independent conditional: 0, independent unconditional: 748, dependent: 118, dependent conditional: 0, dependent unconditional: 118, unknown: 694, unknown conditional: 0, unknown unconditional: 694] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 48, Positive conditional cache size: 0, Positive unconditional cache size: 48, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L826] 0 pthread_t t0; [L827] FCALL, FORK 0 pthread_create(&t0, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t0, ((void *)0), P0, ((void *)0))=-2, t0={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L828] 0 pthread_t t1; [L829] FCALL, FORK 0 pthread_create(&t1, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1, ((void *)0), P1, ((void *)0))=-1, t0={5:0}, t1={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L785] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 2 x$flush_delayed = weak$$choice2 [L788] 2 x$mem_tmp = x [L789] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L790] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L791] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L792] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L793] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L794] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L795] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L796] 2 __unbuffered_p1_EAX = x [L797] 2 x = x$flush_delayed ? x$mem_tmp : x [L798] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L801] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L743] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L746] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L804] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L805] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L806] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L807] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L808] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 2 return 0; [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L833] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L833] RET 0 assume_abort_if_not(main$tmp_guard0) [L835] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L836] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L837] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L838] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L839] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L842] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 829]: 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. - UnprovableResult [Line: 827]: 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 5 procedures, 118 locations, 10 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: 8.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 314 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 217 mSDsluCounter, 123 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 84 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 663 IncrementalHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 39 mSDtfsCounter, 663 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171occurred in iteration=9, InterpolantAutomatonStates: 47, 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.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 800 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-08-29 20:11:13,583 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/pthread-wmm/mix000.opt.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 fd6a5bc5d3f013f4ace97b77d830608c8280eaa5bc8f461c3acae231027617e4 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:11:15,404 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:11:15,407 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:11:15,450 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:11:15,450 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:11:15,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:11:15,455 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:11:15,457 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:11:15,460 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:11:15,464 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:11:15,465 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:11:15,467 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:11:15,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:11:15,470 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:11:15,471 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:11:15,477 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:11:15,478 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:11:15,480 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:11:15,482 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:11:15,487 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:11:15,502 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:11:15,503 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:11:15,504 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:11:15,505 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:11:15,511 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:11:15,511 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:11:15,512 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:11:15,513 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:11:15,514 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:11:15,514 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:11:15,515 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:11:15,516 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:11:15,518 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:11:15,520 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:11:15,521 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:11:15,521 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:11:15,522 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:11:15,522 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:11:15,522 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:11:15,523 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:11:15,523 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:11:15,525 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-29 20:11:15,557 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:11:15,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:11:15,559 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:11:15,559 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:11:15,560 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:11:15,560 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:11:15,560 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:11:15,560 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:11:15,561 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:11:15,561 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:11:15,562 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:11:15,562 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:11:15,562 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:11:15,562 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:11:15,562 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:11:15,563 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:11:15,563 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:11:15,563 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:11:15,563 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:11:15,563 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:11:15,564 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:11:15,564 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:11:15,564 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:11:15,564 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:11:15,564 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:11:15,565 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:11:15,565 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:11:15,565 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:11:15,565 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:11:15,565 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:11:15,566 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:11:15,566 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:11:15,566 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:11:15,566 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:11:15,566 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:11:15,567 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:11:15,567 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:11:15,567 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 -> fd6a5bc5d3f013f4ace97b77d830608c8280eaa5bc8f461c3acae231027617e4 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 -> AFTER [2023-08-29 20:11:15,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:11:15,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:11:15,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:11:15,870 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:11:15,870 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:11:15,871 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000.opt.i [2023-08-29 20:11:17,072 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:11:17,321 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:11:17,329 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.opt.i [2023-08-29 20:11:17,347 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3209517c6/00e6fcd4d3134d7db088d96a91837b52/FLAGadc5daab8 [2023-08-29 20:11:17,362 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3209517c6/00e6fcd4d3134d7db088d96a91837b52 [2023-08-29 20:11:17,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:11:17,365 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:11:17,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:11:17,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:11:17,368 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:11:17,369 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:11:17" (1/1) ... [2023-08-29 20:11:17,370 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@193aa787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:17, skipping insertion in model container [2023-08-29 20:11:17,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:11:17" (1/1) ... [2023-08-29 20:11:17,376 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:11:17,437 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:11:17,554 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.opt.i[987,1000] [2023-08-29 20:11:17,687 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:11:17,704 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:11:17,717 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.opt.i[987,1000] [2023-08-29 20:11:17,792 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:11:17,839 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:11:17,839 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:11:17,845 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:11:17,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:17 WrapperNode [2023-08-29 20:11:17,845 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:11:17,846 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:11:17,847 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:11:17,847 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:11:17,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:17" (1/1) ... [2023-08-29 20:11:17,882 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:17" (1/1) ... [2023-08-29 20:11:17,914 INFO L138 Inliner]: procedures = 178, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 136 [2023-08-29 20:11:17,919 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:11:17,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:11:17,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:11:17,922 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:11:17,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:17" (1/1) ... [2023-08-29 20:11:17,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:17" (1/1) ... [2023-08-29 20:11:17,942 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:17" (1/1) ... [2023-08-29 20:11:17,943 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:17" (1/1) ... [2023-08-29 20:11:17,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:17" (1/1) ... [2023-08-29 20:11:17,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:17" (1/1) ... [2023-08-29 20:11:17,965 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:17" (1/1) ... [2023-08-29 20:11:17,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:17" (1/1) ... [2023-08-29 20:11:17,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:11:17,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:11:17,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:11:17,989 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:11:17,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:17" (1/1) ... [2023-08-29 20:11:17,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:11:18,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:11:18,017 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-08-29 20:11:18,041 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-08-29 20:11:18,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:11:18,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:11:18,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:11:18,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:11:18,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:11:18,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:11:18,058 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:11:18,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:11:18,058 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:11:18,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:11:18,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:11:18,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:11:18,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:11:18,060 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:11:18,269 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:11:18,271 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:11:18,661 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:11:18,807 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:11:18,807 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:11:18,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:11:18 BoogieIcfgContainer [2023-08-29 20:11:18,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:11:18,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:11:18,813 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:11:18,816 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:11:18,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:11:17" (1/3) ... [2023-08-29 20:11:18,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5de2e437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:11:18, skipping insertion in model container [2023-08-29 20:11:18,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:17" (2/3) ... [2023-08-29 20:11:18,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5de2e437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:11:18, skipping insertion in model container [2023-08-29 20:11:18,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:11:18" (3/3) ... [2023-08-29 20:11:18,819 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000.opt.i [2023-08-29 20:11:18,835 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:11:18,836 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-08-29 20:11:18,836 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:11:18,885 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:11:18,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 100 transitions, 210 flow [2023-08-29 20:11:18,977 INFO L130 PetriNetUnfolder]: 2/98 cut-off events. [2023-08-29 20:11:18,977 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:11:18,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 98 events. 2/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-08-29 20:11:18,983 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 100 transitions, 210 flow [2023-08-29 20:11:18,988 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 98 transitions, 202 flow [2023-08-29 20:11:18,992 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:11:19,008 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 98 transitions, 202 flow [2023-08-29 20:11:19,010 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 98 transitions, 202 flow [2023-08-29 20:11:19,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 98 transitions, 202 flow [2023-08-29 20:11:19,031 INFO L130 PetriNetUnfolder]: 2/98 cut-off events. [2023-08-29 20:11:19,032 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:11:19,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 98 events. 2/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-08-29 20:11:19,033 INFO L119 LiptonReduction]: Number of co-enabled transitions 1212 [2023-08-29 20:11:24,577 INFO L134 LiptonReduction]: Checked pairs total: 3558 [2023-08-29 20:11:24,577 INFO L136 LiptonReduction]: Total number of compositions: 95 [2023-08-29 20:11:24,589 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:11:24,595 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;@3e54e7cc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:11:24,595 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-08-29 20:11:24,597 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:11:24,597 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:11:24,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:11:24,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:11:24,598 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:11:24,602 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:11:24,602 INFO L85 PathProgramCache]: Analyzing trace with hash 471, now seen corresponding path program 1 times [2023-08-29 20:11:24,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:11:24,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1086864710] [2023-08-29 20:11:24,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:11:24,613 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-08-29 20:11:24,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:11:24,618 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-08-29 20:11:24,620 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-08-29 20:11:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:11:24,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:11:24,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:11:24,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:11:24,687 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:11:24,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:11:24,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1086864710] [2023-08-29 20:11:24,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1086864710] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:11:24,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:11:24,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:11:24,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754166982] [2023-08-29 20:11:24,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:11:24,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:11:24,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:11:24,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:11:24,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:11:24,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 195 [2023-08-29 20:11:24,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 58 flow. Second operand has 2 states, 2 states have (on average 89.5) internal successors, (179), 2 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-08-29 20:11:24,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:11:24,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 195 [2023-08-29 20:11:24,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:11:24,941 INFO L130 PetriNetUnfolder]: 287/502 cut-off events. [2023-08-29 20:11:24,942 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-29 20:11:24,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1004 conditions, 502 events. 287/502 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2185 event pairs, 287 based on Foata normal form. 24/414 useless extension candidates. Maximal degree in co-relation 994. Up to 489 conditions per place. [2023-08-29 20:11:24,948 INFO L137 encePairwiseOnDemand]: 190/195 looper letters, 19 selfloop transitions, 0 changer transitions 0/21 dead transitions. [2023-08-29 20:11:24,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 21 transitions, 86 flow [2023-08-29 20:11:24,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:11:24,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:11:24,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 202 transitions. [2023-08-29 20:11:24,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.517948717948718 [2023-08-29 20:11:24,994 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 202 transitions. [2023-08-29 20:11:24,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 202 transitions. [2023-08-29 20:11:24,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:11:24,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 202 transitions. [2023-08-29 20:11:25,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 101.0) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 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-08-29 20:11:25,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 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-08-29 20:11:25,023 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 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-08-29 20:11:25,034 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 58 flow. Second operand 2 states and 202 transitions. [2023-08-29 20:11:25,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 21 transitions, 86 flow [2023-08-29 20:11:25,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 21 transitions, 84 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:11:25,038 INFO L231 Difference]: Finished difference. Result has 27 places, 21 transitions, 46 flow [2023-08-29 20:11:25,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=46, PETRI_PLACES=27, PETRI_TRANSITIONS=21} [2023-08-29 20:11:25,046 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -5 predicate places. [2023-08-29 20:11:25,046 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 46 flow [2023-08-29 20:11:25,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 89.5) internal successors, (179), 2 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-08-29 20:11:25,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:11:25,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 20:11:25,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-08-29 20:11:25,255 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-08-29 20:11:25,256 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:11:25,256 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:11:25,256 INFO L85 PathProgramCache]: Analyzing trace with hash 447519022, now seen corresponding path program 1 times [2023-08-29 20:11:25,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:11:25,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82784516] [2023-08-29 20:11:25,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:11:25,258 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-08-29 20:11:25,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:11:25,259 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-08-29 20:11:25,262 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-08-29 20:11:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:11:25,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:11:25,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:11:25,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:11:25,346 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:11:25,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:11:25,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82784516] [2023-08-29 20:11:25,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [82784516] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:11:25,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:11:25,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:11:25,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260425343] [2023-08-29 20:11:25,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:11:25,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:11:25,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:11:25,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:11:25,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:11:25,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 195 [2023-08-29 20:11:25,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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-08-29 20:11:25,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:11:25,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 195 [2023-08-29 20:11:25,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:11:25,505 INFO L130 PetriNetUnfolder]: 235/438 cut-off events. [2023-08-29 20:11:25,506 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:11:25,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 855 conditions, 438 events. 235/438 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1975 event pairs, 27 based on Foata normal form. 0/377 useless extension candidates. Maximal degree in co-relation 852. Up to 337 conditions per place. [2023-08-29 20:11:25,514 INFO L137 encePairwiseOnDemand]: 192/195 looper letters, 22 selfloop transitions, 2 changer transitions 4/30 dead transitions. [2023-08-29 20:11:25,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 30 transitions, 120 flow [2023-08-29 20:11:25,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:11:25,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:11:25,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 293 transitions. [2023-08-29 20:11:25,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5008547008547009 [2023-08-29 20:11:25,522 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 293 transitions. [2023-08-29 20:11:25,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 293 transitions. [2023-08-29 20:11:25,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:11:25,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 293 transitions. [2023-08-29 20:11:25,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 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-08-29 20:11:25,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 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-08-29 20:11:25,531 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 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-08-29 20:11:25,531 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 46 flow. Second operand 3 states and 293 transitions. [2023-08-29 20:11:25,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 30 transitions, 120 flow [2023-08-29 20:11:25,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:11:25,532 INFO L231 Difference]: Finished difference. Result has 28 places, 18 transitions, 44 flow [2023-08-29 20:11:25,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=28, PETRI_TRANSITIONS=18} [2023-08-29 20:11:25,533 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -4 predicate places. [2023-08-29 20:11:25,533 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 18 transitions, 44 flow [2023-08-29 20:11:25,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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-08-29 20:11:25,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:11:25,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:11:25,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-29 20:11:25,743 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-08-29 20:11:25,743 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:11:25,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:11:25,744 INFO L85 PathProgramCache]: Analyzing trace with hash 463208960, now seen corresponding path program 1 times [2023-08-29 20:11:25,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:11:25,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1604910969] [2023-08-29 20:11:25,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:11:25,745 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-08-29 20:11:25,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:11:25,748 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-08-29 20:11:25,750 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-08-29 20:11:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:11:25,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:11:25,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:11:25,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:11:25,837 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:11:25,837 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:11:25,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1604910969] [2023-08-29 20:11:25,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1604910969] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:11:25,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:11:25,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:11:25,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043157636] [2023-08-29 20:11:25,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:11:25,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:11:25,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:11:25,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:11:25,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:11:25,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 195 [2023-08-29 20:11:25,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 18 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 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-08-29 20:11:25,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:11:25,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 195 [2023-08-29 20:11:25,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:11:25,922 INFO L130 PetriNetUnfolder]: 53/127 cut-off events. [2023-08-29 20:11:25,923 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-29 20:11:25,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 127 events. 53/127 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 407 event pairs, 15 based on Foata normal form. 12/130 useless extension candidates. Maximal degree in co-relation 269. Up to 94 conditions per place. [2023-08-29 20:11:25,924 INFO L137 encePairwiseOnDemand]: 191/195 looper letters, 22 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2023-08-29 20:11:25,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 27 transitions, 116 flow [2023-08-29 20:11:25,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:11:25,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:11:25,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2023-08-29 20:11:25,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48547008547008547 [2023-08-29 20:11:25,926 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 284 transitions. [2023-08-29 20:11:25,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 284 transitions. [2023-08-29 20:11:25,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:11:25,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 284 transitions. [2023-08-29 20:11:25,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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-08-29 20:11:25,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 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-08-29 20:11:25,931 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 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-08-29 20:11:25,931 INFO L175 Difference]: Start difference. First operand has 28 places, 18 transitions, 44 flow. Second operand 3 states and 284 transitions. [2023-08-29 20:11:25,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 27 transitions, 116 flow [2023-08-29 20:11:25,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:11:25,932 INFO L231 Difference]: Finished difference. Result has 27 places, 20 transitions, 59 flow [2023-08-29 20:11:25,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=59, PETRI_PLACES=27, PETRI_TRANSITIONS=20} [2023-08-29 20:11:25,934 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -5 predicate places. [2023-08-29 20:11:25,934 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 20 transitions, 59 flow [2023-08-29 20:11:25,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 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-08-29 20:11:25,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:11:25,934 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:11:25,945 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-08-29 20:11:26,143 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-08-29 20:11:26,143 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:11:26,144 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:11:26,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1197512757, now seen corresponding path program 1 times [2023-08-29 20:11:26,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:11:26,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [389053102] [2023-08-29 20:11:26,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:11:26,145 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-08-29 20:11:26,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:11:26,146 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-08-29 20:11:26,149 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-08-29 20:11:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:11:26,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:11:26,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:11:26,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:11:26,264 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:11:26,264 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:11:26,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [389053102] [2023-08-29 20:11:26,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [389053102] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:11:26,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:11:26,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:11:26,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584318516] [2023-08-29 20:11:26,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:11:26,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:11:26,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:11:26,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:11:26,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:11:26,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 195 [2023-08-29 20:11:26,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 20 transitions, 59 flow. Second operand has 4 states, 4 states have (on average 88.75) internal successors, (355), 4 states have internal predecessors, (355), 0 states have call successors, (0), 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-08-29 20:11:26,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:11:26,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 195 [2023-08-29 20:11:26,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:11:26,348 INFO L130 PetriNetUnfolder]: 18/57 cut-off events. [2023-08-29 20:11:26,348 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-29 20:11:26,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 57 events. 18/57 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 123 event pairs, 10 based on Foata normal form. 7/62 useless extension candidates. Maximal degree in co-relation 141. Up to 29 conditions per place. [2023-08-29 20:11:26,349 INFO L137 encePairwiseOnDemand]: 191/195 looper letters, 20 selfloop transitions, 5 changer transitions 0/27 dead transitions. [2023-08-29 20:11:26,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 27 transitions, 125 flow [2023-08-29 20:11:26,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:11:26,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:11:26,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 370 transitions. [2023-08-29 20:11:26,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47435897435897434 [2023-08-29 20:11:26,351 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 370 transitions. [2023-08-29 20:11:26,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 370 transitions. [2023-08-29 20:11:26,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:11:26,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 370 transitions. [2023-08-29 20:11:26,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 0 states have call successors, (0), 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-08-29 20:11:26,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 0 states have call successors, (0), 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-08-29 20:11:26,355 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 0 states have call successors, (0), 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-08-29 20:11:26,355 INFO L175 Difference]: Start difference. First operand has 27 places, 20 transitions, 59 flow. Second operand 4 states and 370 transitions. [2023-08-29 20:11:26,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 27 transitions, 125 flow [2023-08-29 20:11:26,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 122 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:11:26,356 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 72 flow [2023-08-29 20:11:26,357 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-08-29 20:11:26,357 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-08-29 20:11:26,357 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 72 flow [2023-08-29 20:11:26,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.75) internal successors, (355), 4 states have internal predecessors, (355), 0 states have call successors, (0), 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-08-29 20:11:26,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:11:26,358 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:11:26,370 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-08-29 20:11:26,567 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-08-29 20:11:26,568 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:11:26,568 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:11:26,568 INFO L85 PathProgramCache]: Analyzing trace with hash -306721373, now seen corresponding path program 1 times [2023-08-29 20:11:26,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:11:26,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1536682250] [2023-08-29 20:11:26,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:11:26,569 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-08-29 20:11:26,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:11:26,570 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-08-29 20:11:26,576 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-08-29 20:11:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:11:26,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-29 20:11:26,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:11:26,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:11:26,913 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:11:26,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:11:26,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1536682250] [2023-08-29 20:11:26,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1536682250] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:11:26,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:11:26,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:11:26,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179814705] [2023-08-29 20:11:26,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:11:26,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:11:26,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:11:26,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:11:26,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:11:27,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 195 [2023-08-29 20:11:27,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 0 states have call successors, (0), 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-08-29 20:11:27,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:11:27,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 195 [2023-08-29 20:11:27,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:11:27,136 INFO L130 PetriNetUnfolder]: 18/56 cut-off events. [2023-08-29 20:11:27,136 INFO L131 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2023-08-29 20:11:27,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 56 events. 18/56 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 135 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 145. Up to 46 conditions per place. [2023-08-29 20:11:27,137 INFO L137 encePairwiseOnDemand]: 192/195 looper letters, 18 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2023-08-29 20:11:27,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 22 transitions, 121 flow [2023-08-29 20:11:27,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:11:27,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:11:27,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 323 transitions. [2023-08-29 20:11:27,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41410256410256413 [2023-08-29 20:11:27,139 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 323 transitions. [2023-08-29 20:11:27,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 323 transitions. [2023-08-29 20:11:27,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:11:27,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 323 transitions. [2023-08-29 20:11:27,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 80.75) internal successors, (323), 4 states have internal predecessors, (323), 0 states have call successors, (0), 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-08-29 20:11:27,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 0 states have call successors, (0), 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-08-29 20:11:27,143 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 0 states have call successors, (0), 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-08-29 20:11:27,143 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 72 flow. Second operand 4 states and 323 transitions. [2023-08-29 20:11:27,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 22 transitions, 121 flow [2023-08-29 20:11:27,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 22 transitions, 110 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-29 20:11:27,145 INFO L231 Difference]: Finished difference. Result has 30 places, 19 transitions, 64 flow [2023-08-29 20:11:27,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=64, PETRI_PLACES=30, PETRI_TRANSITIONS=19} [2023-08-29 20:11:27,146 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-08-29 20:11:27,146 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 19 transitions, 64 flow [2023-08-29 20:11:27,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 0 states have call successors, (0), 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-08-29 20:11:27,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:11:27,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:11:27,159 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-08-29 20:11:27,359 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-08-29 20:11:27,360 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:11:27,360 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:11:27,360 INFO L85 PathProgramCache]: Analyzing trace with hash 714186749, now seen corresponding path program 1 times [2023-08-29 20:11:27,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:11:27,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [158237406] [2023-08-29 20:11:27,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:11:27,361 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-08-29 20:11:27,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:11:27,362 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-08-29 20:11:27,363 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-08-29 20:11:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:11:27,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:11:27,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:11:27,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:11:27,512 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:11:27,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:11:27,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [158237406] [2023-08-29 20:11:27,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [158237406] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:11:27,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:11:27,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:11:27,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764123437] [2023-08-29 20:11:27,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:11:27,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:11:27,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:11:27,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:11:27,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:11:27,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 195 [2023-08-29 20:11:27,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 19 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 0 states have call successors, (0), 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-08-29 20:11:27,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:11:27,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 195 [2023-08-29 20:11:27,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:11:27,664 INFO L130 PetriNetUnfolder]: 24/81 cut-off events. [2023-08-29 20:11:27,665 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2023-08-29 20:11:27,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 81 events. 24/81 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 236 event pairs, 0 based on Foata normal form. 1/82 useless extension candidates. Maximal degree in co-relation 206. Up to 46 conditions per place. [2023-08-29 20:11:27,665 INFO L137 encePairwiseOnDemand]: 191/195 looper letters, 19 selfloop transitions, 1 changer transitions 14/35 dead transitions. [2023-08-29 20:11:27,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 188 flow [2023-08-29 20:11:27,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:11:27,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:11:27,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2023-08-29 20:11:27,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4625641025641026 [2023-08-29 20:11:27,668 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 451 transitions. [2023-08-29 20:11:27,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 451 transitions. [2023-08-29 20:11:27,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:11:27,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 451 transitions. [2023-08-29 20:11:27,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 0 states have call successors, (0), 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-08-29 20:11:27,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 0 states have call successors, (0), 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-08-29 20:11:27,672 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 0 states have call successors, (0), 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-08-29 20:11:27,672 INFO L175 Difference]: Start difference. First operand has 30 places, 19 transitions, 64 flow. Second operand 5 states and 451 transitions. [2023-08-29 20:11:27,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 188 flow [2023-08-29 20:11:27,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:11:27,674 INFO L231 Difference]: Finished difference. Result has 35 places, 19 transitions, 70 flow [2023-08-29 20:11:27,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=70, PETRI_PLACES=35, PETRI_TRANSITIONS=19} [2023-08-29 20:11:27,675 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2023-08-29 20:11:27,675 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 19 transitions, 70 flow [2023-08-29 20:11:27,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 0 states have call successors, (0), 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-08-29 20:11:27,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:11:27,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:11:27,689 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-08-29 20:11:27,885 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-08-29 20:11:27,886 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:11:27,886 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:11:27,886 INFO L85 PathProgramCache]: Analyzing trace with hash -409334083, now seen corresponding path program 2 times [2023-08-29 20:11:27,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:11:27,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411892052] [2023-08-29 20:11:27,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:11:27,887 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-08-29 20:11:27,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:11:27,888 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-08-29 20:11:27,889 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-08-29 20:11:27,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:11:27,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:11:27,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-29 20:11:27,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:11:28,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:11:28,790 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:11:28,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:11:28,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411892052] [2023-08-29 20:11:28,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [411892052] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:11:28,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:11:28,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:11:28,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108909234] [2023-08-29 20:11:28,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:11:28,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:11:28,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:11:28,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:11:28,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:11:28,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 195 [2023-08-29 20:11:28,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 19 transitions, 70 flow. Second operand has 8 states, 8 states have (on average 84.875) internal successors, (679), 8 states have internal predecessors, (679), 0 states have call successors, (0), 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-08-29 20:11:28,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:11:28,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 195 [2023-08-29 20:11:28,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:11:29,111 INFO L130 PetriNetUnfolder]: 18/64 cut-off events. [2023-08-29 20:11:29,111 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2023-08-29 20:11:29,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 64 events. 18/64 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 149 event pairs, 6 based on Foata normal form. 1/64 useless extension candidates. Maximal degree in co-relation 184. Up to 19 conditions per place. [2023-08-29 20:11:29,112 INFO L137 encePairwiseOnDemand]: 188/195 looper letters, 14 selfloop transitions, 4 changer transitions 15/35 dead transitions. [2023-08-29 20:11:29,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 35 transitions, 207 flow [2023-08-29 20:11:29,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:11:29,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:11:29,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 694 transitions. [2023-08-29 20:11:29,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44487179487179485 [2023-08-29 20:11:29,115 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 694 transitions. [2023-08-29 20:11:29,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 694 transitions. [2023-08-29 20:11:29,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:11:29,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 694 transitions. [2023-08-29 20:11:29,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 86.75) internal successors, (694), 8 states have internal predecessors, (694), 0 states have call successors, (0), 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-08-29 20:11:29,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 195.0) internal successors, (1755), 9 states have internal predecessors, (1755), 0 states have call successors, (0), 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-08-29 20:11:29,121 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 195.0) internal successors, (1755), 9 states have internal predecessors, (1755), 0 states have call successors, (0), 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-08-29 20:11:29,121 INFO L175 Difference]: Start difference. First operand has 35 places, 19 transitions, 70 flow. Second operand 8 states and 694 transitions. [2023-08-29 20:11:29,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 35 transitions, 207 flow [2023-08-29 20:11:29,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 35 transitions, 197 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-29 20:11:29,124 INFO L231 Difference]: Finished difference. Result has 40 places, 19 transitions, 80 flow [2023-08-29 20:11:29,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=80, PETRI_PLACES=40, PETRI_TRANSITIONS=19} [2023-08-29 20:11:29,125 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2023-08-29 20:11:29,125 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 19 transitions, 80 flow [2023-08-29 20:11:29,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 84.875) internal successors, (679), 8 states have internal predecessors, (679), 0 states have call successors, (0), 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-08-29 20:11:29,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:11:29,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:11:29,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-08-29 20:11:29,336 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-08-29 20:11:29,337 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-08-29 20:11:29,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:11:29,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1061404245, now seen corresponding path program 3 times [2023-08-29 20:11:29,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:11:29,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1068755358] [2023-08-29 20:11:29,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 20:11:29,339 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-08-29 20:11:29,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:11:29,340 INFO L229 MonitoredProcess]: Starting monitored process 9 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-08-29 20:11:29,342 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 (9)] Waiting until timeout for monitored process [2023-08-29 20:11:29,439 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 20:11:29,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-29 20:11:29,439 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:11:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:11:29,532 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:11:29,532 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:11:29,533 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-08-29 20:11:29,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-08-29 20:11:29,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-08-29 20:11:29,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-08-29 20:11:29,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-08-29 20:11:29,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-08-29 20:11:29,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-08-29 20:11:29,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-08-29 20:11:29,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-08-29 20:11:29,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-08-29 20:11:29,549 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 (9)] Forceful destruction successful, exit code 0 [2023-08-29 20:11:29,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-08-29 20:11:29,742 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-08-29 20:11:29,747 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:11:29,747 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:11:29,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:11:29 BasicIcfg [2023-08-29 20:11:29,806 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:11:29,807 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:11:29,807 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:11:29,807 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:11:29,807 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:11:18" (3/4) ... [2023-08-29 20:11:29,810 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:11:29,810 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:11:29,810 INFO L158 Benchmark]: Toolchain (without parser) took 12445.44ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 70.8MB in the beginning and 69.5MB in the end (delta: 1.3MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. [2023-08-29 20:11:29,811 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 62.9MB. Free memory is still 41.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:11:29,811 INFO L158 Benchmark]: CACSL2BoogieTranslator took 479.70ms. Allocated memory is still 92.3MB. Free memory was 70.5MB in the beginning and 46.6MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-08-29 20:11:29,811 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.32ms. Allocated memory is still 92.3MB. Free memory was 46.6MB in the beginning and 44.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:11:29,812 INFO L158 Benchmark]: Boogie Preprocessor took 67.23ms. Allocated memory is still 92.3MB. Free memory was 44.1MB in the beginning and 71.1MB in the end (delta: -27.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-29 20:11:29,812 INFO L158 Benchmark]: RCFGBuilder took 821.48ms. Allocated memory is still 92.3MB. Free memory was 71.1MB in the beginning and 61.7MB in the end (delta: 9.4MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. [2023-08-29 20:11:29,812 INFO L158 Benchmark]: TraceAbstraction took 10992.63ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 61.2MB in the beginning and 69.5MB in the end (delta: -8.3MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. [2023-08-29 20:11:29,814 INFO L158 Benchmark]: Witness Printer took 3.23ms. Allocated memory is still 134.2MB. Free memory is still 69.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:11:29,818 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 62.9MB. Free memory is still 41.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 479.70ms. Allocated memory is still 92.3MB. Free memory was 70.5MB in the beginning and 46.6MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.32ms. Allocated memory is still 92.3MB. Free memory was 46.6MB in the beginning and 44.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.23ms. Allocated memory is still 92.3MB. Free memory was 44.1MB in the beginning and 71.1MB in the end (delta: -27.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 821.48ms. Allocated memory is still 92.3MB. Free memory was 71.1MB in the beginning and 61.7MB in the end (delta: 9.4MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10992.63ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 61.2MB in the beginning and 69.5MB in the end (delta: -8.3MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. * Witness Printer took 3.23ms. Allocated memory is still 134.2MB. Free memory is still 69.5MB. 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: 5.6s, 103 PlacesBefore, 32 PlacesAfterwards, 98 TransitionsBefore, 26 TransitionsAfterwards, 1212 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 95 TotalNumberOfCompositions, 3558 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1548, independent: 1390, independent conditional: 0, independent unconditional: 1390, dependent: 158, dependent conditional: 0, dependent unconditional: 158, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 660, independent: 635, independent conditional: 0, independent unconditional: 635, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1548, independent: 755, independent conditional: 0, independent unconditional: 755, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 660, unknown conditional: 0, unknown unconditional: 660] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 52, Positive conditional cache size: 0, Positive unconditional cache size: 52, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L826] 0 pthread_t t0; [L827] FCALL, FORK 0 pthread_create(&t0, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t0, ((void *)0), P0, ((void *)0))=0, t0={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L828] 0 pthread_t t1; [L829] FCALL, FORK 0 pthread_create(&t1, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1, ((void *)0), P1, ((void *)0))=1, t0={3:0}, t1={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L785] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 2 x$flush_delayed = weak$$choice2 [L788] 2 x$mem_tmp = x [L789] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L790] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L791] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L792] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L793] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L794] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L795] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L796] 2 __unbuffered_p1_EAX = x [L797] 2 x = x$flush_delayed ? x$mem_tmp : x [L798] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L801] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L743] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L746] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L804] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L805] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L806] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L807] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L808] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 2 return 0; [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L833] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L833] RET 0 assume_abort_if_not(main$tmp_guard0) [L835] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L836] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L837] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L838] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L839] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0={3:0}, t1={7:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L842] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 829]: 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. - UnprovableResult [Line: 827]: 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 5 procedures, 119 locations, 10 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: 10.8s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 187 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 119 mSDsluCounter, 125 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 102 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 556 IncrementalHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 23 mSDtfsCounter, 556 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=7, InterpolantAutomatonStates: 29, 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.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 70 ConstructedInterpolants, 14 QuantifiedInterpolants, 630 SizeOfPredicates, 7 NumberOfNonLiveVariables, 694 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-08-29 20:11:29,842 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