./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_037dba46-33c6-4626-b997-824dd6e25161/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_037dba46-33c6-4626-b997-824dd6e25161/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_037dba46-33c6-4626-b997-824dd6e25161/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_037dba46-33c6-4626-b997-824dd6e25161/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_037dba46-33c6-4626-b997-824dd6e25161/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_037dba46-33c6-4626-b997-824dd6e25161/bin/uautomizer-ZsLfNo2U6R --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 cec155e54548239c459fec40910e358deb5fad2ceffa658bfdeefddd1bc9e166 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 17:14:25,102 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:14:25,105 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:14:25,134 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:14:25,134 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:14:25,136 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:14:25,137 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:14:25,139 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:14:25,141 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:14:25,142 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:14:25,143 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:14:25,145 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:14:25,145 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:14:25,146 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:14:25,148 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:14:25,149 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:14:25,150 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:14:25,151 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:14:25,153 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:14:25,156 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:14:25,157 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:14:25,159 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:14:25,160 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:14:25,162 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:14:25,166 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:14:25,166 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:14:25,167 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:14:25,168 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:14:25,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:14:25,169 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:14:25,170 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:14:25,171 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:14:25,172 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:14:25,172 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:14:25,174 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:14:25,174 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:14:25,175 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:14:25,175 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:14:25,176 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:14:25,177 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:14:25,178 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:14:25,179 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_037dba46-33c6-4626-b997-824dd6e25161/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 17:14:25,203 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:14:25,204 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:14:25,204 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:14:25,204 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:14:25,205 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:14:25,206 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:14:25,207 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:14:25,207 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:14:25,207 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:14:25,208 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:14:25,208 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:14:25,208 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:14:25,208 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:14:25,209 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:14:25,209 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:14:25,209 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 17:14:25,209 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 17:14:25,210 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 17:14:25,210 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:14:25,210 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 17:14:25,210 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:14:25,211 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:14:25,211 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:14:25,211 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:14:25,211 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:14:25,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:14:25,212 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:14:25,212 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:14:25,212 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:14:25,213 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:14:25,213 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:14:25,213 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:14:25,213 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:14:25,214 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_037dba46-33c6-4626-b997-824dd6e25161/bin/uautomizer-ZsLfNo2U6R/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_037dba46-33c6-4626-b997-824dd6e25161/bin/uautomizer-ZsLfNo2U6R 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 -> cec155e54548239c459fec40910e358deb5fad2ceffa658bfdeefddd1bc9e166 [2022-11-25 17:14:25,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:14:25,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:14:25,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:14:25,518 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:14:25,519 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:14:25,520 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_037dba46-33c6-4626-b997-824dd6e25161/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i [2022-11-25 17:14:28,698 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:14:28,926 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:14:28,932 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_037dba46-33c6-4626-b997-824dd6e25161/sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i [2022-11-25 17:14:28,954 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_037dba46-33c6-4626-b997-824dd6e25161/bin/uautomizer-ZsLfNo2U6R/data/df1126301/353b9bb1b6c74c03aa9d1942165fab84/FLAGafa3b37c6 [2022-11-25 17:14:28,976 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_037dba46-33c6-4626-b997-824dd6e25161/bin/uautomizer-ZsLfNo2U6R/data/df1126301/353b9bb1b6c74c03aa9d1942165fab84 [2022-11-25 17:14:28,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:14:28,983 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:14:28,986 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:14:28,986 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:14:28,990 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:14:28,993 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:14:28" (1/1) ... [2022-11-25 17:14:28,994 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cf73b97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:14:28, skipping insertion in model container [2022-11-25 17:14:28,995 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:14:28" (1/1) ... [2022-11-25 17:14:29,005 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:14:29,038 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:14:29,210 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_037dba46-33c6-4626-b997-824dd6e25161/sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i[1092,1105] [2022-11-25 17:14:29,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:14:29,425 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:14:29,439 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_037dba46-33c6-4626-b997-824dd6e25161/sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i[1092,1105] [2022-11-25 17:14:29,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:14:29,526 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:14:29,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:14:29 WrapperNode [2022-11-25 17:14:29,527 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:14:29,528 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:14:29,528 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:14:29,528 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:14:29,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:14:29" (1/1) ... [2022-11-25 17:14:29,551 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:14:29" (1/1) ... [2022-11-25 17:14:29,575 INFO L138 Inliner]: procedures = 165, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 129 [2022-11-25 17:14:29,576 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:14:29,577 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:14:29,577 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:14:29,577 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:14:29,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:14:29" (1/1) ... [2022-11-25 17:14:29,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:14:29" (1/1) ... [2022-11-25 17:14:29,591 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:14:29" (1/1) ... [2022-11-25 17:14:29,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:14:29" (1/1) ... [2022-11-25 17:14:29,598 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:14:29" (1/1) ... [2022-11-25 17:14:29,600 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:14:29" (1/1) ... [2022-11-25 17:14:29,602 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:14:29" (1/1) ... [2022-11-25 17:14:29,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:14:29" (1/1) ... [2022-11-25 17:14:29,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:14:29,607 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:14:29,607 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:14:29,607 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:14:29,608 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:14:29" (1/1) ... [2022-11-25 17:14:29,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:14:29,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_037dba46-33c6-4626-b997-824dd6e25161/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:14:29,650 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_037dba46-33c6-4626-b997-824dd6e25161/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:14:29,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_037dba46-33c6-4626-b997-824dd6e25161/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:14:29,698 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2022-11-25 17:14:29,698 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2022-11-25 17:14:29,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:14:29,699 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-25 17:14:29,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:14:29,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:14:29,699 INFO L130 BoogieDeclarations]: Found specification of procedure t3_fun [2022-11-25 17:14:29,700 INFO L138 BoogieDeclarations]: Found implementation of procedure t3_fun [2022-11-25 17:14:29,700 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-25 17:14:29,700 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-25 17:14:29,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:14:29,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:14:29,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:14:29,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:14:29,702 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 17:14:29,837 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:14:29,839 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:14:30,240 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:14:30,249 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:14:30,250 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:14:30,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:14:30 BoogieIcfgContainer [2022-11-25 17:14:30,252 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:14:30,255 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:14:30,255 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:14:30,263 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:14:30,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:14:28" (1/3) ... [2022-11-25 17:14:30,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3055eb0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:14:30, skipping insertion in model container [2022-11-25 17:14:30,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:14:29" (2/3) ... [2022-11-25 17:14:30,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3055eb0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:14:30, skipping insertion in model container [2022-11-25 17:14:30,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:14:30" (3/3) ... [2022-11-25 17:14:30,266 INFO L112 eAbstractionObserver]: Analyzing ICFG 36-apron_21-traces-cluster-based_true.i [2022-11-25 17:14:30,293 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:14:30,294 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-25 17:14:30,294 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:14:30,406 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:14:30,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 177 transitions, 369 flow [2022-11-25 17:14:30,524 INFO L130 PetriNetUnfolder]: 5/174 cut-off events. [2022-11-25 17:14:30,524 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:14:30,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 174 events. 5/174 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 284 event pairs, 0 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 134. Up to 2 conditions per place. [2022-11-25 17:14:30,543 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 177 transitions, 369 flow [2022-11-25 17:14:30,549 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 179 places, 174 transitions, 357 flow [2022-11-25 17:14:30,553 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:14:30,577 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 174 transitions, 357 flow [2022-11-25 17:14:30,580 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 174 transitions, 357 flow [2022-11-25 17:14:30,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 174 transitions, 357 flow [2022-11-25 17:14:30,659 INFO L130 PetriNetUnfolder]: 5/174 cut-off events. [2022-11-25 17:14:30,659 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:14:30,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 174 events. 5/174 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 284 event pairs, 0 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 134. Up to 2 conditions per place. [2022-11-25 17:14:30,696 INFO L119 LiptonReduction]: Number of co-enabled transitions 10466 [2022-11-25 17:14:37,963 INFO L134 LiptonReduction]: Checked pairs total: 22587 [2022-11-25 17:14:37,964 INFO L136 LiptonReduction]: Total number of compositions: 181 [2022-11-25 17:14:37,992 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:14:38,003 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;@10f54d7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:14:38,004 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-25 17:14:38,007 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-11-25 17:14:38,007 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:14:38,007 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:14:38,009 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 17:14:38,010 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:14:38,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:14:38,016 INFO L85 PathProgramCache]: Analyzing trace with hash 660, now seen corresponding path program 1 times [2022-11-25 17:14:38,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:14:38,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456379389] [2022-11-25 17:14:38,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:14:38,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:14:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:38,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:14:38,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:14:38,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456379389] [2022-11-25 17:14:38,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456379389] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:14:38,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:14:38,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 17:14:38,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693041019] [2022-11-25 17:14:38,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:14:38,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:14:38,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:14:38,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:14:38,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:14:38,202 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 358 [2022-11-25 17:14:38,205 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 99 flow. Second operand has 2 states, 2 states have (on average 166.5) internal successors, (333), 2 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:38,205 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:14:38,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 358 [2022-11-25 17:14:38,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:14:38,893 INFO L130 PetriNetUnfolder]: 3606/5407 cut-off events. [2022-11-25 17:14:38,893 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-11-25 17:14:38,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10551 conditions, 5407 events. 3606/5407 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 32657 event pairs, 3312 based on Foata normal form. 0/3989 useless extension candidates. Maximal degree in co-relation 10540. Up to 5078 conditions per place. [2022-11-25 17:14:38,938 INFO L137 encePairwiseOnDemand]: 355/358 looper letters, 32 selfloop transitions, 0 changer transitions 0/42 dead transitions. [2022-11-25 17:14:38,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 42 transitions, 157 flow [2022-11-25 17:14:38,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:14:38,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 17:14:38,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 367 transitions. [2022-11-25 17:14:38,960 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5125698324022346 [2022-11-25 17:14:38,961 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 367 transitions. [2022-11-25 17:14:38,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 367 transitions. [2022-11-25 17:14:38,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:14:38,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 367 transitions. [2022-11-25 17:14:38,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 183.5) internal successors, (367), 2 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:38,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 358.0) internal successors, (1074), 3 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:38,983 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 358.0) internal successors, (1074), 3 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:38,985 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 99 flow. Second operand 2 states and 367 transitions. [2022-11-25 17:14:38,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 42 transitions, 157 flow [2022-11-25 17:14:38,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 42 transitions, 154 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 17:14:38,992 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 90 flow [2022-11-25 17:14:38,995 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=90, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2022-11-25 17:14:39,001 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -4 predicate places. [2022-11-25 17:14:39,002 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 90 flow [2022-11-25 17:14:39,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 166.5) internal successors, (333), 2 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:39,003 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:14:39,003 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 17:14:39,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:14:39,004 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:14:39,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:14:39,005 INFO L85 PathProgramCache]: Analyzing trace with hash 646821, now seen corresponding path program 1 times [2022-11-25 17:14:39,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:14:39,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41963642] [2022-11-25 17:14:39,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:14:39,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:14:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:39,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:14:39,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:14:39,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41963642] [2022-11-25 17:14:39,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41963642] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:14:39,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:14:39,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:14:39,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727679972] [2022-11-25 17:14:39,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:14:39,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:14:39,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:14:39,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:14:39,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:14:39,391 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 358 [2022-11-25 17:14:39,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:39,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:14:39,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 358 [2022-11-25 17:14:39,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:14:40,064 INFO L130 PetriNetUnfolder]: 3601/5397 cut-off events. [2022-11-25 17:14:40,065 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:14:40,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10529 conditions, 5397 events. 3601/5397 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 32548 event pairs, 2578 based on Foata normal form. 0/3988 useless extension candidates. Maximal degree in co-relation 10526. Up to 3977 conditions per place. [2022-11-25 17:14:40,102 INFO L137 encePairwiseOnDemand]: 354/358 looper letters, 42 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2022-11-25 17:14:40,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 55 transitions, 206 flow [2022-11-25 17:14:40,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:14:40,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:14:40,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions. [2022-11-25 17:14:40,106 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48417132216014896 [2022-11-25 17:14:40,106 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 520 transitions. [2022-11-25 17:14:40,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 520 transitions. [2022-11-25 17:14:40,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:14:40,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 520 transitions. [2022-11-25 17:14:40,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:40,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:40,114 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:40,114 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 90 flow. Second operand 3 states and 520 transitions. [2022-11-25 17:14:40,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 55 transitions, 206 flow [2022-11-25 17:14:40,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 55 transitions, 206 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:14:40,117 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 94 flow [2022-11-25 17:14:40,117 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2022-11-25 17:14:40,118 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2022-11-25 17:14:40,118 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 94 flow [2022-11-25 17:14:40,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:40,119 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:14:40,119 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 17:14:40,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:14:40,120 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:14:40,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:14:40,123 INFO L85 PathProgramCache]: Analyzing trace with hash 646820, now seen corresponding path program 1 times [2022-11-25 17:14:40,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:14:40,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003994001] [2022-11-25 17:14:40,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:14:40,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:14:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:40,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:14:40,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:14:40,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003994001] [2022-11-25 17:14:40,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003994001] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:14:40,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:14:40,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:14:40,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832352907] [2022-11-25 17:14:40,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:14:40,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:14:40,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:14:40,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:14:40,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:14:40,396 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 358 [2022-11-25 17:14:40,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:40,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:14:40,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 358 [2022-11-25 17:14:40,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:14:41,032 INFO L130 PetriNetUnfolder]: 3596/5387 cut-off events. [2022-11-25 17:14:41,033 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:14:41,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10811 conditions, 5387 events. 3596/5387 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 32496 event pairs, 2574 based on Foata normal form. 0/4137 useless extension candidates. Maximal degree in co-relation 10807. Up to 3967 conditions per place. [2022-11-25 17:14:41,077 INFO L137 encePairwiseOnDemand]: 354/358 looper letters, 41 selfloop transitions, 3 changer transitions 0/54 dead transitions. [2022-11-25 17:14:41,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 54 transitions, 208 flow [2022-11-25 17:14:41,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:14:41,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:14:41,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 531 transitions. [2022-11-25 17:14:41,079 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49441340782122906 [2022-11-25 17:14:41,079 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 531 transitions. [2022-11-25 17:14:41,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 531 transitions. [2022-11-25 17:14:41,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:14:41,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 531 transitions. [2022-11-25 17:14:41,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:41,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:41,084 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:41,084 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 94 flow. Second operand 3 states and 531 transitions. [2022-11-25 17:14:41,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 54 transitions, 208 flow [2022-11-25 17:14:41,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 54 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:14:41,108 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 92 flow [2022-11-25 17:14:41,108 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2022-11-25 17:14:41,110 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -4 predicate places. [2022-11-25 17:14:41,110 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 92 flow [2022-11-25 17:14:41,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:41,111 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:14:41,111 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 17:14:41,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:14:41,111 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:14:41,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:14:41,112 INFO L85 PathProgramCache]: Analyzing trace with hash 621610340, now seen corresponding path program 1 times [2022-11-25 17:14:41,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:14:41,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255428843] [2022-11-25 17:14:41,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:14:41,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:14:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:41,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:14:41,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:14:41,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255428843] [2022-11-25 17:14:41,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255428843] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:14:41,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:14:41,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:14:41,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010021997] [2022-11-25 17:14:41,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:14:41,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:14:41,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:14:41,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:14:41,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:14:41,285 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 358 [2022-11-25 17:14:41,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:41,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:14:41,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 358 [2022-11-25 17:14:41,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:14:41,861 INFO L130 PetriNetUnfolder]: 3551/5312 cut-off events. [2022-11-25 17:14:41,861 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:14:41,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10666 conditions, 5312 events. 3551/5312 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 31942 event pairs, 2534 based on Foata normal form. 0/4098 useless extension candidates. Maximal degree in co-relation 10662. Up to 3897 conditions per place. [2022-11-25 17:14:41,890 INFO L137 encePairwiseOnDemand]: 354/358 looper letters, 40 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2022-11-25 17:14:41,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 204 flow [2022-11-25 17:14:41,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:14:41,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:14:41,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2022-11-25 17:14:41,893 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4823091247672253 [2022-11-25 17:14:41,893 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 518 transitions. [2022-11-25 17:14:41,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 518 transitions. [2022-11-25 17:14:41,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:14:41,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 518 transitions. [2022-11-25 17:14:41,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:41,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:41,899 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:41,899 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 92 flow. Second operand 3 states and 518 transitions. [2022-11-25 17:14:41,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 204 flow [2022-11-25 17:14:41,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 53 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:14:41,915 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 90 flow [2022-11-25 17:14:41,915 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2022-11-25 17:14:41,916 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2022-11-25 17:14:41,916 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 90 flow [2022-11-25 17:14:41,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:41,917 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:14:41,917 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 17:14:41,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:14:41,917 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:14:41,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:14:41,918 INFO L85 PathProgramCache]: Analyzing trace with hash 621610341, now seen corresponding path program 1 times [2022-11-25 17:14:41,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:14:41,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402343494] [2022-11-25 17:14:41,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:14:41,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:14:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:42,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:14:42,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:14:42,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402343494] [2022-11-25 17:14:42,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402343494] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:14:42,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:14:42,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:14:42,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453158431] [2022-11-25 17:14:42,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:14:42,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:14:42,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:14:42,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:14:42,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:14:42,042 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 358 [2022-11-25 17:14:42,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:42,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:14:42,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 358 [2022-11-25 17:14:42,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:14:42,663 INFO L130 PetriNetUnfolder]: 3506/5237 cut-off events. [2022-11-25 17:14:42,663 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:14:42,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10521 conditions, 5237 events. 3506/5237 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 31533 event pairs, 2494 based on Foata normal form. 0/4059 useless extension candidates. Maximal degree in co-relation 10517. Up to 3827 conditions per place. [2022-11-25 17:14:42,689 INFO L137 encePairwiseOnDemand]: 354/358 looper letters, 39 selfloop transitions, 3 changer transitions 0/52 dead transitions. [2022-11-25 17:14:42,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 52 transitions, 200 flow [2022-11-25 17:14:42,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:14:42,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:14:42,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 529 transitions. [2022-11-25 17:14:42,692 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4925512104283054 [2022-11-25 17:14:42,692 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 529 transitions. [2022-11-25 17:14:42,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 529 transitions. [2022-11-25 17:14:42,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:14:42,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 529 transitions. [2022-11-25 17:14:42,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:42,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:42,697 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:42,697 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 90 flow. Second operand 3 states and 529 transitions. [2022-11-25 17:14:42,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 52 transitions, 200 flow [2022-11-25 17:14:42,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 52 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:14:42,713 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 88 flow [2022-11-25 17:14:42,713 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2022-11-25 17:14:42,714 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2022-11-25 17:14:42,714 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 88 flow [2022-11-25 17:14:42,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:42,715 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:14:42,715 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:14:42,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:14:42,715 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:14:42,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:14:42,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1503593343, now seen corresponding path program 1 times [2022-11-25 17:14:42,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:14:42,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077265638] [2022-11-25 17:14:42,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:14:42,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:14:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:42,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:14:42,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:14:42,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077265638] [2022-11-25 17:14:42,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077265638] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:14:42,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:14:42,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:14:42,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750176440] [2022-11-25 17:14:42,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:14:42,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:14:42,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:14:42,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:14:42,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:14:42,847 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 358 [2022-11-25 17:14:42,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 158.6) internal successors, (793), 5 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:42,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:14:42,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 358 [2022-11-25 17:14:42,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:14:43,962 INFO L130 PetriNetUnfolder]: 5968/9086 cut-off events. [2022-11-25 17:14:43,963 INFO L131 PetriNetUnfolder]: For 234/234 co-relation queries the response was YES. [2022-11-25 17:14:43,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18240 conditions, 9086 events. 5968/9086 cut-off events. For 234/234 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 60328 event pairs, 1135 based on Foata normal form. 0/7498 useless extension candidates. Maximal degree in co-relation 18236. Up to 3821 conditions per place. [2022-11-25 17:14:44,013 INFO L137 encePairwiseOnDemand]: 351/358 looper letters, 130 selfloop transitions, 10 changer transitions 0/148 dead transitions. [2022-11-25 17:14:44,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 148 transitions, 626 flow [2022-11-25 17:14:44,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:14:44,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 17:14:44,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1399 transitions. [2022-11-25 17:14:44,018 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4884776536312849 [2022-11-25 17:14:44,018 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1399 transitions. [2022-11-25 17:14:44,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1399 transitions. [2022-11-25 17:14:44,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:14:44,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1399 transitions. [2022-11-25 17:14:44,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 174.875) internal successors, (1399), 8 states have internal predecessors, (1399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:44,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 358.0) internal successors, (3222), 9 states have internal predecessors, (3222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:44,029 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 358.0) internal successors, (3222), 9 states have internal predecessors, (3222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:44,030 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 88 flow. Second operand 8 states and 1399 transitions. [2022-11-25 17:14:44,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 148 transitions, 626 flow [2022-11-25 17:14:44,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 148 transitions, 596 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:14:44,039 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 151 flow [2022-11-25 17:14:44,039 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=151, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2022-11-25 17:14:44,040 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 5 predicate places. [2022-11-25 17:14:44,040 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 151 flow [2022-11-25 17:14:44,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 158.6) internal successors, (793), 5 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:44,041 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:14:44,041 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:14:44,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:14:44,041 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:14:44,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:14:44,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1260430681, now seen corresponding path program 1 times [2022-11-25 17:14:44,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:14:44,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329915195] [2022-11-25 17:14:44,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:14:44,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:14:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:44,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:14:44,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:14:44,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329915195] [2022-11-25 17:14:44,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329915195] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:14:44,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:14:44,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:14:44,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831236271] [2022-11-25 17:14:44,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:14:44,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:14:44,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:14:44,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:14:44,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:14:44,247 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 358 [2022-11-25 17:14:44,248 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 158.0) internal successors, (790), 5 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:44,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:14:44,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 358 [2022-11-25 17:14:44,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:14:45,569 INFO L130 PetriNetUnfolder]: 7109/10608 cut-off events. [2022-11-25 17:14:45,569 INFO L131 PetriNetUnfolder]: For 7391/7790 co-relation queries the response was YES. [2022-11-25 17:14:45,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26366 conditions, 10608 events. 7109/10608 cut-off events. For 7391/7790 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 67790 event pairs, 939 based on Foata normal form. 171/9278 useless extension candidates. Maximal degree in co-relation 26357. Up to 3852 conditions per place. [2022-11-25 17:14:45,647 INFO L137 encePairwiseOnDemand]: 351/358 looper letters, 112 selfloop transitions, 20 changer transitions 0/141 dead transitions. [2022-11-25 17:14:45,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 141 transitions, 721 flow [2022-11-25 17:14:45,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:14:45,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 17:14:45,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1365 transitions. [2022-11-25 17:14:45,652 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47660614525139666 [2022-11-25 17:14:45,652 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1365 transitions. [2022-11-25 17:14:45,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1365 transitions. [2022-11-25 17:14:45,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:14:45,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1365 transitions. [2022-11-25 17:14:45,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 170.625) internal successors, (1365), 8 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:45,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 358.0) internal successors, (3222), 9 states have internal predecessors, (3222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:45,663 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 358.0) internal successors, (3222), 9 states have internal predecessors, (3222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:45,663 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 151 flow. Second operand 8 states and 1365 transitions. [2022-11-25 17:14:45,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 141 transitions, 721 flow [2022-11-25 17:14:45,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 141 transitions, 721 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:14:45,757 INFO L231 Difference]: Finished difference. Result has 71 places, 62 transitions, 328 flow [2022-11-25 17:14:45,757 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=328, PETRI_PLACES=71, PETRI_TRANSITIONS=62} [2022-11-25 17:14:45,758 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 18 predicate places. [2022-11-25 17:14:45,758 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 62 transitions, 328 flow [2022-11-25 17:14:45,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 158.0) internal successors, (790), 5 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:45,759 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:14:45,759 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:14:45,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:14:45,759 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:14:45,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:14:45,760 INFO L85 PathProgramCache]: Analyzing trace with hash -425578914, now seen corresponding path program 1 times [2022-11-25 17:14:45,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:14:45,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405971385] [2022-11-25 17:14:45,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:14:45,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:14:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:45,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:14:45,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:14:45,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405971385] [2022-11-25 17:14:45,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405971385] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:14:45,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:14:45,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:14:45,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411531856] [2022-11-25 17:14:45,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:14:45,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:14:45,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:14:45,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:14:45,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:14:45,876 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 358 [2022-11-25 17:14:45,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:45,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:14:45,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 358 [2022-11-25 17:14:45,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:14:46,695 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [154#t3_funEXITtrue, 240#true, 14#L694true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 222#true, Black: 232#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), 48#L736true, Black: 206#(<= ~h~0 ~g~0), Black: 204#true, 176#t2_funEXITtrue, 226#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-11-25 17:14:46,695 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-25 17:14:46,695 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:14:46,696 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:14:46,696 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:14:46,696 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [240#true, 104#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 14#L694true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 222#true, Black: 232#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), 48#L736true, Black: 206#(<= ~h~0 ~g~0), Black: 204#true, 176#t2_funEXITtrue, 226#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-11-25 17:14:46,696 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-25 17:14:46,696 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:14:46,696 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:14:46,696 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:14:46,827 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [154#t3_funEXITtrue, 240#true, 14#L694true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 222#true, Black: 232#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), 48#L736true, Black: 206#(<= ~h~0 ~g~0), Black: 204#true, 176#t2_funEXITtrue, 226#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-11-25 17:14:46,827 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-25 17:14:46,827 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:14:46,827 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:14:46,827 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:14:46,827 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:14:46,828 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [240#true, 104#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 14#L694true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 222#true, Black: 232#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), 48#L736true, Black: 206#(<= ~h~0 ~g~0), 226#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 204#true, 176#t2_funEXITtrue, Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-11-25 17:14:46,828 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-25 17:14:46,828 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:14:46,828 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:14:46,828 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:14:46,828 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:14:46,834 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [154#t3_funEXITtrue, 240#true, 14#L694true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 222#true, Black: 232#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 206#(<= ~h~0 ~g~0), Black: 204#true, 176#t2_funEXITtrue, 226#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 127#L737-2true, Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-11-25 17:14:46,834 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-25 17:14:46,834 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:14:46,835 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:14:46,835 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:14:46,837 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [240#true, 104#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 14#L694true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 222#true, Black: 232#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 206#(<= ~h~0 ~g~0), Black: 204#true, 176#t2_funEXITtrue, 226#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 127#L737-2true, Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-11-25 17:14:46,837 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-25 17:14:46,837 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:14:46,837 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:14:46,837 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:14:46,904 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [154#t3_funEXITtrue, 240#true, 14#L694true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 222#true, Black: 232#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 206#(<= ~h~0 ~g~0), 176#t2_funEXITtrue, 226#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 127#L737-2true, Black: 204#true, Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-11-25 17:14:46,904 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-25 17:14:46,905 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:14:46,905 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:14:46,905 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:14:46,905 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:14:46,906 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [240#true, 14#L694true, 104#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 222#true, Black: 232#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 206#(<= ~h~0 ~g~0), 176#t2_funEXITtrue, 226#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 127#L737-2true, Black: 204#true, Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-11-25 17:14:46,907 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-25 17:14:46,907 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:14:46,907 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:14:46,907 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:14:46,907 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:14:46,912 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [154#t3_funEXITtrue, 240#true, 2#ULTIMATE.startEXITtrue, 14#L694true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 222#true, Black: 232#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 206#(<= ~h~0 ~g~0), Black: 204#true, 176#t2_funEXITtrue, 226#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-11-25 17:14:46,912 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,913 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,913 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,913 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,913 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [154#t3_funEXITtrue, 240#true, 14#L694true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 222#true, Black: 232#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 206#(<= ~h~0 ~g~0), Black: 204#true, 176#t2_funEXITtrue, 226#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 82#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-11-25 17:14:46,913 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,913 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,914 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,914 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,914 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [154#t3_funEXITtrue, 240#true, 14#L694true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), 43#ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 230#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 222#true, Black: 232#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 206#(<= ~h~0 ~g~0), Black: 204#true, 176#t2_funEXITtrue, 226#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-11-25 17:14:46,914 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,914 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,914 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,914 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,915 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [240#true, 2#ULTIMATE.startEXITtrue, 104#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 14#L694true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 222#true, Black: 232#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 206#(<= ~h~0 ~g~0), Black: 204#true, 176#t2_funEXITtrue, 226#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-11-25 17:14:46,915 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,915 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,915 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,916 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,916 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [240#true, 104#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 14#L694true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 222#true, Black: 232#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 206#(<= ~h~0 ~g~0), Black: 204#true, 176#t2_funEXITtrue, 226#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 82#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-11-25 17:14:46,916 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,916 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,916 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,916 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,917 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [240#true, 104#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 14#L694true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), 43#ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 230#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 222#true, Black: 232#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 206#(<= ~h~0 ~g~0), Black: 204#true, 176#t2_funEXITtrue, 226#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-11-25 17:14:46,917 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,917 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,917 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,917 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,981 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [154#t3_funEXITtrue, 240#true, 2#ULTIMATE.startEXITtrue, 14#L694true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 222#true, Black: 232#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 206#(<= ~h~0 ~g~0), 176#t2_funEXITtrue, 226#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 204#true, Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-11-25 17:14:46,981 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,981 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,981 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,981 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,981 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,982 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [154#t3_funEXITtrue, 240#true, 14#L694true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 222#true, Black: 232#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 206#(<= ~h~0 ~g~0), 176#t2_funEXITtrue, 226#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 82#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 204#true, Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-11-25 17:14:46,982 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,982 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,982 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,982 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,982 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,983 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [154#t3_funEXITtrue, 240#true, 14#L694true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 43#ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 222#true, Black: 232#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 206#(<= ~h~0 ~g~0), 176#t2_funEXITtrue, 226#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 204#true, Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-11-25 17:14:46,983 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,983 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,983 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,983 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,983 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,983 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [240#true, 2#ULTIMATE.startEXITtrue, 14#L694true, 104#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 222#true, Black: 232#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 206#(<= ~h~0 ~g~0), 176#t2_funEXITtrue, 226#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 204#true, Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-11-25 17:14:46,983 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,984 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,984 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,984 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,984 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,984 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [240#true, 14#L694true, 104#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 222#true, Black: 232#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 206#(<= ~h~0 ~g~0), 176#t2_funEXITtrue, 226#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 82#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 204#true, Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-11-25 17:14:46,984 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,984 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,985 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,985 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,985 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,985 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [240#true, 14#L694true, 104#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), 43#ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 230#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 222#true, Black: 232#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 206#(<= ~h~0 ~g~0), 176#t2_funEXITtrue, 226#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 204#true, Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-11-25 17:14:46,986 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,986 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,986 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,986 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:46,986 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:14:47,082 INFO L130 PetriNetUnfolder]: 6445/10877 cut-off events. [2022-11-25 17:14:47,082 INFO L131 PetriNetUnfolder]: For 8710/9103 co-relation queries the response was YES. [2022-11-25 17:14:47,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27542 conditions, 10877 events. 6445/10877 cut-off events. For 8710/9103 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 78850 event pairs, 2858 based on Foata normal form. 1193/10113 useless extension candidates. Maximal degree in co-relation 27527. Up to 6191 conditions per place. [2022-11-25 17:14:47,146 INFO L137 encePairwiseOnDemand]: 343/358 looper letters, 60 selfloop transitions, 16 changer transitions 0/93 dead transitions. [2022-11-25 17:14:47,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 93 transitions, 600 flow [2022-11-25 17:14:47,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:14:47,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:14:47,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions. [2022-11-25 17:14:47,148 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48417132216014896 [2022-11-25 17:14:47,148 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 520 transitions. [2022-11-25 17:14:47,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 520 transitions. [2022-11-25 17:14:47,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:14:47,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 520 transitions. [2022-11-25 17:14:47,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:47,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:47,152 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:47,153 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 328 flow. Second operand 3 states and 520 transitions. [2022-11-25 17:14:47,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 93 transitions, 600 flow [2022-11-25 17:14:47,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 93 transitions, 596 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-11-25 17:14:47,265 INFO L231 Difference]: Finished difference. Result has 74 places, 71 transitions, 410 flow [2022-11-25 17:14:47,266 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=410, PETRI_PLACES=74, PETRI_TRANSITIONS=71} [2022-11-25 17:14:47,266 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 21 predicate places. [2022-11-25 17:14:47,266 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 71 transitions, 410 flow [2022-11-25 17:14:47,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:47,267 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:14:47,267 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:14:47,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:14:47,267 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:14:47,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:14:47,268 INFO L85 PathProgramCache]: Analyzing trace with hash 2109985422, now seen corresponding path program 1 times [2022-11-25 17:14:47,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:14:47,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857827893] [2022-11-25 17:14:47,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:14:47,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:14:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:47,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:14:47,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:14:47,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857827893] [2022-11-25 17:14:47,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857827893] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:14:47,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:14:47,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:14:47,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67003750] [2022-11-25 17:14:47,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:14:47,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:14:47,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:14:47,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:14:47,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:14:47,425 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 358 [2022-11-25 17:14:47,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 71 transitions, 410 flow. Second operand has 5 states, 5 states have (on average 159.2) internal successors, (796), 5 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:47,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:14:47,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 358 [2022-11-25 17:14:47,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:14:48,787 INFO L130 PetriNetUnfolder]: 6694/11200 cut-off events. [2022-11-25 17:14:48,787 INFO L131 PetriNetUnfolder]: For 17084/17577 co-relation queries the response was YES. [2022-11-25 17:14:48,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36170 conditions, 11200 events. 6694/11200 cut-off events. For 17084/17577 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 78720 event pairs, 2311 based on Foata normal form. 186/9570 useless extension candidates. Maximal degree in co-relation 36153. Up to 4807 conditions per place. [2022-11-25 17:14:48,866 INFO L137 encePairwiseOnDemand]: 351/358 looper letters, 132 selfloop transitions, 31 changer transitions 0/179 dead transitions. [2022-11-25 17:14:48,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 179 transitions, 1309 flow [2022-11-25 17:14:48,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:14:48,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 17:14:48,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1366 transitions. [2022-11-25 17:14:48,871 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47695530726256985 [2022-11-25 17:14:48,871 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1366 transitions. [2022-11-25 17:14:48,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1366 transitions. [2022-11-25 17:14:48,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:14:48,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1366 transitions. [2022-11-25 17:14:48,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 170.75) internal successors, (1366), 8 states have internal predecessors, (1366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:48,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 358.0) internal successors, (3222), 9 states have internal predecessors, (3222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:48,882 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 358.0) internal successors, (3222), 9 states have internal predecessors, (3222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:48,882 INFO L175 Difference]: Start difference. First operand has 74 places, 71 transitions, 410 flow. Second operand 8 states and 1366 transitions. [2022-11-25 17:14:48,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 179 transitions, 1309 flow [2022-11-25 17:14:49,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 179 transitions, 1261 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:14:49,014 INFO L231 Difference]: Finished difference. Result has 86 places, 90 transitions, 701 flow [2022-11-25 17:14:49,014 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=701, PETRI_PLACES=86, PETRI_TRANSITIONS=90} [2022-11-25 17:14:49,015 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 33 predicate places. [2022-11-25 17:14:49,016 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 90 transitions, 701 flow [2022-11-25 17:14:49,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 159.2) internal successors, (796), 5 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:49,016 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:14:49,017 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:14:49,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:14:49,018 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:14:49,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:14:49,019 INFO L85 PathProgramCache]: Analyzing trace with hash 232808425, now seen corresponding path program 1 times [2022-11-25 17:14:49,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:14:49,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899005319] [2022-11-25 17:14:49,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:14:49,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:14:49,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:49,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:14:49,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:14:49,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899005319] [2022-11-25 17:14:49,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899005319] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:14:49,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:14:49,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:14:49,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73865160] [2022-11-25 17:14:49,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:14:49,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:14:49,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:14:49,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:14:49,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:14:49,252 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 358 [2022-11-25 17:14:49,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 90 transitions, 701 flow. Second operand has 6 states, 6 states have (on average 157.83333333333334) internal successors, (947), 6 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:49,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:14:49,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 358 [2022-11-25 17:14:49,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:14:51,031 INFO L130 PetriNetUnfolder]: 8524/14114 cut-off events. [2022-11-25 17:14:51,031 INFO L131 PetriNetUnfolder]: For 30690/30977 co-relation queries the response was YES. [2022-11-25 17:14:51,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46950 conditions, 14114 events. 8524/14114 cut-off events. For 30690/30977 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 100626 event pairs, 2583 based on Foata normal form. 414/12589 useless extension candidates. Maximal degree in co-relation 46928. Up to 5676 conditions per place. [2022-11-25 17:14:51,153 INFO L137 encePairwiseOnDemand]: 352/358 looper letters, 166 selfloop transitions, 35 changer transitions 0/217 dead transitions. [2022-11-25 17:14:51,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 217 transitions, 1721 flow [2022-11-25 17:14:51,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:14:51,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:14:51,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1216 transitions. [2022-11-25 17:14:51,157 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4852354349561053 [2022-11-25 17:14:51,158 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1216 transitions. [2022-11-25 17:14:51,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1216 transitions. [2022-11-25 17:14:51,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:14:51,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1216 transitions. [2022-11-25 17:14:51,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 173.71428571428572) internal successors, (1216), 7 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:51,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 358.0) internal successors, (2864), 8 states have internal predecessors, (2864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:51,167 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 358.0) internal successors, (2864), 8 states have internal predecessors, (2864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:51,167 INFO L175 Difference]: Start difference. First operand has 86 places, 90 transitions, 701 flow. Second operand 7 states and 1216 transitions. [2022-11-25 17:14:51,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 217 transitions, 1721 flow [2022-11-25 17:14:51,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 217 transitions, 1715 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-11-25 17:14:51,758 INFO L231 Difference]: Finished difference. Result has 96 places, 94 transitions, 812 flow [2022-11-25 17:14:51,758 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=812, PETRI_PLACES=96, PETRI_TRANSITIONS=94} [2022-11-25 17:14:51,759 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 43 predicate places. [2022-11-25 17:14:51,759 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 94 transitions, 812 flow [2022-11-25 17:14:51,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 157.83333333333334) internal successors, (947), 6 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:51,759 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:14:51,760 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:14:51,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:14:51,760 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:14:51,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:14:51,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1408859294, now seen corresponding path program 1 times [2022-11-25 17:14:51,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:14:51,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231919723] [2022-11-25 17:14:51,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:14:51,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:14:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:52,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:14:52,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:14:52,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231919723] [2022-11-25 17:14:52,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231919723] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:14:52,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:14:52,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:14:52,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913011196] [2022-11-25 17:14:52,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:14:52,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:14:52,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:14:52,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:14:52,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:14:52,299 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 358 [2022-11-25 17:14:52,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 94 transitions, 812 flow. Second operand has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:52,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:14:52,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 358 [2022-11-25 17:14:52,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:14:53,229 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([504] L704-1-->L706: Formula: (= v_~g~0_10 |v_t2_funThread1of1ForFork0_~x~1#1_11|) InVars {~g~0=v_~g~0_10} OutVars{t2_funThread1of1ForFork0_~x~1#1=|v_t2_funThread1of1ForFork0_~x~1#1_11|, t2_funThread1of1ForFork0_#t~nondet7#1=|v_t2_funThread1of1ForFork0_#t~nondet7#1_7|, ~g~0=v_~g~0_10} AuxVars[] AssignedVars[t2_funThread1of1ForFork0_~x~1#1, t2_funThread1of1ForFork0_#t~nondet7#1][87], [Black: 253#(and (<= ~g~0 ~h~0) (<= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|) (< |t3_funThread1of1ForFork2_~y~1#1| (+ |t3_funThread1of1ForFork2_~x~2#1| 1)) (<= ~h~0 |t3_funThread1of1ForFork2_~x~2#1|) (<= ~h~0 ~g~0) (<= |t3_funThread1of1ForFork2_~x~2#1| ~h~0)), Black: 248#(and (<= ~h~0 |t3_funThread1of1ForFork2_~x~2#1|) (<= |t3_funThread1of1ForFork2_~x~2#1| ~h~0)), 154#t3_funEXITtrue, Black: 247#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 255#(and (<= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|) (< |t3_funThread1of1ForFork2_~y~1#1| (+ |t3_funThread1of1ForFork2_~x~2#1| 1)) (<= ~h~0 |t3_funThread1of1ForFork2_~x~2#1|) (<= |t3_funThread1of1ForFork2_~x~2#1| ~h~0)), 2#ULTIMATE.startEXITtrue, Black: 245#true, 283#true, 273#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork0_~x~1#1|)), 124#L693true, 185#true, Black: 277#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ |t2_funThread1of1ForFork0_~y~0#1| 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 275#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork0_~x~1#1|) (<= (+ |t2_funThread1of1ForFork0_~y~0#1| 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 270#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0)), Black: 206#(<= ~h~0 ~g~0), 226#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), 121#L706true, 204#true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 222#true, Black: 232#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), t_funThread1of1ForFork1InUse, Black: 242#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1), t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, 249#(and (<= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|) (< |t3_funThread1of1ForFork2_~y~1#1| (+ |t3_funThread1of1ForFork2_~x~2#1| 1)))]) [2022-11-25 17:14:53,229 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-25 17:14:53,229 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 17:14:53,230 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 17:14:53,230 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 17:14:53,243 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([504] L704-1-->L706: Formula: (= v_~g~0_10 |v_t2_funThread1of1ForFork0_~x~1#1_11|) InVars {~g~0=v_~g~0_10} OutVars{t2_funThread1of1ForFork0_~x~1#1=|v_t2_funThread1of1ForFork0_~x~1#1_11|, t2_funThread1of1ForFork0_#t~nondet7#1=|v_t2_funThread1of1ForFork0_#t~nondet7#1_7|, ~g~0=v_~g~0_10} AuxVars[] AssignedVars[t2_funThread1of1ForFork0_~x~1#1, t2_funThread1of1ForFork0_#t~nondet7#1][87], [Black: 253#(and (<= ~g~0 ~h~0) (<= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|) (< |t3_funThread1of1ForFork2_~y~1#1| (+ |t3_funThread1of1ForFork2_~x~2#1| 1)) (<= ~h~0 |t3_funThread1of1ForFork2_~x~2#1|) (<= ~h~0 ~g~0) (<= |t3_funThread1of1ForFork2_~x~2#1| ~h~0)), Black: 248#(and (<= ~h~0 |t3_funThread1of1ForFork2_~x~2#1|) (<= |t3_funThread1of1ForFork2_~x~2#1| ~h~0)), 154#t3_funEXITtrue, Black: 247#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 255#(and (<= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|) (< |t3_funThread1of1ForFork2_~y~1#1| (+ |t3_funThread1of1ForFork2_~x~2#1| 1)) (<= ~h~0 |t3_funThread1of1ForFork2_~x~2#1|) (<= |t3_funThread1of1ForFork2_~x~2#1| ~h~0)), 2#ULTIMATE.startEXITtrue, Black: 245#true, 283#true, 273#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork0_~x~1#1|)), 124#L693true, 185#true, Black: 277#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ |t2_funThread1of1ForFork0_~y~0#1| 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 275#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork0_~x~1#1|) (<= (+ |t2_funThread1of1ForFork0_~y~0#1| 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), 242#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 270#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0)), Black: 206#(<= ~h~0 ~g~0), 226#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), 121#L706true, 204#true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 222#true, Black: 232#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), t_funThread1of1ForFork1InUse, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, 249#(and (<= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|) (< |t3_funThread1of1ForFork2_~y~1#1| (+ |t3_funThread1of1ForFork2_~x~2#1| 1)))]) [2022-11-25 17:14:53,243 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-25 17:14:53,243 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 17:14:53,243 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 17:14:53,244 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 17:14:53,376 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([597] L719-->t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_t3_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1_31| (ite (= |v_t3_funThread1of1ForFork2_~x~2#1_37| |v_t3_funThread1of1ForFork2_~y~1#1_35|) 1 0)) (= (store |v_#pthreadsMutex_588| |v_~#B~0.base_175| (store (select |v_#pthreadsMutex_588| |v_~#B~0.base_175|) |v_~#B~0.offset_175| 0)) |v_#pthreadsMutex_587|) (= |v_t3_funThread1of1ForFork2___VERIFIER_assert_~cond#1_43| 0) (= |v_t3_funThread1of1ForFork2___VERIFIER_assert_~cond#1_43| |v_t3_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1_31|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_588|, ~#B~0.base=|v_~#B~0.base_175|, t3_funThread1of1ForFork2_~x~2#1=|v_t3_funThread1of1ForFork2_~x~2#1_37|, t3_funThread1of1ForFork2_~y~1#1=|v_t3_funThread1of1ForFork2_~y~1#1_35|, ~#B~0.offset=|v_~#B~0.offset_175|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_587|, ~#B~0.base=|v_~#B~0.base_175|, t3_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1=|v_t3_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1_31|, t3_funThread1of1ForFork2_~x~2#1=|v_t3_funThread1of1ForFork2_~x~2#1_37|, t3_funThread1of1ForFork2___VERIFIER_assert_~cond#1=|v_t3_funThread1of1ForFork2___VERIFIER_assert_~cond#1_43|, t3_funThread1of1ForFork2_~y~1#1=|v_t3_funThread1of1ForFork2_~y~1#1_35|, ~#B~0.offset=|v_~#B~0.offset_175|} AuxVars[] AssignedVars[#pthreadsMutex, t3_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1, t3_funThread1of1ForFork2___VERIFIER_assert_~cond#1][113], [Black: 253#(and (<= ~g~0 ~h~0) (<= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|) (< |t3_funThread1of1ForFork2_~y~1#1| (+ |t3_funThread1of1ForFork2_~x~2#1| 1)) (<= ~h~0 |t3_funThread1of1ForFork2_~x~2#1|) (<= ~h~0 ~g~0) (<= |t3_funThread1of1ForFork2_~x~2#1| ~h~0)), Black: 248#(and (<= ~h~0 |t3_funThread1of1ForFork2_~x~2#1|) (<= |t3_funThread1of1ForFork2_~x~2#1| ~h~0)), Black: 247#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 255#(and (<= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|) (< |t3_funThread1of1ForFork2_~y~1#1| (+ |t3_funThread1of1ForFork2_~x~2#1| 1)) (<= ~h~0 |t3_funThread1of1ForFork2_~x~2#1|) (<= |t3_funThread1of1ForFork2_~x~2#1| ~h~0)), 2#ULTIMATE.startEXITtrue, Black: 249#(and (<= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|) (< |t3_funThread1of1ForFork2_~y~1#1| (+ |t3_funThread1of1ForFork2_~x~2#1| 1))), 104#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 283#true, 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), 124#L693true, 185#true, Black: 277#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ |t2_funThread1of1ForFork0_~y~0#1| 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 275#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork0_~x~1#1|) (<= (+ |t2_funThread1of1ForFork0_~y~0#1| 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 273#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), 245#true, Black: 206#(<= ~h~0 ~g~0), 226#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 204#true, Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), 270#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0)), Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 222#true, Black: 232#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), t_funThread1of1ForFork1InUse, Black: 242#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1), t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, 176#t2_funEXITtrue]) [2022-11-25 17:14:53,376 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-25 17:14:53,376 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:14:53,377 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:14:53,377 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:14:53,683 INFO L130 PetriNetUnfolder]: 5314/9454 cut-off events. [2022-11-25 17:14:53,684 INFO L131 PetriNetUnfolder]: For 29168/29700 co-relation queries the response was YES. [2022-11-25 17:14:53,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33598 conditions, 9454 events. 5314/9454 cut-off events. For 29168/29700 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 71886 event pairs, 2532 based on Foata normal form. 232/8731 useless extension candidates. Maximal degree in co-relation 33571. Up to 5925 conditions per place. [2022-11-25 17:14:53,751 INFO L137 encePairwiseOnDemand]: 355/358 looper letters, 91 selfloop transitions, 2 changer transitions 0/128 dead transitions. [2022-11-25 17:14:53,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 128 transitions, 1290 flow [2022-11-25 17:14:53,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:14:53,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:14:53,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 516 transitions. [2022-11-25 17:14:53,754 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48044692737430167 [2022-11-25 17:14:53,754 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 516 transitions. [2022-11-25 17:14:53,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 516 transitions. [2022-11-25 17:14:53,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:14:53,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 516 transitions. [2022-11-25 17:14:53,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:53,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:53,759 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:53,759 INFO L175 Difference]: Start difference. First operand has 96 places, 94 transitions, 812 flow. Second operand 3 states and 516 transitions. [2022-11-25 17:14:53,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 128 transitions, 1290 flow [2022-11-25 17:14:53,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 128 transitions, 1219 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-11-25 17:14:53,905 INFO L231 Difference]: Finished difference. Result has 95 places, 93 transitions, 763 flow [2022-11-25 17:14:53,905 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=763, PETRI_PLACES=95, PETRI_TRANSITIONS=93} [2022-11-25 17:14:53,905 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 42 predicate places. [2022-11-25 17:14:53,906 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 93 transitions, 763 flow [2022-11-25 17:14:53,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:53,906 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:14:53,906 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:14:53,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:14:53,906 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:14:53,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:14:53,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1408859355, now seen corresponding path program 1 times [2022-11-25 17:14:53,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:14:53,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665818473] [2022-11-25 17:14:53,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:14:53,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:14:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:53,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:14:53,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:14:53,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665818473] [2022-11-25 17:14:53,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665818473] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:14:53,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:14:53,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:14:53,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112282509] [2022-11-25 17:14:53,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:14:53,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:14:53,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:14:53,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:14:53,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:14:53,978 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 358 [2022-11-25 17:14:53,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 93 transitions, 763 flow. Second operand has 4 states, 4 states have (on average 162.25) internal successors, (649), 4 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:53,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:14:53,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 358 [2022-11-25 17:14:53,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:14:54,913 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([541] L19-5-->L736: Formula: (= (store |v_#pthreadsMutex_266| |v_~#B~0.base_81| (store (select |v_#pthreadsMutex_266| |v_~#B~0.base_81|) |v_~#B~0.offset_81| 0)) |v_#pthreadsMutex_265|) InVars {#pthreadsMutex=|v_#pthreadsMutex_266|, ~#B~0.base=|v_~#B~0.base_81|, ~#B~0.offset=|v_~#B~0.offset_81|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_265|, ~#B~0.base=|v_~#B~0.base_81|, ~#B~0.offset=|v_~#B~0.offset_81|} AuxVars[] AssignedVars[#pthreadsMutex][76], [Black: 253#(and (<= ~g~0 ~h~0) (<= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|) (< |t3_funThread1of1ForFork2_~y~1#1| (+ |t3_funThread1of1ForFork2_~x~2#1| 1)) (<= ~h~0 |t3_funThread1of1ForFork2_~x~2#1|) (<= ~h~0 ~g~0) (<= |t3_funThread1of1ForFork2_~x~2#1| ~h~0)), Black: 248#(and (<= ~h~0 |t3_funThread1of1ForFork2_~x~2#1|) (<= |t3_funThread1of1ForFork2_~x~2#1| ~h~0)), 154#t3_funEXITtrue, Black: 247#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 255#(and (<= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|) (< |t3_funThread1of1ForFork2_~y~1#1| (+ |t3_funThread1of1ForFork2_~x~2#1| 1)) (<= ~h~0 |t3_funThread1of1ForFork2_~x~2#1|) (<= |t3_funThread1of1ForFork2_~x~2#1| ~h~0)), Black: 245#true, 292#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0)) (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), 185#true, Black: 277#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ |t2_funThread1of1ForFork0_~y~0#1| 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 275#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork0_~x~1#1|) (<= (+ |t2_funThread1of1ForFork0_~y~0#1| 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 273#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), 48#L736true, Black: 206#(<= ~h~0 ~g~0), 226#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 204#true, Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), 270#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0)), 285#(and (not (= |ULTIMATE.start_main_~#id~0#1.base| |ULTIMATE.start_main_~#id2~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#id2~0#1.base| 0) |ULTIMATE.start_main_~#id3~0#1.base| 0) |ULTIMATE.start_main_~#id~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#id3~0#1.base| |ULTIMATE.start_main_~#id2~0#1.base|)) (not (= |ULTIMATE.start_main_~#id~0#1.base| |ULTIMATE.start_main_~#id3~0#1.base|))), 14#L694true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 222#true, Black: 232#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), t_funThread1of1ForFork1InUse, Black: 242#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1), t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, 249#(and (<= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|) (< |t3_funThread1of1ForFork2_~y~1#1| (+ |t3_funThread1of1ForFork2_~x~2#1| 1))), 176#t2_funEXITtrue]) [2022-11-25 17:14:54,913 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-25 17:14:54,913 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:14:54,913 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:14:54,913 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:14:54,968 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([454] L694-1-->L696: Formula: (= v_t_funThread1of1ForFork1_~x~0_15 v_~h~0_7) InVars {t_funThread1of1ForFork1_~x~0=v_t_funThread1of1ForFork1_~x~0_15} OutVars{t_funThread1of1ForFork1_~x~0=v_t_funThread1of1ForFork1_~x~0_15, t_funThread1of1ForFork1_#t~nondet4=|v_t_funThread1of1ForFork1_#t~nondet4_7|, ~h~0=v_~h~0_7} AuxVars[] AssignedVars[t_funThread1of1ForFork1_#t~nondet4, ~h~0][80], [Black: 253#(and (<= ~g~0 ~h~0) (<= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|) (< |t3_funThread1of1ForFork2_~y~1#1| (+ |t3_funThread1of1ForFork2_~x~2#1| 1)) (<= ~h~0 |t3_funThread1of1ForFork2_~x~2#1|) (<= ~h~0 ~g~0) (<= |t3_funThread1of1ForFork2_~x~2#1| ~h~0)), Black: 248#(and (<= ~h~0 |t3_funThread1of1ForFork2_~x~2#1|) (<= |t3_funThread1of1ForFork2_~x~2#1| ~h~0)), Black: 247#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), 154#t3_funEXITtrue, Black: 255#(and (<= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|) (< |t3_funThread1of1ForFork2_~y~1#1| (+ |t3_funThread1of1ForFork2_~x~2#1| 1)) (<= ~h~0 |t3_funThread1of1ForFork2_~x~2#1|) (<= |t3_funThread1of1ForFork2_~x~2#1| ~h~0)), 292#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0)) (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 245#true, 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), 185#true, Black: 277#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ |t2_funThread1of1ForFork0_~y~0#1| 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 275#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork0_~x~1#1|) (<= (+ |t2_funThread1of1ForFork0_~y~0#1| 17) |t2_funThread1of1ForFork0_~x~1#1|)), 242#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1), Black: 273#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 270#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0)), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 206#(<= ~h~0 ~g~0), 226#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 204#true, Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), 285#(and (not (= |ULTIMATE.start_main_~#id~0#1.base| |ULTIMATE.start_main_~#id2~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#id2~0#1.base| 0) |ULTIMATE.start_main_~#id3~0#1.base| 0) |ULTIMATE.start_main_~#id~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#id3~0#1.base| |ULTIMATE.start_main_~#id2~0#1.base|)) (not (= |ULTIMATE.start_main_~#id~0#1.base| |ULTIMATE.start_main_~#id3~0#1.base|))), 80#L19-5true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 222#true, Black: 232#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), t_funThread1of1ForFork1InUse, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, 160#L696true, 249#(and (<= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|) (< |t3_funThread1of1ForFork2_~y~1#1| (+ |t3_funThread1of1ForFork2_~x~2#1| 1))), 176#t2_funEXITtrue]) [2022-11-25 17:14:54,968 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-25 17:14:54,969 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:14:54,969 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:14:54,969 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:14:55,193 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([541] L19-5-->L736: Formula: (= (store |v_#pthreadsMutex_266| |v_~#B~0.base_81| (store (select |v_#pthreadsMutex_266| |v_~#B~0.base_81|) |v_~#B~0.offset_81| 0)) |v_#pthreadsMutex_265|) InVars {#pthreadsMutex=|v_#pthreadsMutex_266|, ~#B~0.base=|v_~#B~0.base_81|, ~#B~0.offset=|v_~#B~0.offset_81|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_265|, ~#B~0.base=|v_~#B~0.base_81|, ~#B~0.offset=|v_~#B~0.offset_81|} AuxVars[] AssignedVars[#pthreadsMutex][31], [Black: 253#(and (<= ~g~0 ~h~0) (<= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|) (< |t3_funThread1of1ForFork2_~y~1#1| (+ |t3_funThread1of1ForFork2_~x~2#1| 1)) (<= ~h~0 |t3_funThread1of1ForFork2_~x~2#1|) (<= ~h~0 ~g~0) (<= |t3_funThread1of1ForFork2_~x~2#1| ~h~0)), Black: 248#(and (<= ~h~0 |t3_funThread1of1ForFork2_~x~2#1|) (<= |t3_funThread1of1ForFork2_~x~2#1| ~h~0)), Black: 247#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), 154#t3_funEXITtrue, Black: 255#(and (<= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|) (< |t3_funThread1of1ForFork2_~y~1#1| (+ |t3_funThread1of1ForFork2_~x~2#1| 1)) (<= ~h~0 |t3_funThread1of1ForFork2_~x~2#1|) (<= |t3_funThread1of1ForFork2_~x~2#1| ~h~0)), 292#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0)) (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 245#true, 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), 185#true, Black: 277#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ |t2_funThread1of1ForFork0_~y~0#1| 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 275#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork0_~x~1#1|) (<= (+ |t2_funThread1of1ForFork0_~y~0#1| 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 273#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), 48#L736true, Black: 206#(<= ~h~0 ~g~0), 226#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 204#true, Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), 270#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0)), 285#(and (not (= |ULTIMATE.start_main_~#id~0#1.base| |ULTIMATE.start_main_~#id2~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#id2~0#1.base| 0) |ULTIMATE.start_main_~#id3~0#1.base| 0) |ULTIMATE.start_main_~#id~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#id3~0#1.base| |ULTIMATE.start_main_~#id2~0#1.base|)) (not (= |ULTIMATE.start_main_~#id~0#1.base| |ULTIMATE.start_main_~#id3~0#1.base|))), 6#L694-1true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 222#true, Black: 232#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), t_funThread1of1ForFork1InUse, Black: 242#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1), t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, 249#(and (<= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|) (< |t3_funThread1of1ForFork2_~y~1#1| (+ |t3_funThread1of1ForFork2_~x~2#1| 1))), 176#t2_funEXITtrue]) [2022-11-25 17:14:55,194 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is not cut-off event [2022-11-25 17:14:55,194 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2022-11-25 17:14:55,194 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2022-11-25 17:14:55,194 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2022-11-25 17:14:55,323 INFO L130 PetriNetUnfolder]: 4588/8274 cut-off events. [2022-11-25 17:14:55,323 INFO L131 PetriNetUnfolder]: For 22240/22552 co-relation queries the response was YES. [2022-11-25 17:14:55,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29814 conditions, 8274 events. 4588/8274 cut-off events. For 22240/22552 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 60665 event pairs, 1541 based on Foata normal form. 742/8790 useless extension candidates. Maximal degree in co-relation 29787. Up to 4583 conditions per place. [2022-11-25 17:14:55,378 INFO L137 encePairwiseOnDemand]: 356/358 looper letters, 88 selfloop transitions, 2 changer transitions 1/121 dead transitions. [2022-11-25 17:14:55,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 121 transitions, 1137 flow [2022-11-25 17:14:55,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:14:55,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:14:55,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions. [2022-11-25 17:14:55,381 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48417132216014896 [2022-11-25 17:14:55,381 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 520 transitions. [2022-11-25 17:14:55,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 520 transitions. [2022-11-25 17:14:55,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:14:55,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 520 transitions. [2022-11-25 17:14:55,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:55,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:55,386 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 358.0) internal successors, (1432), 4 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:55,386 INFO L175 Difference]: Start difference. First operand has 95 places, 93 transitions, 763 flow. Second operand 3 states and 520 transitions. [2022-11-25 17:14:55,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 121 transitions, 1137 flow [2022-11-25 17:14:55,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 121 transitions, 1133 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:14:55,576 INFO L231 Difference]: Finished difference. Result has 94 places, 92 transitions, 761 flow [2022-11-25 17:14:55,576 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=761, PETRI_PLACES=94, PETRI_TRANSITIONS=92} [2022-11-25 17:14:55,577 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 41 predicate places. [2022-11-25 17:14:55,577 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 92 transitions, 761 flow [2022-11-25 17:14:55,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 162.25) internal successors, (649), 4 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:55,578 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:14:55,578 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:14:55,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 17:14:55,578 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:14:55,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:14:55,579 INFO L85 PathProgramCache]: Analyzing trace with hash 2113149717, now seen corresponding path program 1 times [2022-11-25 17:14:55,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:14:55,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863208287] [2022-11-25 17:14:55,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:14:55,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:14:55,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:55,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:14:55,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:14:55,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863208287] [2022-11-25 17:14:55,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863208287] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:14:55,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:14:55,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:14:55,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840306029] [2022-11-25 17:14:55,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:14:55,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:14:55,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:14:55,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:14:55,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:14:55,819 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 358 [2022-11-25 17:14:55,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 92 transitions, 761 flow. Second operand has 5 states, 5 states have (on average 155.2) internal successors, (776), 5 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:55,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:14:55,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 358 [2022-11-25 17:14:55,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:14:56,439 INFO L130 PetriNetUnfolder]: 1561/3315 cut-off events. [2022-11-25 17:14:56,439 INFO L131 PetriNetUnfolder]: For 10129/10339 co-relation queries the response was YES. [2022-11-25 17:14:56,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11743 conditions, 3315 events. 1561/3315 cut-off events. For 10129/10339 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 23595 event pairs, 329 based on Foata normal form. 436/3667 useless extension candidates. Maximal degree in co-relation 11716. Up to 2033 conditions per place. [2022-11-25 17:14:56,456 INFO L137 encePairwiseOnDemand]: 349/358 looper letters, 60 selfloop transitions, 16 changer transitions 4/105 dead transitions. [2022-11-25 17:14:56,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 105 transitions, 956 flow [2022-11-25 17:14:56,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:14:56,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:14:56,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 657 transitions. [2022-11-25 17:14:56,459 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45879888268156427 [2022-11-25 17:14:56,459 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 657 transitions. [2022-11-25 17:14:56,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 657 transitions. [2022-11-25 17:14:56,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:14:56,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 657 transitions. [2022-11-25 17:14:56,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 164.25) internal successors, (657), 4 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:56,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 358.0) internal successors, (1790), 5 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:56,463 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 358.0) internal successors, (1790), 5 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:56,463 INFO L175 Difference]: Start difference. First operand has 94 places, 92 transitions, 761 flow. Second operand 4 states and 657 transitions. [2022-11-25 17:14:56,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 105 transitions, 956 flow [2022-11-25 17:14:56,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 105 transitions, 932 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-11-25 17:14:56,498 INFO L231 Difference]: Finished difference. Result has 93 places, 84 transitions, 676 flow [2022-11-25 17:14:56,499 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=676, PETRI_PLACES=93, PETRI_TRANSITIONS=84} [2022-11-25 17:14:56,499 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 40 predicate places. [2022-11-25 17:14:56,500 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 84 transitions, 676 flow [2022-11-25 17:14:56,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 155.2) internal successors, (776), 5 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:56,500 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:14:56,501 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:14:56,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 17:14:56,501 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:14:56,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:14:56,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1906676287, now seen corresponding path program 1 times [2022-11-25 17:14:56,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:14:56,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054692246] [2022-11-25 17:14:56,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:14:56,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:14:56,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:56,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:14:56,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:14:56,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054692246] [2022-11-25 17:14:56,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054692246] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:14:56,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:14:56,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:14:56,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979656928] [2022-11-25 17:14:56,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:14:56,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:14:56,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:14:56,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:14:56,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:14:56,732 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 358 [2022-11-25 17:14:56,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 84 transitions, 676 flow. Second operand has 6 states, 6 states have (on average 158.16666666666666) internal successors, (949), 6 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:56,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:14:56,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 358 [2022-11-25 17:14:56,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:14:57,570 INFO L130 PetriNetUnfolder]: 1509/3240 cut-off events. [2022-11-25 17:14:57,570 INFO L131 PetriNetUnfolder]: For 8600/8760 co-relation queries the response was YES. [2022-11-25 17:14:57,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11974 conditions, 3240 events. 1509/3240 cut-off events. For 8600/8760 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 23301 event pairs, 218 based on Foata normal form. 156/3367 useless extension candidates. Maximal degree in co-relation 11949. Up to 1252 conditions per place. [2022-11-25 17:14:57,588 INFO L137 encePairwiseOnDemand]: 350/358 looper letters, 162 selfloop transitions, 39 changer transitions 11/226 dead transitions. [2022-11-25 17:14:57,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 226 transitions, 1873 flow [2022-11-25 17:14:57,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 17:14:57,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-25 17:14:57,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2174 transitions. [2022-11-25 17:14:57,597 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4671250537172325 [2022-11-25 17:14:57,597 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2174 transitions. [2022-11-25 17:14:57,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2174 transitions. [2022-11-25 17:14:57,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:14:57,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2174 transitions. [2022-11-25 17:14:57,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 167.23076923076923) internal successors, (2174), 13 states have internal predecessors, (2174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:57,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 358.0) internal successors, (5012), 14 states have internal predecessors, (5012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:57,613 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 358.0) internal successors, (5012), 14 states have internal predecessors, (5012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:57,613 INFO L175 Difference]: Start difference. First operand has 93 places, 84 transitions, 676 flow. Second operand 13 states and 2174 transitions. [2022-11-25 17:14:57,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 226 transitions, 1873 flow [2022-11-25 17:14:57,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 226 transitions, 1796 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-11-25 17:14:57,656 INFO L231 Difference]: Finished difference. Result has 107 places, 90 transitions, 843 flow [2022-11-25 17:14:57,656 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=843, PETRI_PLACES=107, PETRI_TRANSITIONS=90} [2022-11-25 17:14:57,657 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 54 predicate places. [2022-11-25 17:14:57,657 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 90 transitions, 843 flow [2022-11-25 17:14:57,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 158.16666666666666) internal successors, (949), 6 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:57,659 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:14:57,659 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:14:57,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 17:14:57,659 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:14:57,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:14:57,660 INFO L85 PathProgramCache]: Analyzing trace with hash -772829871, now seen corresponding path program 1 times [2022-11-25 17:14:57,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:14:57,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275436533] [2022-11-25 17:14:57,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:14:57,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:14:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:57,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:14:57,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:14:57,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275436533] [2022-11-25 17:14:57,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275436533] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:14:57,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:14:57,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:14:57,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398064440] [2022-11-25 17:14:57,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:14:57,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:14:57,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:14:57,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:14:57,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:14:57,879 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 358 [2022-11-25 17:14:57,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 90 transitions, 843 flow. Second operand has 6 states, 6 states have (on average 157.5) internal successors, (945), 6 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:57,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:14:57,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 358 [2022-11-25 17:14:57,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:14:58,976 INFO L130 PetriNetUnfolder]: 1640/3616 cut-off events. [2022-11-25 17:14:58,976 INFO L131 PetriNetUnfolder]: For 16334/16683 co-relation queries the response was YES. [2022-11-25 17:14:58,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14578 conditions, 3616 events. 1640/3616 cut-off events. For 16334/16683 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 27377 event pairs, 330 based on Foata normal form. 206/3804 useless extension candidates. Maximal degree in co-relation 14549. Up to 1477 conditions per place. [2022-11-25 17:14:58,999 INFO L137 encePairwiseOnDemand]: 350/358 looper letters, 154 selfloop transitions, 32 changer transitions 27/228 dead transitions. [2022-11-25 17:14:58,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 228 transitions, 2243 flow [2022-11-25 17:14:59,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 17:14:59,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-25 17:14:59,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2140 transitions. [2022-11-25 17:14:59,008 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4598195100988397 [2022-11-25 17:14:59,008 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2140 transitions. [2022-11-25 17:14:59,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2140 transitions. [2022-11-25 17:14:59,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:14:59,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2140 transitions. [2022-11-25 17:14:59,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 164.6153846153846) internal successors, (2140), 13 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:59,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 358.0) internal successors, (5012), 14 states have internal predecessors, (5012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:59,027 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 358.0) internal successors, (5012), 14 states have internal predecessors, (5012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:59,028 INFO L175 Difference]: Start difference. First operand has 107 places, 90 transitions, 843 flow. Second operand 13 states and 2140 transitions. [2022-11-25 17:14:59,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 228 transitions, 2243 flow [2022-11-25 17:14:59,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 228 transitions, 2107 flow, removed 29 selfloop flow, removed 10 redundant places. [2022-11-25 17:14:59,095 INFO L231 Difference]: Finished difference. Result has 112 places, 95 transitions, 850 flow [2022-11-25 17:14:59,095 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=743, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=850, PETRI_PLACES=112, PETRI_TRANSITIONS=95} [2022-11-25 17:14:59,096 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 59 predicate places. [2022-11-25 17:14:59,096 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 95 transitions, 850 flow [2022-11-25 17:14:59,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 157.5) internal successors, (945), 6 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:59,097 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:14:59,097 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:14:59,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 17:14:59,097 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:14:59,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:14:59,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1766450102, now seen corresponding path program 1 times [2022-11-25 17:14:59,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:14:59,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808938997] [2022-11-25 17:14:59,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:14:59,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:14:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:59,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:14:59,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:14:59,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808938997] [2022-11-25 17:14:59,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808938997] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:14:59,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:14:59,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:14:59,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086982465] [2022-11-25 17:14:59,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:14:59,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:14:59,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:14:59,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:14:59,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:14:59,359 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 358 [2022-11-25 17:14:59,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 95 transitions, 850 flow. Second operand has 5 states, 5 states have (on average 154.4) internal successors, (772), 5 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:59,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:14:59,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 358 [2022-11-25 17:14:59,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:14:59,700 INFO L130 PetriNetUnfolder]: 413/1257 cut-off events. [2022-11-25 17:14:59,700 INFO L131 PetriNetUnfolder]: For 2809/2859 co-relation queries the response was YES. [2022-11-25 17:14:59,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4524 conditions, 1257 events. 413/1257 cut-off events. For 2809/2859 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 8580 event pairs, 170 based on Foata normal form. 73/1330 useless extension candidates. Maximal degree in co-relation 4494. Up to 651 conditions per place. [2022-11-25 17:14:59,704 INFO L137 encePairwiseOnDemand]: 347/358 looper letters, 35 selfloop transitions, 13 changer transitions 14/74 dead transitions. [2022-11-25 17:14:59,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 74 transitions, 672 flow [2022-11-25 17:14:59,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:14:59,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:14:59,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 646 transitions. [2022-11-25 17:14:59,707 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4511173184357542 [2022-11-25 17:14:59,707 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 646 transitions. [2022-11-25 17:14:59,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 646 transitions. [2022-11-25 17:14:59,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:14:59,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 646 transitions. [2022-11-25 17:14:59,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 161.5) internal successors, (646), 4 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:59,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 358.0) internal successors, (1790), 5 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:59,712 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 358.0) internal successors, (1790), 5 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:59,713 INFO L175 Difference]: Start difference. First operand has 112 places, 95 transitions, 850 flow. Second operand 4 states and 646 transitions. [2022-11-25 17:14:59,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 74 transitions, 672 flow [2022-11-25 17:14:59,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 74 transitions, 565 flow, removed 14 selfloop flow, removed 19 redundant places. [2022-11-25 17:14:59,726 INFO L231 Difference]: Finished difference. Result has 90 places, 53 transitions, 338 flow [2022-11-25 17:14:59,726 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=338, PETRI_PLACES=90, PETRI_TRANSITIONS=53} [2022-11-25 17:14:59,727 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 37 predicate places. [2022-11-25 17:14:59,727 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 53 transitions, 338 flow [2022-11-25 17:14:59,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 154.4) internal successors, (772), 5 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:59,728 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:14:59,728 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:14:59,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 17:14:59,728 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:14:59,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:14:59,729 INFO L85 PathProgramCache]: Analyzing trace with hash 382184070, now seen corresponding path program 1 times [2022-11-25 17:14:59,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:14:59,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569062097] [2022-11-25 17:14:59,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:14:59,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:14:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:59,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:14:59,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:14:59,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569062097] [2022-11-25 17:14:59,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569062097] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:14:59,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:14:59,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:14:59,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043672146] [2022-11-25 17:14:59,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:14:59,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:14:59,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:14:59,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:14:59,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:14:59,988 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 358 [2022-11-25 17:14:59,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 53 transitions, 338 flow. Second operand has 6 states, 6 states have (on average 158.66666666666666) internal successors, (952), 6 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:14:59,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:14:59,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 358 [2022-11-25 17:14:59,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:15:00,271 INFO L130 PetriNetUnfolder]: 232/719 cut-off events. [2022-11-25 17:15:00,271 INFO L131 PetriNetUnfolder]: For 1094/1116 co-relation queries the response was YES. [2022-11-25 17:15:00,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2375 conditions, 719 events. 232/719 cut-off events. For 1094/1116 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 4043 event pairs, 112 based on Foata normal form. 34/750 useless extension candidates. Maximal degree in co-relation 2358. Up to 298 conditions per place. [2022-11-25 17:15:00,274 INFO L137 encePairwiseOnDemand]: 352/358 looper letters, 0 selfloop transitions, 0 changer transitions 76/76 dead transitions. [2022-11-25 17:15:00,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 76 transitions, 561 flow [2022-11-25 17:15:00,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:15:00,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:15:00,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1145 transitions. [2022-11-25 17:15:00,278 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45690343176376697 [2022-11-25 17:15:00,278 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1145 transitions. [2022-11-25 17:15:00,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1145 transitions. [2022-11-25 17:15:00,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:15:00,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1145 transitions. [2022-11-25 17:15:00,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 163.57142857142858) internal successors, (1145), 7 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:15:00,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 358.0) internal successors, (2864), 8 states have internal predecessors, (2864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:15:00,285 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 358.0) internal successors, (2864), 8 states have internal predecessors, (2864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:15:00,286 INFO L175 Difference]: Start difference. First operand has 90 places, 53 transitions, 338 flow. Second operand 7 states and 1145 transitions. [2022-11-25 17:15:00,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 76 transitions, 561 flow [2022-11-25 17:15:00,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 76 transitions, 500 flow, removed 5 selfloop flow, removed 10 redundant places. [2022-11-25 17:15:00,290 INFO L231 Difference]: Finished difference. Result has 80 places, 0 transitions, 0 flow [2022-11-25 17:15:00,290 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=358, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=80, PETRI_TRANSITIONS=0} [2022-11-25 17:15:00,290 INFO L288 CegarLoopForPetriNet]: 53 programPoint places, 27 predicate places. [2022-11-25 17:15:00,291 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 0 transitions, 0 flow [2022-11-25 17:15:00,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 158.66666666666666) internal successors, (952), 6 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:15:00,294 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-25 17:15:00,295 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-25 17:15:00,295 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-25 17:15:00,295 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-25 17:15:00,295 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-25 17:15:00,296 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-25 17:15:00,296 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-25 17:15:00,296 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-25 17:15:00,296 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (7 of 16 remaining) [2022-11-25 17:15:00,296 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (6 of 16 remaining) [2022-11-25 17:15:00,296 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-25 17:15:00,297 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-25 17:15:00,297 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-25 17:15:00,297 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-25 17:15:00,297 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 16 remaining) [2022-11-25 17:15:00,297 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-25 17:15:00,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 17:15:00,298 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:15:00,303 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 17:15:00,304 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:15:00,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:15:00 BasicIcfg [2022-11-25 17:15:00,307 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:15:00,308 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:15:00,308 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:15:00,308 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:15:00,309 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:14:30" (3/4) ... [2022-11-25 17:15:00,311 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 17:15:00,318 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure t2_fun [2022-11-25 17:15:00,318 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure t3_fun [2022-11-25 17:15:00,319 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2022-11-25 17:15:00,323 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-11-25 17:15:00,324 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-25 17:15:00,324 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-25 17:15:00,324 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 17:15:00,360 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_037dba46-33c6-4626-b997-824dd6e25161/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 17:15:00,361 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:15:00,361 INFO L158 Benchmark]: Toolchain (without parser) took 31378.53ms. Allocated memory was 205.5MB in the beginning and 6.1GB in the end (delta: 5.9GB). Free memory was 164.0MB in the beginning and 5.6GB in the end (delta: -5.4GB). Peak memory consumption was 519.3MB. Max. memory is 16.1GB. [2022-11-25 17:15:00,362 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 146.8MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:15:00,362 INFO L158 Benchmark]: CACSL2BoogieTranslator took 541.20ms. Allocated memory is still 205.5MB. Free memory was 164.0MB in the beginning and 143.6MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-25 17:15:00,362 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.17ms. Allocated memory is still 205.5MB. Free memory was 143.6MB in the beginning and 141.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:15:00,363 INFO L158 Benchmark]: Boogie Preprocessor took 29.88ms. Allocated memory is still 205.5MB. Free memory was 141.5MB in the beginning and 140.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:15:00,363 INFO L158 Benchmark]: RCFGBuilder took 645.32ms. Allocated memory is still 205.5MB. Free memory was 139.4MB in the beginning and 121.6MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-25 17:15:00,363 INFO L158 Benchmark]: TraceAbstraction took 30052.12ms. Allocated memory was 205.5MB in the beginning and 6.1GB in the end (delta: 5.9GB). Free memory was 120.6MB in the beginning and 5.6GB in the end (delta: -5.5GB). Peak memory consumption was 473.1MB. Max. memory is 16.1GB. [2022-11-25 17:15:00,364 INFO L158 Benchmark]: Witness Printer took 53.02ms. Allocated memory is still 6.1GB. Free memory was 5.6GB in the beginning and 5.6GB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:15:00,365 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.25ms. Allocated memory is still 146.8MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 541.20ms. Allocated memory is still 205.5MB. Free memory was 164.0MB in the beginning and 143.6MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.17ms. Allocated memory is still 205.5MB. Free memory was 143.6MB in the beginning and 141.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.88ms. Allocated memory is still 205.5MB. Free memory was 141.5MB in the beginning and 140.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 645.32ms. Allocated memory is still 205.5MB. Free memory was 139.4MB in the beginning and 121.6MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 30052.12ms. Allocated memory was 205.5MB in the beginning and 6.1GB in the end (delta: 5.9GB). Free memory was 120.6MB in the beginning and 5.6GB in the end (delta: -5.5GB). Peak memory consumption was 473.1MB. Max. memory is 16.1GB. * Witness Printer took 53.02ms. Allocated memory is still 6.1GB. Free memory was 5.6GB in the beginning and 5.6GB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.4s, 179 PlacesBefore, 53 PlacesAfterwards, 174 TransitionsBefore, 45 TransitionsAfterwards, 10466 CoEnabledTransitionPairs, 8 FixpointIterations, 50 TrivialSequentialCompositions, 109 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 19 ConcurrentYvCompositions, 3 ChoiceCompositions, 181 TotalNumberOfCompositions, 22587 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 13038, independent: 12644, independent conditional: 0, independent unconditional: 12644, dependent: 394, dependent conditional: 0, dependent unconditional: 394, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7355, independent: 7263, independent conditional: 0, independent unconditional: 7263, dependent: 92, dependent conditional: 0, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7355, independent: 7170, independent conditional: 0, independent unconditional: 7170, dependent: 185, dependent conditional: 0, dependent unconditional: 185, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 185, independent: 93, independent conditional: 0, independent unconditional: 93, dependent: 92, dependent conditional: 0, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 388, independent: 145, independent conditional: 0, independent unconditional: 145, dependent: 243, dependent conditional: 0, dependent unconditional: 243, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13038, independent: 5381, independent conditional: 0, independent unconditional: 5381, dependent: 302, dependent conditional: 0, dependent unconditional: 302, unknown: 7355, unknown conditional: 0, unknown unconditional: 7355] , Statistics on independence cache: Total cache size (in pairs): 480, Positive cache size: 441, Positive conditional cache size: 0, Positive unconditional cache size: 441, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - PositiveResult [Line: 19]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 19]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 19]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 723]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 247 locations, 16 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: 29.9s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 19.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1688 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1277 mSDsluCounter, 314 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 192 mSDsCounter, 126 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3186 IncrementalHoareTripleChecker+Invalid, 3312 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 126 mSolverCounterUnsat, 122 mSDtfsCounter, 3186 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=850occurred in iteration=15, InterpolantAutomatonStates: 95, 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.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 188 NumberOfCodeBlocks, 188 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 171 ConstructedInterpolants, 0 QuantifiedInterpolants, 1066 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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 - AllSpecificationsHoldResult: All specifications hold 11 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-25 17:15:00,391 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_037dba46-33c6-4626-b997-824dd6e25161/bin/uautomizer-ZsLfNo2U6R/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: TRUE