./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/weaver/popl20-threaded-sum-3.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/weaver/popl20-threaded-sum-3.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a12f7bc3d94ecbf6fd25030121af7b8c4b258a536df3d333f191aa6387ec429b --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 01:05:10,336 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 01:05:10,338 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 01:05:10,368 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 01:05:10,370 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 01:05:10,374 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 01:05:10,376 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 01:05:10,378 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 01:05:10,380 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 01:05:10,385 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 01:05:10,386 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 01:05:10,389 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 01:05:10,389 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 01:05:10,391 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 01:05:10,396 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 01:05:10,400 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 01:05:10,400 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 01:05:10,402 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 01:05:10,403 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 01:05:10,406 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 01:05:10,419 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 01:05:10,420 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 01:05:10,421 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 01:05:10,421 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 01:05:10,425 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 01:05:10,426 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 01:05:10,426 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 01:05:10,428 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 01:05:10,428 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 01:05:10,429 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 01:05:10,429 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 01:05:10,431 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 01:05:10,432 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 01:05:10,433 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 01:05:10,434 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 01:05:10,434 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 01:05:10,435 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 01:05:10,435 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 01:05:10,435 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 01:05:10,436 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 01:05:10,436 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 01:05:10,438 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 01:05:10,472 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 01:05:10,472 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 01:05:10,473 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 01:05:10,473 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 01:05:10,474 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 01:05:10,474 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 01:05:10,475 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 01:05:10,475 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 01:05:10,475 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 01:05:10,475 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 01:05:10,476 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 01:05:10,476 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 01:05:10,477 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 01:05:10,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 01:05:10,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 01:05:10,477 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 01:05:10,477 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 01:05:10,478 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 01:05:10,478 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 01:05:10,478 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 01:05:10,478 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 01:05:10,478 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 01:05:10,479 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 01:05:10,479 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 01:05:10,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 01:05:10,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 01:05:10,479 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 01:05:10,480 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 01:05:10,480 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 01:05:10,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 01:05:10,480 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 01:05:10,480 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 01:05:10,481 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 01:05:10,481 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 01:05:10,481 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a12f7bc3d94ecbf6fd25030121af7b8c4b258a536df3d333f191aa6387ec429b Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-30 01:05:10,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 01:05:10,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 01:05:10,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 01:05:10,795 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 01:05:10,795 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 01:05:10,796 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-threaded-sum-3.wvr.c [2023-08-30 01:05:11,940 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 01:05:12,138 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 01:05:12,138 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-threaded-sum-3.wvr.c [2023-08-30 01:05:12,144 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f8b7b9b1/4cbdc4a933564142aebdf7b3addf1f17/FLAGed3480f8e [2023-08-30 01:05:12,155 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f8b7b9b1/4cbdc4a933564142aebdf7b3addf1f17 [2023-08-30 01:05:12,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 01:05:12,158 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 01:05:12,159 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 01:05:12,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 01:05:12,163 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 01:05:12,164 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 01:05:12" (1/1) ... [2023-08-30 01:05:12,164 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4047e284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:05:12, skipping insertion in model container [2023-08-30 01:05:12,165 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 01:05:12" (1/1) ... [2023-08-30 01:05:12,170 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 01:05:12,190 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 01:05:12,369 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-threaded-sum-3.wvr.c[2957,2970] [2023-08-30 01:05:12,383 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 01:05:12,394 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 01:05:12,434 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-threaded-sum-3.wvr.c[2957,2970] [2023-08-30 01:05:12,435 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 01:05:12,442 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 01:05:12,442 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 01:05:12,448 INFO L208 MainTranslator]: Completed translation [2023-08-30 01:05:12,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:05:12 WrapperNode [2023-08-30 01:05:12,449 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 01:05:12,450 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 01:05:12,450 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 01:05:12,450 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 01:05:12,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:05:12" (1/1) ... [2023-08-30 01:05:12,474 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:05:12" (1/1) ... [2023-08-30 01:05:12,499 INFO L138 Inliner]: procedures = 22, calls = 46, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 82 [2023-08-30 01:05:12,500 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 01:05:12,501 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 01:05:12,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 01:05:12,501 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 01:05:12,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:05:12" (1/1) ... [2023-08-30 01:05:12,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:05:12" (1/1) ... [2023-08-30 01:05:12,521 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:05:12" (1/1) ... [2023-08-30 01:05:12,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:05:12" (1/1) ... [2023-08-30 01:05:12,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:05:12" (1/1) ... [2023-08-30 01:05:12,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:05:12" (1/1) ... [2023-08-30 01:05:12,541 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:05:12" (1/1) ... [2023-08-30 01:05:12,546 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:05:12" (1/1) ... [2023-08-30 01:05:12,548 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 01:05:12,553 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 01:05:12,553 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 01:05:12,554 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 01:05:12,554 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:05:12" (1/1) ... [2023-08-30 01:05:12,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 01:05:12,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 01:05:12,581 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 01:05:12,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 01:05:12,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 01:05:12,620 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-30 01:05:12,620 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-30 01:05:12,620 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-30 01:05:12,620 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-30 01:05:12,621 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-30 01:05:12,621 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-30 01:05:12,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 01:05:12,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 01:05:12,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 01:05:12,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 01:05:12,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 01:05:12,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 01:05:12,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 01:05:12,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 01:05:12,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 01:05:12,623 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 01:05:12,742 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 01:05:12,744 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 01:05:12,981 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 01:05:13,028 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 01:05:13,029 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-30 01:05:13,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 01:05:13 BoogieIcfgContainer [2023-08-30 01:05:13,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 01:05:13,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 01:05:13,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 01:05:13,036 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 01:05:13,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 01:05:12" (1/3) ... [2023-08-30 01:05:13,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f807438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 01:05:13, skipping insertion in model container [2023-08-30 01:05:13,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:05:12" (2/3) ... [2023-08-30 01:05:13,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f807438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 01:05:13, skipping insertion in model container [2023-08-30 01:05:13,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 01:05:13" (3/3) ... [2023-08-30 01:05:13,038 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-threaded-sum-3.wvr.c [2023-08-30 01:05:13,052 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 01:05:13,053 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2023-08-30 01:05:13,053 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 01:05:13,116 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-30 01:05:13,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 127 transitions, 278 flow [2023-08-30 01:05:13,206 INFO L130 PetriNetUnfolder]: 8/124 cut-off events. [2023-08-30 01:05:13,207 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 01:05:13,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 8/124 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 98 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2023-08-30 01:05:13,213 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 127 transitions, 278 flow [2023-08-30 01:05:13,218 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 120 transitions, 258 flow [2023-08-30 01:05:13,222 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 01:05:13,239 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 120 transitions, 258 flow [2023-08-30 01:05:13,245 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 120 transitions, 258 flow [2023-08-30 01:05:13,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 120 transitions, 258 flow [2023-08-30 01:05:13,301 INFO L130 PetriNetUnfolder]: 8/120 cut-off events. [2023-08-30 01:05:13,301 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 01:05:13,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 120 events. 8/120 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 97 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2023-08-30 01:05:13,303 INFO L119 LiptonReduction]: Number of co-enabled transitions 1310 [2023-08-30 01:05:17,177 INFO L134 LiptonReduction]: Checked pairs total: 2452 [2023-08-30 01:05:17,178 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-08-30 01:05:17,189 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 01:05:17,194 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;@73919f74, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 01:05:17,194 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2023-08-30 01:05:17,196 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 01:05:17,196 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 01:05:17,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 01:05:17,196 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 01:05:17,197 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 01:05:17,201 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 01:05:17,201 INFO L85 PathProgramCache]: Analyzing trace with hash 503, now seen corresponding path program 1 times [2023-08-30 01:05:17,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 01:05:17,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897425603] [2023-08-30 01:05:17,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 01:05:17,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 01:05:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 01:05:17,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 01:05:17,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 01:05:17,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897425603] [2023-08-30 01:05:17,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897425603] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 01:05:17,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 01:05:17,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 01:05:17,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680689109] [2023-08-30 01:05:17,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 01:05:17,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 01:05:17,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 01:05:17,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 01:05:17,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 01:05:17,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 239 [2023-08-30 01:05:17,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:17,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 01:05:17,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 239 [2023-08-30 01:05:17,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 01:05:17,433 INFO L130 PetriNetUnfolder]: 461/724 cut-off events. [2023-08-30 01:05:17,433 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2023-08-30 01:05:17,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1479 conditions, 724 events. 461/724 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3487 event pairs, 362 based on Foata normal form. 0/373 useless extension candidates. Maximal degree in co-relation 1095. Up to 708 conditions per place. [2023-08-30 01:05:17,441 INFO L137 encePairwiseOnDemand]: 236/239 looper letters, 30 selfloop transitions, 0 changer transitions 0/35 dead transitions. [2023-08-30 01:05:17,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 35 transitions, 148 flow [2023-08-30 01:05:17,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 01:05:17,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 01:05:17,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 255 transitions. [2023-08-30 01:05:17,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5334728033472803 [2023-08-30 01:05:17,488 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 255 transitions. [2023-08-30 01:05:17,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 255 transitions. [2023-08-30 01:05:17,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 01:05:17,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 255 transitions. [2023-08-30 01:05:17,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:17,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 239.0) internal successors, (717), 3 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:17,537 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 239.0) internal successors, (717), 3 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:17,538 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 94 flow. Second operand 2 states and 255 transitions. [2023-08-30 01:05:17,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 35 transitions, 148 flow [2023-08-30 01:05:17,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 35 transitions, 136 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-30 01:05:17,542 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 76 flow [2023-08-30 01:05:17,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=76, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2023-08-30 01:05:17,546 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -8 predicate places. [2023-08-30 01:05:17,546 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 76 flow [2023-08-30 01:05:17,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:17,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 01:05:17,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 01:05:17,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 01:05:17,547 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 01:05:17,548 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 01:05:17,548 INFO L85 PathProgramCache]: Analyzing trace with hash 496819, now seen corresponding path program 1 times [2023-08-30 01:05:17,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 01:05:17,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040315644] [2023-08-30 01:05:17,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 01:05:17,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 01:05:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 01:05:17,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 01:05:17,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 01:05:17,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040315644] [2023-08-30 01:05:17,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040315644] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 01:05:17,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 01:05:17,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 01:05:17,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812164078] [2023-08-30 01:05:17,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 01:05:17,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 01:05:17,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 01:05:17,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 01:05:17,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 01:05:17,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 239 [2023-08-30 01:05:17,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:17,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 01:05:17,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 239 [2023-08-30 01:05:17,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 01:05:17,918 INFO L130 PetriNetUnfolder]: 436/684 cut-off events. [2023-08-30 01:05:17,918 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 01:05:17,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1367 conditions, 684 events. 436/684 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3238 event pairs, 343 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 1364. Up to 667 conditions per place. [2023-08-30 01:05:17,923 INFO L137 encePairwiseOnDemand]: 236/239 looper letters, 27 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2023-08-30 01:05:17,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 128 flow [2023-08-30 01:05:17,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 01:05:17,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 01:05:17,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2023-08-30 01:05:17,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46443514644351463 [2023-08-30 01:05:17,929 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 333 transitions. [2023-08-30 01:05:17,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 333 transitions. [2023-08-30 01:05:17,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 01:05:17,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 333 transitions. [2023-08-30 01:05:17,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.0) internal successors, (333), 3 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) [2023-08-30 01:05:17,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:17,945 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:17,945 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 76 flow. Second operand 3 states and 333 transitions. [2023-08-30 01:05:17,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 128 flow [2023-08-30 01:05:17,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 33 transitions, 128 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 01:05:17,947 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 74 flow [2023-08-30 01:05:17,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2023-08-30 01:05:17,947 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -8 predicate places. [2023-08-30 01:05:17,948 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 33 transitions, 74 flow [2023-08-30 01:05:17,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:17,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 01:05:17,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 01:05:17,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 01:05:17,950 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 01:05:17,952 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 01:05:17,953 INFO L85 PathProgramCache]: Analyzing trace with hash 496821, now seen corresponding path program 1 times [2023-08-30 01:05:17,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 01:05:17,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873280249] [2023-08-30 01:05:17,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 01:05:17,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 01:05:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 01:05:18,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 01:05:18,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 01:05:18,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873280249] [2023-08-30 01:05:18,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873280249] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 01:05:18,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 01:05:18,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 01:05:18,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826240524] [2023-08-30 01:05:18,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 01:05:18,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 01:05:18,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 01:05:18,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 01:05:18,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 01:05:18,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 239 [2023-08-30 01:05:18,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:18,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 01:05:18,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 239 [2023-08-30 01:05:18,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 01:05:18,223 INFO L130 PetriNetUnfolder]: 411/644 cut-off events. [2023-08-30 01:05:18,223 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 01:05:18,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1289 conditions, 644 events. 411/644 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3026 event pairs, 324 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 1285. Up to 627 conditions per place. [2023-08-30 01:05:18,234 INFO L137 encePairwiseOnDemand]: 236/239 looper letters, 25 selfloop transitions, 1 changer transitions 0/31 dead transitions. [2023-08-30 01:05:18,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 31 transitions, 122 flow [2023-08-30 01:05:18,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 01:05:18,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 01:05:18,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-08-30 01:05:18,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4825662482566248 [2023-08-30 01:05:18,237 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-08-30 01:05:18,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-08-30 01:05:18,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 01:05:18,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-08-30 01:05:18,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:18,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:18,241 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:18,241 INFO L175 Difference]: Start difference. First operand has 37 places, 33 transitions, 74 flow. Second operand 3 states and 346 transitions. [2023-08-30 01:05:18,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 31 transitions, 122 flow [2023-08-30 01:05:18,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 31 transitions, 121 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 01:05:18,243 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 71 flow [2023-08-30 01:05:18,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2023-08-30 01:05:18,244 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -9 predicate places. [2023-08-30 01:05:18,247 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 71 flow [2023-08-30 01:05:18,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:18,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 01:05:18,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 01:05:18,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 01:05:18,249 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 01:05:18,249 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 01:05:18,249 INFO L85 PathProgramCache]: Analyzing trace with hash 477455467, now seen corresponding path program 1 times [2023-08-30 01:05:18,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 01:05:18,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304563808] [2023-08-30 01:05:18,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 01:05:18,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 01:05:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 01:05:18,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 01:05:18,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 01:05:18,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304563808] [2023-08-30 01:05:18,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304563808] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 01:05:18,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 01:05:18,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 01:05:18,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804076313] [2023-08-30 01:05:18,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 01:05:18,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 01:05:18,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 01:05:18,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 01:05:18,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 01:05:18,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 239 [2023-08-30 01:05:18,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:18,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 01:05:18,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 239 [2023-08-30 01:05:18,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 01:05:18,444 INFO L130 PetriNetUnfolder]: 394/614 cut-off events. [2023-08-30 01:05:18,445 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 01:05:18,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1230 conditions, 614 events. 394/614 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 2804 event pairs, 309 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 1226. Up to 597 conditions per place. [2023-08-30 01:05:18,450 INFO L137 encePairwiseOnDemand]: 236/239 looper letters, 23 selfloop transitions, 1 changer transitions 0/29 dead transitions. [2023-08-30 01:05:18,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 29 transitions, 115 flow [2023-08-30 01:05:18,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 01:05:18,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 01:05:18,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 329 transitions. [2023-08-30 01:05:18,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45885634588563456 [2023-08-30 01:05:18,456 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 329 transitions. [2023-08-30 01:05:18,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 329 transitions. [2023-08-30 01:05:18,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 01:05:18,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 329 transitions. [2023-08-30 01:05:18,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:18,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:18,459 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:18,459 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 71 flow. Second operand 3 states and 329 transitions. [2023-08-30 01:05:18,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 29 transitions, 115 flow [2023-08-30 01:05:18,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 29 transitions, 114 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 01:05:18,461 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 68 flow [2023-08-30 01:05:18,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2023-08-30 01:05:18,463 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -10 predicate places. [2023-08-30 01:05:18,463 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 68 flow [2023-08-30 01:05:18,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:18,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 01:05:18,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 01:05:18,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 01:05:18,464 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 01:05:18,464 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 01:05:18,464 INFO L85 PathProgramCache]: Analyzing trace with hash 477455468, now seen corresponding path program 1 times [2023-08-30 01:05:18,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 01:05:18,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292607419] [2023-08-30 01:05:18,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 01:05:18,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 01:05:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 01:05:18,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 01:05:18,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 01:05:18,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292607419] [2023-08-30 01:05:18,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292607419] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 01:05:18,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 01:05:18,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 01:05:18,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116646162] [2023-08-30 01:05:18,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 01:05:18,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 01:05:18,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 01:05:18,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 01:05:18,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 01:05:18,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 239 [2023-08-30 01:05:18,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:18,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 01:05:18,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 239 [2023-08-30 01:05:18,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 01:05:18,660 INFO L130 PetriNetUnfolder]: 377/584 cut-off events. [2023-08-30 01:05:18,661 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 01:05:18,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1171 conditions, 584 events. 377/584 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 2650 event pairs, 294 based on Foata normal form. 0/335 useless extension candidates. Maximal degree in co-relation 1167. Up to 567 conditions per place. [2023-08-30 01:05:18,665 INFO L137 encePairwiseOnDemand]: 236/239 looper letters, 21 selfloop transitions, 1 changer transitions 0/27 dead transitions. [2023-08-30 01:05:18,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 27 transitions, 108 flow [2023-08-30 01:05:18,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 01:05:18,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 01:05:18,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2023-08-30 01:05:18,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4769874476987448 [2023-08-30 01:05:18,667 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 342 transitions. [2023-08-30 01:05:18,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 342 transitions. [2023-08-30 01:05:18,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 01:05:18,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 342 transitions. [2023-08-30 01:05:18,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:18,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:18,670 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:18,670 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 68 flow. Second operand 3 states and 342 transitions. [2023-08-30 01:05:18,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 27 transitions, 108 flow [2023-08-30 01:05:18,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 27 transitions, 107 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 01:05:18,671 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 65 flow [2023-08-30 01:05:18,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2023-08-30 01:05:18,672 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -11 predicate places. [2023-08-30 01:05:18,672 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 65 flow [2023-08-30 01:05:18,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:18,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 01:05:18,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 01:05:18,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 01:05:18,673 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 01:05:18,674 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 01:05:18,674 INFO L85 PathProgramCache]: Analyzing trace with hash -726783405, now seen corresponding path program 1 times [2023-08-30 01:05:18,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 01:05:18,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740034967] [2023-08-30 01:05:18,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 01:05:18,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 01:05:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 01:05:18,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 01:05:18,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 01:05:18,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740034967] [2023-08-30 01:05:18,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740034967] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 01:05:18,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 01:05:18,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 01:05:18,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311621442] [2023-08-30 01:05:18,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 01:05:18,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 01:05:18,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 01:05:18,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 01:05:18,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 01:05:18,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 239 [2023-08-30 01:05:18,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 65 flow. Second operand has 5 states, 5 states have (on average 94.4) internal successors, (472), 5 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:18,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 01:05:18,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 239 [2023-08-30 01:05:18,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 01:05:18,886 INFO L130 PetriNetUnfolder]: 293/464 cut-off events. [2023-08-30 01:05:18,886 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 01:05:18,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 932 conditions, 464 events. 293/464 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1995 event pairs, 228 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 928. Up to 447 conditions per place. [2023-08-30 01:05:18,890 INFO L137 encePairwiseOnDemand]: 237/239 looper letters, 20 selfloop transitions, 1 changer transitions 0/26 dead transitions. [2023-08-30 01:05:18,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 26 transitions, 105 flow [2023-08-30 01:05:18,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 01:05:18,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 01:05:18,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 301 transitions. [2023-08-30 01:05:18,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4198047419804742 [2023-08-30 01:05:18,892 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 301 transitions. [2023-08-30 01:05:18,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 301 transitions. [2023-08-30 01:05:18,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 01:05:18,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 301 transitions. [2023-08-30 01:05:18,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:18,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:18,895 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:18,895 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 65 flow. Second operand 3 states and 301 transitions. [2023-08-30 01:05:18,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 26 transitions, 105 flow [2023-08-30 01:05:18,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 104 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 01:05:18,903 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 64 flow [2023-08-30 01:05:18,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2023-08-30 01:05:18,905 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -11 predicate places. [2023-08-30 01:05:18,905 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 64 flow [2023-08-30 01:05:18,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.4) internal successors, (472), 5 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:18,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 01:05:18,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 01:05:18,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 01:05:18,907 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 01:05:18,908 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 01:05:18,908 INFO L85 PathProgramCache]: Analyzing trace with hash -726783404, now seen corresponding path program 1 times [2023-08-30 01:05:18,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 01:05:18,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504140683] [2023-08-30 01:05:18,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 01:05:18,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 01:05:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 01:05:19,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 01:05:19,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 01:05:19,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504140683] [2023-08-30 01:05:19,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504140683] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 01:05:19,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 01:05:19,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 01:05:19,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445322188] [2023-08-30 01:05:19,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 01:05:19,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 01:05:19,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 01:05:19,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 01:05:19,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 01:05:19,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 239 [2023-08-30 01:05:19,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:19,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 01:05:19,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 239 [2023-08-30 01:05:19,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 01:05:19,266 INFO L130 PetriNetUnfolder]: 209/344 cut-off events. [2023-08-30 01:05:19,266 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 01:05:19,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 693 conditions, 344 events. 209/344 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1386 event pairs, 162 based on Foata normal form. 0/233 useless extension candidates. Maximal degree in co-relation 689. Up to 327 conditions per place. [2023-08-30 01:05:19,268 INFO L137 encePairwiseOnDemand]: 237/239 looper letters, 19 selfloop transitions, 1 changer transitions 0/25 dead transitions. [2023-08-30 01:05:19,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 25 transitions, 102 flow [2023-08-30 01:05:19,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 01:05:19,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 01:05:19,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2023-08-30 01:05:19,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4309623430962343 [2023-08-30 01:05:19,270 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 309 transitions. [2023-08-30 01:05:19,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 309 transitions. [2023-08-30 01:05:19,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 01:05:19,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 309 transitions. [2023-08-30 01:05:19,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:19,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:19,273 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:19,273 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 64 flow. Second operand 3 states and 309 transitions. [2023-08-30 01:05:19,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 25 transitions, 102 flow [2023-08-30 01:05:19,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 25 transitions, 101 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 01:05:19,275 INFO L231 Difference]: Finished difference. Result has 34 places, 25 transitions, 63 flow [2023-08-30 01:05:19,275 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=63, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2023-08-30 01:05:19,275 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -11 predicate places. [2023-08-30 01:05:19,276 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 63 flow [2023-08-30 01:05:19,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:19,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 01:05:19,276 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 01:05:19,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 01:05:19,277 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 01:05:19,277 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 01:05:19,277 INFO L85 PathProgramCache]: Analyzing trace with hash 435294865, now seen corresponding path program 1 times [2023-08-30 01:05:19,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 01:05:19,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932561861] [2023-08-30 01:05:19,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 01:05:19,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 01:05:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 01:05:19,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 01:05:19,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 01:05:19,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932561861] [2023-08-30 01:05:19,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932561861] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 01:05:19,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 01:05:19,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 01:05:19,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318472504] [2023-08-30 01:05:19,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 01:05:19,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 01:05:19,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 01:05:19,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 01:05:19,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 01:05:19,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 239 [2023-08-30 01:05:19,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 63 flow. Second operand has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:19,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 01:05:19,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 239 [2023-08-30 01:05:19,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 01:05:19,631 INFO L130 PetriNetUnfolder]: 637/914 cut-off events. [2023-08-30 01:05:19,632 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 01:05:19,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1833 conditions, 914 events. 637/914 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3662 event pairs, 16 based on Foata normal form. 0/643 useless extension candidates. Maximal degree in co-relation 1829. Up to 586 conditions per place. [2023-08-30 01:05:19,637 INFO L137 encePairwiseOnDemand]: 233/239 looper letters, 50 selfloop transitions, 6 changer transitions 0/59 dead transitions. [2023-08-30 01:05:19,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 59 transitions, 249 flow [2023-08-30 01:05:19,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 01:05:19,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 01:05:19,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 583 transitions. [2023-08-30 01:05:19,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48786610878661085 [2023-08-30 01:05:19,639 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 583 transitions. [2023-08-30 01:05:19,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 583 transitions. [2023-08-30 01:05:19,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 01:05:19,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 583 transitions. [2023-08-30 01:05:19,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:19,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:19,643 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:19,643 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 63 flow. Second operand 5 states and 583 transitions. [2023-08-30 01:05:19,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 59 transitions, 249 flow [2023-08-30 01:05:19,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 59 transitions, 248 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 01:05:19,646 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 107 flow [2023-08-30 01:05:19,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-08-30 01:05:19,648 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -5 predicate places. [2023-08-30 01:05:19,649 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 107 flow [2023-08-30 01:05:19,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:19,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 01:05:19,649 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 01:05:19,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 01:05:19,650 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 01:05:19,656 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 01:05:19,657 INFO L85 PathProgramCache]: Analyzing trace with hash -187024621, now seen corresponding path program 1 times [2023-08-30 01:05:19,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 01:05:19,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173048435] [2023-08-30 01:05:19,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 01:05:19,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 01:05:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 01:05:19,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 01:05:19,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 01:05:19,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173048435] [2023-08-30 01:05:19,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173048435] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 01:05:19,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 01:05:19,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 01:05:19,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138445293] [2023-08-30 01:05:19,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 01:05:19,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 01:05:19,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 01:05:19,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 01:05:19,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 01:05:20,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 239 [2023-08-30 01:05:20,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:20,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 01:05:20,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 239 [2023-08-30 01:05:20,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 01:05:20,189 INFO L130 PetriNetUnfolder]: 783/1120 cut-off events. [2023-08-30 01:05:20,190 INFO L131 PetriNetUnfolder]: For 784/874 co-relation queries the response was YES. [2023-08-30 01:05:20,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2944 conditions, 1120 events. 783/1120 cut-off events. For 784/874 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4468 event pairs, 83 based on Foata normal form. 136/1137 useless extension candidates. Maximal degree in co-relation 2937. Up to 651 conditions per place. [2023-08-30 01:05:20,196 INFO L137 encePairwiseOnDemand]: 235/239 looper letters, 46 selfloop transitions, 4 changer transitions 0/55 dead transitions. [2023-08-30 01:05:20,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 55 transitions, 291 flow [2023-08-30 01:05:20,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 01:05:20,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 01:05:20,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 452 transitions. [2023-08-30 01:05:20,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47280334728033474 [2023-08-30 01:05:20,199 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 452 transitions. [2023-08-30 01:05:20,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 452 transitions. [2023-08-30 01:05:20,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 01:05:20,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 452 transitions. [2023-08-30 01:05:20,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:20,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 239.0) internal successors, (1195), 5 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:20,202 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 239.0) internal successors, (1195), 5 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:20,202 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 107 flow. Second operand 4 states and 452 transitions. [2023-08-30 01:05:20,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 55 transitions, 291 flow [2023-08-30 01:05:20,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 55 transitions, 287 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 01:05:20,207 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 129 flow [2023-08-30 01:05:20,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2023-08-30 01:05:20,208 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -1 predicate places. [2023-08-30 01:05:20,208 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 129 flow [2023-08-30 01:05:20,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:20,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 01:05:20,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 01:05:20,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 01:05:20,209 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 01:05:20,210 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 01:05:20,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1194056500, now seen corresponding path program 1 times [2023-08-30 01:05:20,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 01:05:20,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292580848] [2023-08-30 01:05:20,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 01:05:20,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 01:05:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 01:05:20,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 01:05:20,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 01:05:20,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292580848] [2023-08-30 01:05:20,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292580848] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 01:05:20,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292418807] [2023-08-30 01:05:20,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 01:05:20,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 01:05:20,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 01:05:20,674 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 01:05:20,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-30 01:05:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 01:05:20,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-30 01:05:20,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 01:05:20,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 01:05:20,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 01:05:21,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 01:05:21,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292418807] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 01:05:21,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 01:05:21,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-08-30 01:05:21,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647366734] [2023-08-30 01:05:21,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 01:05:21,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-30 01:05:21,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 01:05:21,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-30 01:05:21,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-08-30 01:05:21,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 239 [2023-08-30 01:05:21,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 129 flow. Second operand has 14 states, 14 states have (on average 96.42857142857143) internal successors, (1350), 14 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:21,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 01:05:21,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 239 [2023-08-30 01:05:21,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 01:05:22,426 INFO L130 PetriNetUnfolder]: 1649/2362 cut-off events. [2023-08-30 01:05:22,426 INFO L131 PetriNetUnfolder]: For 1861/1861 co-relation queries the response was YES. [2023-08-30 01:05:22,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6512 conditions, 2362 events. 1649/2362 cut-off events. For 1861/1861 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 9427 event pairs, 146 based on Foata normal form. 158/2310 useless extension candidates. Maximal degree in co-relation 6503. Up to 599 conditions per place. [2023-08-30 01:05:22,439 INFO L137 encePairwiseOnDemand]: 226/239 looper letters, 138 selfloop transitions, 59 changer transitions 10/207 dead transitions. [2023-08-30 01:05:22,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 207 transitions, 1147 flow [2023-08-30 01:05:22,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-30 01:05:22,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-30 01:05:22,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2336 transitions. [2023-08-30 01:05:22,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42495906858286336 [2023-08-30 01:05:22,446 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 2336 transitions. [2023-08-30 01:05:22,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 2336 transitions. [2023-08-30 01:05:22,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 01:05:22,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 2336 transitions. [2023-08-30 01:05:22,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 101.56521739130434) internal successors, (2336), 23 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:22,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 239.0) internal successors, (5736), 24 states have internal predecessors, (5736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:22,460 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 239.0) internal successors, (5736), 24 states have internal predecessors, (5736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:22,460 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 129 flow. Second operand 23 states and 2336 transitions. [2023-08-30 01:05:22,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 207 transitions, 1147 flow [2023-08-30 01:05:22,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 207 transitions, 1147 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 01:05:22,465 INFO L231 Difference]: Finished difference. Result has 83 places, 88 transitions, 662 flow [2023-08-30 01:05:22,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=662, PETRI_PLACES=83, PETRI_TRANSITIONS=88} [2023-08-30 01:05:22,466 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 38 predicate places. [2023-08-30 01:05:22,466 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 88 transitions, 662 flow [2023-08-30 01:05:22,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 96.42857142857143) internal successors, (1350), 14 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:22,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 01:05:22,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 01:05:22,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-30 01:05:22,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-08-30 01:05:22,673 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 01:05:22,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 01:05:22,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1726305660, now seen corresponding path program 2 times [2023-08-30 01:05:22,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 01:05:22,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028132248] [2023-08-30 01:05:22,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 01:05:22,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 01:05:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 01:05:24,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 01:05:24,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 01:05:24,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028132248] [2023-08-30 01:05:24,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028132248] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 01:05:24,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804675845] [2023-08-30 01:05:24,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 01:05:24,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 01:05:24,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 01:05:24,870 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 01:05:24,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-30 01:05:25,052 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 01:05:25,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 01:05:25,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-30 01:05:25,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 01:05:25,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 01:05:25,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 01:05:27,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 01:05:27,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804675845] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 01:05:27,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 01:05:27,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2023-08-30 01:05:27,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670759070] [2023-08-30 01:05:27,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 01:05:27,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-30 01:05:27,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 01:05:27,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-30 01:05:27,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2023-08-30 01:05:28,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 239 [2023-08-30 01:05:28,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 88 transitions, 662 flow. Second operand has 23 states, 23 states have (on average 92.91304347826087) internal successors, (2137), 23 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:28,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 01:05:28,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 239 [2023-08-30 01:05:28,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 01:05:51,239 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([441] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_9| 0) (= (mod v_thread2Thread1of1ForFork0_~cond~1_15 256) 0) (= |v_thread2Thread1of1ForFork0_#res.offset_9| 0)) InVars {thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_15} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_9|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_9|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base][572], [44#thread2EXITtrue, 145#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 137#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 155#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 46#L85true, 58#L112-4true, 132#true, Black: 165#(and (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), 149#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), Black: 168#(and (= ~s~0 ~S~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 173#true, Black: 166#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 361#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 359#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 312#(< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)), Black: 349#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (or (<= 1 thread3Thread1of1ForFork2_~cond~2) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)))), 38#thread1EXITtrue, 182#true, Black: 320#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), Black: 339#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 345#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (or (<= 1 thread3Thread1of1ForFork2_~cond~2) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)))), Black: 175#(and (= ~u~0 ~U~0) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~U~0)), Black: 363#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 343#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (or (<= 1 thread3Thread1of1ForFork2_~cond~2) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)))), 141#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 178#(and (= ~u~0 ~U~0) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~U~0) (= thread2Thread1of1ForFork0_~cond~1 1)), Black: 337#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 353#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 160#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4) (and (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|))))), Black: 347#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 335#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 351#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 206#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 357#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 636#(and (<= (mod (+ ~T~0 1) 4294967296) 0) (= ~m~0 1) (< (div ~u~0 4294967296) (+ (div ~U~0 4294967296) 1)) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))]) [2023-08-30 01:05:51,239 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 01:05:51,240 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 01:05:51,240 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 01:05:51,240 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 01:05:51,240 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L72-->L65-1: Formula: (and (let ((.cse0 (mod v_~t~0_38 4294967296))) (or (and (= (+ v_~t~0_37 1) v_~t~0_38) (< 0 .cse0) (= (+ v_~s~0_36 1) v_~s~0_35)) (and (<= .cse0 0) (= |v_thread2Thread1of1ForFork0_#t~post4_8| |v_thread2Thread1of1ForFork0_#t~post4_7|) (= |v_thread2Thread1of1ForFork0_#t~post3_8| |v_thread2Thread1of1ForFork0_#t~post3_7|) (= v_~t~0_38 v_~t~0_37) (= v_~s~0_36 v_~s~0_35)))) (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_11 256) 0))) InVars {thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_8|, thread2Thread1of1ForFork0_#t~post4=|v_thread2Thread1of1ForFork0_#t~post4_8|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_11, ~t~0=v_~t~0_38, ~s~0=v_~s~0_36} OutVars{thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_7|, thread2Thread1of1ForFork0_#t~post4=|v_thread2Thread1of1ForFork0_#t~post4_7|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_11, ~t~0=v_~t~0_37, ~s~0=v_~s~0_35} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post3, thread2Thread1of1ForFork0_#t~post4, ~t~0, ~s~0][716], [145#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 137#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 155#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 46#L85true, 58#L112-4true, 132#true, 650#(and (<= (mod (+ ~T~0 1) 4294967296) 0) (= ~m~0 1) (< (div ~u~0 4294967296) (+ (div ~U~0 4294967296) 1)) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (or (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (< (+ (* 4294967296 (div (+ (- 1) ~s~0) 4294967296)) 1) ~s~0)) (= thread1Thread1of1ForFork1_~cond~0 0)), 100#L65-1true, Black: 165#(and (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), 149#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), Black: 168#(and (= ~s~0 ~S~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 173#true, Black: 166#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 361#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 359#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 312#(< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)), Black: 349#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (or (<= 1 thread3Thread1of1ForFork2_~cond~2) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)))), 38#thread1EXITtrue, Black: 320#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 182#true, Black: 339#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 345#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (or (<= 1 thread3Thread1of1ForFork2_~cond~2) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)))), Black: 175#(and (= ~u~0 ~U~0) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~U~0)), Black: 363#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 178#(and (= ~u~0 ~U~0) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~U~0) (= thread2Thread1of1ForFork0_~cond~1 1)), Black: 343#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (or (<= 1 thread3Thread1of1ForFork2_~cond~2) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)))), 141#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 337#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 353#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 160#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4) (and (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|))))), Black: 347#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 335#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 351#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 206#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 357#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))]) [2023-08-30 01:05:51,240 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 01:05:51,240 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 01:05:51,241 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 01:05:51,241 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 01:05:51,363 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([441] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_9| 0) (= (mod v_thread2Thread1of1ForFork0_~cond~1_15 256) 0) (= |v_thread2Thread1of1ForFork0_#res.offset_9| 0)) InVars {thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_15} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_9|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_9|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base][572], [44#thread2EXITtrue, 145#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 137#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 155#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 46#L85true, 132#true, 14#L113-1true, Black: 165#(and (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), 149#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), Black: 168#(and (= ~s~0 ~S~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 173#true, Black: 166#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 361#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 359#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 312#(< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)), Black: 349#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (or (<= 1 thread3Thread1of1ForFork2_~cond~2) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)))), 38#thread1EXITtrue, 182#true, Black: 320#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), Black: 339#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 345#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (or (<= 1 thread3Thread1of1ForFork2_~cond~2) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)))), Black: 363#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 175#(and (= ~u~0 ~U~0) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~U~0)), Black: 178#(and (= ~u~0 ~U~0) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~U~0) (= thread2Thread1of1ForFork0_~cond~1 1)), Black: 343#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (or (<= 1 thread3Thread1of1ForFork2_~cond~2) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)))), 141#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 337#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 353#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 160#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4) (and (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|))))), Black: 347#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 335#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 351#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 206#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 357#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 636#(and (<= (mod (+ ~T~0 1) 4294967296) 0) (= ~m~0 1) (< (div ~u~0 4294967296) (+ (div ~U~0 4294967296) 1)) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))]) [2023-08-30 01:05:51,364 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 01:05:51,364 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 01:05:51,364 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 01:05:51,364 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 01:05:51,364 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L72-->L65-1: Formula: (and (let ((.cse0 (mod v_~t~0_38 4294967296))) (or (and (= (+ v_~t~0_37 1) v_~t~0_38) (< 0 .cse0) (= (+ v_~s~0_36 1) v_~s~0_35)) (and (<= .cse0 0) (= |v_thread2Thread1of1ForFork0_#t~post4_8| |v_thread2Thread1of1ForFork0_#t~post4_7|) (= |v_thread2Thread1of1ForFork0_#t~post3_8| |v_thread2Thread1of1ForFork0_#t~post3_7|) (= v_~t~0_38 v_~t~0_37) (= v_~s~0_36 v_~s~0_35)))) (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_11 256) 0))) InVars {thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_8|, thread2Thread1of1ForFork0_#t~post4=|v_thread2Thread1of1ForFork0_#t~post4_8|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_11, ~t~0=v_~t~0_38, ~s~0=v_~s~0_36} OutVars{thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_7|, thread2Thread1of1ForFork0_#t~post4=|v_thread2Thread1of1ForFork0_#t~post4_7|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_11, ~t~0=v_~t~0_37, ~s~0=v_~s~0_35} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post3, thread2Thread1of1ForFork0_#t~post4, ~t~0, ~s~0][716], [145#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 137#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 155#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 46#L85true, 132#true, 650#(and (<= (mod (+ ~T~0 1) 4294967296) 0) (= ~m~0 1) (< (div ~u~0 4294967296) (+ (div ~U~0 4294967296) 1)) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (or (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (< (+ (* 4294967296 (div (+ (- 1) ~s~0) 4294967296)) 1) ~s~0)) (= thread1Thread1of1ForFork1_~cond~0 0)), 14#L113-1true, 100#L65-1true, Black: 165#(and (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), Black: 168#(and (= ~s~0 ~S~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 149#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), 173#true, Black: 166#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 361#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 359#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 312#(< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)), Black: 349#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (or (<= 1 thread3Thread1of1ForFork2_~cond~2) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)))), 38#thread1EXITtrue, Black: 320#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 182#true, Black: 339#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 345#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (or (<= 1 thread3Thread1of1ForFork2_~cond~2) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)))), Black: 363#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 175#(and (= ~u~0 ~U~0) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~U~0)), Black: 343#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (or (<= 1 thread3Thread1of1ForFork2_~cond~2) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)))), 141#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 178#(and (= ~u~0 ~U~0) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~U~0) (= thread2Thread1of1ForFork0_~cond~1 1)), Black: 337#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 353#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 160#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4) (and (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|))))), Black: 347#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 335#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 351#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 206#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 357#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))]) [2023-08-30 01:05:51,364 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 01:05:51,364 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 01:05:51,364 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 01:05:51,364 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 01:05:51,477 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([441] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_9| 0) (= (mod v_thread2Thread1of1ForFork0_~cond~1_15 256) 0) (= |v_thread2Thread1of1ForFork0_#res.offset_9| 0)) InVars {thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_15} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_9|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_9|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base][612], [44#thread2EXITtrue, 145#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 88#L114-1true, 137#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 467#(= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)), 155#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 132#true, Black: 165#(and (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), 149#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), Black: 168#(and (= ~s~0 ~S~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 166#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 173#true, Black: 361#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 359#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 312#(< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)), Black: 349#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (or (<= 1 thread3Thread1of1ForFork2_~cond~2) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)))), 182#true, Black: 320#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), Black: 339#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 345#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (or (<= 1 thread3Thread1of1ForFork2_~cond~2) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)))), Black: 175#(and (= ~u~0 ~U~0) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~U~0)), Black: 363#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 343#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (or (<= 1 thread3Thread1of1ForFork2_~cond~2) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)))), 141#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 178#(and (= ~u~0 ~U~0) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~U~0) (= thread2Thread1of1ForFork0_~cond~1 1)), Black: 337#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 160#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4) (and (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|))))), Black: 353#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 347#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 335#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 351#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 206#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 357#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 89#L91true]) [2023-08-30 01:05:51,478 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-30 01:05:51,478 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 01:05:51,478 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 01:05:51,478 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 01:05:51,478 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L72-->L65-1: Formula: (and (let ((.cse0 (mod v_~t~0_38 4294967296))) (or (and (= (+ v_~t~0_37 1) v_~t~0_38) (< 0 .cse0) (= (+ v_~s~0_36 1) v_~s~0_35)) (and (<= .cse0 0) (= |v_thread2Thread1of1ForFork0_#t~post4_8| |v_thread2Thread1of1ForFork0_#t~post4_7|) (= |v_thread2Thread1of1ForFork0_#t~post3_8| |v_thread2Thread1of1ForFork0_#t~post3_7|) (= v_~t~0_38 v_~t~0_37) (= v_~s~0_36 v_~s~0_35)))) (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_11 256) 0))) InVars {thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_8|, thread2Thread1of1ForFork0_#t~post4=|v_thread2Thread1of1ForFork0_#t~post4_8|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_11, ~t~0=v_~t~0_38, ~s~0=v_~s~0_36} OutVars{thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_7|, thread2Thread1of1ForFork0_#t~post4=|v_thread2Thread1of1ForFork0_#t~post4_7|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_11, ~t~0=v_~t~0_37, ~s~0=v_~s~0_35} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post3, thread2Thread1of1ForFork0_#t~post4, ~t~0, ~s~0][743], [145#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 88#L114-1true, 137#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 155#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 654#(and (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (or (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (< (+ (* 4294967296 (div (+ (- 1) ~s~0) 4294967296)) 1) ~s~0))), 132#true, 100#L65-1true, Black: 165#(and (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), 149#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), Black: 168#(and (= ~s~0 ~S~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 166#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 173#true, Black: 361#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 359#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 312#(< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)), Black: 349#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (or (<= 1 thread3Thread1of1ForFork2_~cond~2) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)))), Black: 320#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 182#true, Black: 339#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 345#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (or (<= 1 thread3Thread1of1ForFork2_~cond~2) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)))), Black: 175#(and (= ~u~0 ~U~0) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~U~0)), Black: 363#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 343#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (or (<= 1 thread3Thread1of1ForFork2_~cond~2) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)))), 141#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 178#(and (= ~u~0 ~U~0) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~U~0) (= thread2Thread1of1ForFork0_~cond~1 1)), Black: 337#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 160#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4) (and (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|))))), Black: 353#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 347#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 335#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 351#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 206#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 357#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 89#L91true]) [2023-08-30 01:05:51,478 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-30 01:05:51,478 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 01:05:51,478 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 01:05:51,478 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 01:05:51,514 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([441] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_9| 0) (= (mod v_thread2Thread1of1ForFork0_~cond~1_15 256) 0) (= |v_thread2Thread1of1ForFork0_#res.offset_9| 0)) InVars {thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_15} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_9|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_9|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base][572], [42#L113-2true, 44#thread2EXITtrue, 145#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 137#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 155#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 46#L85true, 132#true, Black: 165#(and (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), 149#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), Black: 168#(and (= ~s~0 ~S~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 173#true, Black: 166#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 361#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 359#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 312#(< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)), Black: 349#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (or (<= 1 thread3Thread1of1ForFork2_~cond~2) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)))), 182#true, Black: 320#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), Black: 339#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 345#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (or (<= 1 thread3Thread1of1ForFork2_~cond~2) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)))), Black: 363#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 175#(and (= ~u~0 ~U~0) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~U~0)), Black: 343#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (or (<= 1 thread3Thread1of1ForFork2_~cond~2) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)))), 141#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 178#(and (= ~u~0 ~U~0) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~U~0) (= thread2Thread1of1ForFork0_~cond~1 1)), Black: 337#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 353#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 160#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4) (and (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|))))), Black: 347#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 335#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 351#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 206#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 357#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 636#(and (<= (mod (+ ~T~0 1) 4294967296) 0) (= ~m~0 1) (< (div ~u~0 4294967296) (+ (div ~U~0 4294967296) 1)) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))]) [2023-08-30 01:05:51,514 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-30 01:05:51,514 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 01:05:51,514 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 01:05:51,514 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 01:05:51,515 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L72-->L65-1: Formula: (and (let ((.cse0 (mod v_~t~0_38 4294967296))) (or (and (= (+ v_~t~0_37 1) v_~t~0_38) (< 0 .cse0) (= (+ v_~s~0_36 1) v_~s~0_35)) (and (<= .cse0 0) (= |v_thread2Thread1of1ForFork0_#t~post4_8| |v_thread2Thread1of1ForFork0_#t~post4_7|) (= |v_thread2Thread1of1ForFork0_#t~post3_8| |v_thread2Thread1of1ForFork0_#t~post3_7|) (= v_~t~0_38 v_~t~0_37) (= v_~s~0_36 v_~s~0_35)))) (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_11 256) 0))) InVars {thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_8|, thread2Thread1of1ForFork0_#t~post4=|v_thread2Thread1of1ForFork0_#t~post4_8|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_11, ~t~0=v_~t~0_38, ~s~0=v_~s~0_36} OutVars{thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_7|, thread2Thread1of1ForFork0_#t~post4=|v_thread2Thread1of1ForFork0_#t~post4_7|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_11, ~t~0=v_~t~0_37, ~s~0=v_~s~0_35} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post3, thread2Thread1of1ForFork0_#t~post4, ~t~0, ~s~0][716], [42#L113-2true, 145#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 137#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 155#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 46#L85true, 132#true, 650#(and (<= (mod (+ ~T~0 1) 4294967296) 0) (= ~m~0 1) (< (div ~u~0 4294967296) (+ (div ~U~0 4294967296) 1)) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (or (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (< (+ (* 4294967296 (div (+ (- 1) ~s~0) 4294967296)) 1) ~s~0)) (= thread1Thread1of1ForFork1_~cond~0 0)), 100#L65-1true, Black: 165#(and (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), 149#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), Black: 168#(and (= ~s~0 ~S~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 173#true, Black: 166#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 361#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 359#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 312#(< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)), Black: 349#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (or (<= 1 thread3Thread1of1ForFork2_~cond~2) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)))), Black: 320#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 182#true, Black: 339#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 345#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (or (<= 1 thread3Thread1of1ForFork2_~cond~2) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)))), Black: 363#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 175#(and (= ~u~0 ~U~0) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~U~0)), Black: 343#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (or (<= 1 thread3Thread1of1ForFork2_~cond~2) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)))), 141#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 178#(and (= ~u~0 ~U~0) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~U~0) (= thread2Thread1of1ForFork0_~cond~1 1)), Black: 337#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 353#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 160#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4) (and (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|))))), Black: 347#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 335#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 351#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 206#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 357#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))]) [2023-08-30 01:05:51,515 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-30 01:05:51,515 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 01:05:51,515 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 01:05:51,515 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 01:05:51,579 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([441] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_9| 0) (= (mod v_thread2Thread1of1ForFork0_~cond~1_15 256) 0) (= |v_thread2Thread1of1ForFork0_#res.offset_9| 0)) InVars {thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_15} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_9|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_9|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base][612], [114#thread3EXITtrue, 44#thread2EXITtrue, 145#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 88#L114-1true, 137#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 467#(= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)), 155#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 132#true, Black: 165#(and (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), 149#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), Black: 168#(and (= ~s~0 ~S~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 166#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 173#true, Black: 361#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 359#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 312#(< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)), Black: 349#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (or (<= 1 thread3Thread1of1ForFork2_~cond~2) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)))), 182#true, Black: 320#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), Black: 339#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 345#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (or (<= 1 thread3Thread1of1ForFork2_~cond~2) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)))), Black: 175#(and (= ~u~0 ~U~0) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~U~0)), Black: 363#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 141#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 343#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (or (<= 1 thread3Thread1of1ForFork2_~cond~2) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)))), Black: 178#(and (= ~u~0 ~U~0) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~U~0) (= thread2Thread1of1ForFork0_~cond~1 1)), Black: 337#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 160#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4) (and (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|))))), Black: 353#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 347#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 335#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 351#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 206#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 357#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))]) [2023-08-30 01:05:51,579 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-30 01:05:51,579 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 01:05:51,579 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 01:05:51,580 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 01:05:51,580 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L72-->L65-1: Formula: (and (let ((.cse0 (mod v_~t~0_38 4294967296))) (or (and (= (+ v_~t~0_37 1) v_~t~0_38) (< 0 .cse0) (= (+ v_~s~0_36 1) v_~s~0_35)) (and (<= .cse0 0) (= |v_thread2Thread1of1ForFork0_#t~post4_8| |v_thread2Thread1of1ForFork0_#t~post4_7|) (= |v_thread2Thread1of1ForFork0_#t~post3_8| |v_thread2Thread1of1ForFork0_#t~post3_7|) (= v_~t~0_38 v_~t~0_37) (= v_~s~0_36 v_~s~0_35)))) (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_11 256) 0))) InVars {thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_8|, thread2Thread1of1ForFork0_#t~post4=|v_thread2Thread1of1ForFork0_#t~post4_8|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_11, ~t~0=v_~t~0_38, ~s~0=v_~s~0_36} OutVars{thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_7|, thread2Thread1of1ForFork0_#t~post4=|v_thread2Thread1of1ForFork0_#t~post4_7|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_11, ~t~0=v_~t~0_37, ~s~0=v_~s~0_35} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post3, thread2Thread1of1ForFork0_#t~post4, ~t~0, ~s~0][743], [114#thread3EXITtrue, 145#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 88#L114-1true, 137#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 155#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 654#(and (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (or (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (< (+ (* 4294967296 (div (+ (- 1) ~s~0) 4294967296)) 1) ~s~0))), 132#true, 100#L65-1true, Black: 165#(and (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), 149#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), Black: 168#(and (= ~s~0 ~S~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 166#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 173#true, Black: 361#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 359#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 312#(< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)), Black: 349#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (or (<= 1 thread3Thread1of1ForFork2_~cond~2) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)))), Black: 320#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 182#true, Black: 339#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 345#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (or (<= 1 thread3Thread1of1ForFork2_~cond~2) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)))), Black: 175#(and (= ~u~0 ~U~0) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~U~0)), Black: 363#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 141#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 343#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (or (<= 1 thread3Thread1of1ForFork2_~cond~2) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)))), Black: 178#(and (= ~u~0 ~U~0) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~U~0) (= thread2Thread1of1ForFork0_~cond~1 1)), Black: 337#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 160#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4) (and (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|))))), Black: 353#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 347#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 335#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 351#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 206#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 357#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))]) [2023-08-30 01:05:51,580 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-30 01:05:51,580 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 01:05:51,580 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 01:05:51,580 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 01:05:51,597 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([441] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_9| 0) (= (mod v_thread2Thread1of1ForFork0_~cond~1_15 256) 0) (= |v_thread2Thread1of1ForFork0_#res.offset_9| 0)) InVars {thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_15} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_9|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_9|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base][572], [44#thread2EXITtrue, 145#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 88#L114-1true, 137#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 155#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 46#L85true, 132#true, Black: 165#(and (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), 149#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), Black: 168#(and (= ~s~0 ~S~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 173#true, Black: 166#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 361#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 359#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 312#(< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)), Black: 349#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (or (<= 1 thread3Thread1of1ForFork2_~cond~2) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)))), 182#true, Black: 320#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), Black: 339#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 345#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (or (<= 1 thread3Thread1of1ForFork2_~cond~2) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)))), Black: 363#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 175#(and (= ~u~0 ~U~0) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~U~0)), Black: 343#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (or (<= 1 thread3Thread1of1ForFork2_~cond~2) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)))), 141#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 178#(and (= ~u~0 ~U~0) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~U~0) (= thread2Thread1of1ForFork0_~cond~1 1)), Black: 337#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 353#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 160#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4) (and (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|))))), Black: 347#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 335#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 351#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 206#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 357#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 636#(and (<= (mod (+ ~T~0 1) 4294967296) 0) (= ~m~0 1) (< (div ~u~0 4294967296) (+ (div ~U~0 4294967296) 1)) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))]) [2023-08-30 01:05:51,597 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-30 01:05:51,597 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 01:05:51,597 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 01:05:51,598 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 01:05:51,598 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L72-->L65-1: Formula: (and (let ((.cse0 (mod v_~t~0_38 4294967296))) (or (and (= (+ v_~t~0_37 1) v_~t~0_38) (< 0 .cse0) (= (+ v_~s~0_36 1) v_~s~0_35)) (and (<= .cse0 0) (= |v_thread2Thread1of1ForFork0_#t~post4_8| |v_thread2Thread1of1ForFork0_#t~post4_7|) (= |v_thread2Thread1of1ForFork0_#t~post3_8| |v_thread2Thread1of1ForFork0_#t~post3_7|) (= v_~t~0_38 v_~t~0_37) (= v_~s~0_36 v_~s~0_35)))) (not (= (mod v_thread2Thread1of1ForFork0_~cond~1_11 256) 0))) InVars {thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_8|, thread2Thread1of1ForFork0_#t~post4=|v_thread2Thread1of1ForFork0_#t~post4_8|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_11, ~t~0=v_~t~0_38, ~s~0=v_~s~0_36} OutVars{thread2Thread1of1ForFork0_#t~post3=|v_thread2Thread1of1ForFork0_#t~post3_7|, thread2Thread1of1ForFork0_#t~post4=|v_thread2Thread1of1ForFork0_#t~post4_7|, thread2Thread1of1ForFork0_~cond~1=v_thread2Thread1of1ForFork0_~cond~1_11, ~t~0=v_~t~0_37, ~s~0=v_~s~0_35} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post3, thread2Thread1of1ForFork0_#t~post4, ~t~0, ~s~0][716], [145#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 88#L114-1true, 137#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 155#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 46#L85true, 132#true, 650#(and (<= (mod (+ ~T~0 1) 4294967296) 0) (= ~m~0 1) (< (div ~u~0 4294967296) (+ (div ~U~0 4294967296) 1)) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (or (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (< (+ (* 4294967296 (div (+ (- 1) ~s~0) 4294967296)) 1) ~s~0)) (= thread1Thread1of1ForFork1_~cond~0 0)), 100#L65-1true, Black: 165#(and (= ~s~0 ~S~0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0)), 149#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), Black: 168#(and (= ~s~0 ~S~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ (* (div ~S~0 4294967296) 4294967296) 1) ~S~0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 173#true, Black: 166#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 361#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 359#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 312#(< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)), Black: 349#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (or (<= 1 thread3Thread1of1ForFork2_~cond~2) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)))), Black: 320#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)), 182#true, Black: 339#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 345#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (or (<= 1 thread3Thread1of1ForFork2_~cond~2) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)))), Black: 363#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 175#(and (= ~u~0 ~U~0) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~U~0)), Black: 343#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (or (<= 1 thread3Thread1of1ForFork2_~cond~2) (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)))), 141#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 178#(and (= ~u~0 ~U~0) (<= (+ (* (div ~U~0 4294967296) 4294967296) 1) ~U~0) (= thread2Thread1of1ForFork0_~cond~1 1)), Black: 337#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 353#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), 160#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (or (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4) (and (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|))))), Black: 347#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 335#(and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 351#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (= ~u~0 ~U~0) (= thread1Thread1of1ForFork1_~cond~0 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)) (<= 1 thread2Thread1of1ForFork0_~cond~1)), Black: 206#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 357#(and (<= (div thread3Thread1of1ForFork2_~cond~2 256) 0) (< (* (div ~U~0 4294967296) 4294967296) ~U~0) (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1))]) [2023-08-30 01:05:51,598 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-30 01:05:51,598 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 01:05:51,598 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 01:05:51,598 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 01:05:51,694 INFO L130 PetriNetUnfolder]: 9268/13530 cut-off events. [2023-08-30 01:05:51,694 INFO L131 PetriNetUnfolder]: For 65208/66731 co-relation queries the response was YES. [2023-08-30 01:05:51,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64004 conditions, 13530 events. 9268/13530 cut-off events. For 65208/66731 co-relation queries the response was YES. Maximal size of possible extension queue 795. Compared 80756 event pairs, 393 based on Foata normal form. 275/13707 useless extension candidates. Maximal degree in co-relation 63978. Up to 5458 conditions per place. [2023-08-30 01:05:51,845 INFO L137 encePairwiseOnDemand]: 228/239 looper letters, 384 selfloop transitions, 491 changer transitions 55/942 dead transitions. [2023-08-30 01:05:51,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 942 transitions, 8614 flow [2023-08-30 01:05:51,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2023-08-30 01:05:51,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2023-08-30 01:05:51,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 7371 transitions. [2023-08-30 01:05:51,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4112133891213389 [2023-08-30 01:05:51,864 INFO L72 ComplementDD]: Start complementDD. Operand 75 states and 7371 transitions. [2023-08-30 01:05:51,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 7371 transitions. [2023-08-30 01:05:51,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 01:05:51,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 75 states and 7371 transitions. [2023-08-30 01:05:51,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 76 states, 75 states have (on average 98.28) internal successors, (7371), 75 states have internal predecessors, (7371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:51,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 76 states, 76 states have (on average 239.0) internal successors, (18164), 76 states have internal predecessors, (18164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:51,905 INFO L81 ComplementDD]: Finished complementDD. Result has 76 states, 76 states have (on average 239.0) internal successors, (18164), 76 states have internal predecessors, (18164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:51,906 INFO L175 Difference]: Start difference. First operand has 83 places, 88 transitions, 662 flow. Second operand 75 states and 7371 transitions. [2023-08-30 01:05:51,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 942 transitions, 8614 flow [2023-08-30 01:05:52,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 942 transitions, 8405 flow, removed 78 selfloop flow, removed 2 redundant places. [2023-08-30 01:05:52,052 INFO L231 Difference]: Finished difference. Result has 185 places, 628 transitions, 6753 flow [2023-08-30 01:05:52,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=75, PETRI_FLOW=6753, PETRI_PLACES=185, PETRI_TRANSITIONS=628} [2023-08-30 01:05:52,053 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 140 predicate places. [2023-08-30 01:05:52,053 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 628 transitions, 6753 flow [2023-08-30 01:05:52,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 92.91304347826087) internal successors, (2137), 23 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:52,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 01:05:52,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 01:05:52,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-30 01:05:52,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-30 01:05:52,261 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 01:05:52,262 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 01:05:52,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1758161124, now seen corresponding path program 3 times [2023-08-30 01:05:52,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 01:05:52,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661283197] [2023-08-30 01:05:52,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 01:05:52,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 01:05:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 01:05:54,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 01:05:54,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 01:05:54,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661283197] [2023-08-30 01:05:54,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661283197] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 01:05:54,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930803861] [2023-08-30 01:05:54,874 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 01:05:54,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 01:05:54,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 01:05:54,875 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 01:05:54,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-30 01:05:55,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-30 01:05:55,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 01:05:55,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-30 01:05:55,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 01:05:55,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 01:05:55,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 01:05:56,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 01:05:56,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930803861] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 01:05:56,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 01:05:56,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2023-08-30 01:05:56,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812770855] [2023-08-30 01:05:56,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 01:05:56,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-30 01:05:56,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 01:05:56,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-30 01:05:56,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2023-08-30 01:05:57,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 239 [2023-08-30 01:05:57,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 628 transitions, 6753 flow. Second operand has 24 states, 24 states have (on average 88.875) internal successors, (2133), 24 states have internal predecessors, (2133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:05:57,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 01:05:57,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 239 [2023-08-30 01:05:57,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 01:06:53,173 INFO L130 PetriNetUnfolder]: 23322/34347 cut-off events. [2023-08-30 01:06:53,173 INFO L131 PetriNetUnfolder]: For 387916/387916 co-relation queries the response was YES. [2023-08-30 01:06:53,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201524 conditions, 34347 events. 23322/34347 cut-off events. For 387916/387916 co-relation queries the response was YES. Maximal size of possible extension queue 1613. Compared 230794 event pairs, 646 based on Foata normal form. 76/34423 useless extension candidates. Maximal degree in co-relation 201468. Up to 12265 conditions per place. [2023-08-30 01:06:53,575 INFO L137 encePairwiseOnDemand]: 225/239 looper letters, 679 selfloop transitions, 1377 changer transitions 942/2998 dead transitions. [2023-08-30 01:06:53,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 2998 transitions, 35555 flow [2023-08-30 01:06:53,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2023-08-30 01:06:53,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2023-08-30 01:06:53,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 13502 transitions. [2023-08-30 01:06:53,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3923175267317527 [2023-08-30 01:06:53,607 INFO L72 ComplementDD]: Start complementDD. Operand 144 states and 13502 transitions. [2023-08-30 01:06:53,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 13502 transitions. [2023-08-30 01:06:53,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 01:06:53,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 144 states and 13502 transitions. [2023-08-30 01:06:53,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 145 states, 144 states have (on average 93.76388888888889) internal successors, (13502), 144 states have internal predecessors, (13502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:06:53,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 145 states, 145 states have (on average 239.0) internal successors, (34655), 145 states have internal predecessors, (34655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:06:53,708 INFO L81 ComplementDD]: Finished complementDD. Result has 145 states, 145 states have (on average 239.0) internal successors, (34655), 145 states have internal predecessors, (34655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:06:53,708 INFO L175 Difference]: Start difference. First operand has 185 places, 628 transitions, 6753 flow. Second operand 144 states and 13502 transitions. [2023-08-30 01:06:53,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 2998 transitions, 35555 flow [2023-08-30 01:06:59,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 2998 transitions, 31906 flow, removed 1811 selfloop flow, removed 4 redundant places. [2023-08-30 01:06:59,899 INFO L231 Difference]: Finished difference. Result has 430 places, 1690 transitions, 21798 flow [2023-08-30 01:06:59,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=5680, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=352, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=144, PETRI_FLOW=21798, PETRI_PLACES=430, PETRI_TRANSITIONS=1690} [2023-08-30 01:06:59,900 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 385 predicate places. [2023-08-30 01:06:59,900 INFO L495 AbstractCegarLoop]: Abstraction has has 430 places, 1690 transitions, 21798 flow [2023-08-30 01:06:59,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 88.875) internal successors, (2133), 24 states have internal predecessors, (2133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:06:59,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 01:06:59,901 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 01:06:59,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-30 01:07:00,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 01:07:00,107 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 01:07:00,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 01:07:00,108 INFO L85 PathProgramCache]: Analyzing trace with hash 570604829, now seen corresponding path program 4 times [2023-08-30 01:07:00,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 01:07:00,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579281270] [2023-08-30 01:07:00,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 01:07:00,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 01:07:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 01:07:00,525 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 01:07:00,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 01:07:00,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579281270] [2023-08-30 01:07:00,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579281270] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 01:07:00,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808015787] [2023-08-30 01:07:00,526 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 01:07:00,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 01:07:00,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 01:07:00,528 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 01:07:00,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-30 01:07:00,616 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 01:07:00,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 01:07:00,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-30 01:07:00,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 01:07:00,767 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 01:07:00,768 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 01:07:00,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808015787] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 01:07:00,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 01:07:00,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2023-08-30 01:07:00,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858454408] [2023-08-30 01:07:00,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 01:07:00,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 01:07:00,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 01:07:00,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 01:07:00,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-08-30 01:07:00,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 239 [2023-08-30 01:07:00,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 1690 transitions, 21798 flow. Second operand has 7 states, 7 states have (on average 102.57142857142857) internal successors, (718), 7 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:07:00,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 01:07:00,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 239 [2023-08-30 01:07:00,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 01:07:10,555 INFO L130 PetriNetUnfolder]: 19709/28266 cut-off events. [2023-08-30 01:07:10,555 INFO L131 PetriNetUnfolder]: For 1195059/1195059 co-relation queries the response was YES. [2023-08-30 01:07:10,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238282 conditions, 28266 events. 19709/28266 cut-off events. For 1195059/1195059 co-relation queries the response was YES. Maximal size of possible extension queue 1569. Compared 177353 event pairs, 106 based on Foata normal form. 1238/29504 useless extension candidates. Maximal degree in co-relation 238124. Up to 9223 conditions per place. [2023-08-30 01:07:11,233 INFO L137 encePairwiseOnDemand]: 228/239 looper letters, 2872 selfloop transitions, 1375 changer transitions 0/4247 dead transitions. [2023-08-30 01:07:11,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 4247 transitions, 64008 flow [2023-08-30 01:07:11,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-30 01:07:11,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-30 01:07:11,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1737 transitions. [2023-08-30 01:07:11,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45423640167364016 [2023-08-30 01:07:11,237 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1737 transitions. [2023-08-30 01:07:11,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1737 transitions. [2023-08-30 01:07:11,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 01:07:11,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1737 transitions. [2023-08-30 01:07:11,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 108.5625) internal successors, (1737), 16 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:07:11,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 239.0) internal successors, (4063), 17 states have internal predecessors, (4063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:07:11,244 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 239.0) internal successors, (4063), 17 states have internal predecessors, (4063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:07:11,244 INFO L175 Difference]: Start difference. First operand has 430 places, 1690 transitions, 21798 flow. Second operand 16 states and 1737 transitions. [2023-08-30 01:07:11,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 4247 transitions, 64008 flow [2023-08-30 01:07:27,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 4247 transitions, 59915 flow, removed 1986 selfloop flow, removed 57 redundant places. [2023-08-30 01:07:27,712 INFO L231 Difference]: Finished difference. Result has 348 places, 2620 transitions, 37300 flow [2023-08-30 01:07:27,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=18972, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1616, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=487, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1002, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=37300, PETRI_PLACES=348, PETRI_TRANSITIONS=2620} [2023-08-30 01:07:27,713 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 303 predicate places. [2023-08-30 01:07:27,714 INFO L495 AbstractCegarLoop]: Abstraction has has 348 places, 2620 transitions, 37300 flow [2023-08-30 01:07:27,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.57142857142857) internal successors, (718), 7 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:07:27,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 01:07:27,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 01:07:27,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-30 01:07:27,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 01:07:27,915 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 01:07:27,915 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 01:07:27,915 INFO L85 PathProgramCache]: Analyzing trace with hash 707360567, now seen corresponding path program 1 times [2023-08-30 01:07:27,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 01:07:27,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845769442] [2023-08-30 01:07:27,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 01:07:27,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 01:07:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 01:07:28,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 01:07:28,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 01:07:28,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845769442] [2023-08-30 01:07:28,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845769442] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 01:07:28,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278552273] [2023-08-30 01:07:28,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 01:07:28,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 01:07:28,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 01:07:28,249 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 01:07:28,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-30 01:07:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 01:07:28,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-30 01:07:28,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 01:07:28,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 01:07:28,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 01:07:28,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 01:07:28,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278552273] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 01:07:28,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 01:07:28,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 14 [2023-08-30 01:07:28,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321470617] [2023-08-30 01:07:28,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 01:07:28,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-30 01:07:28,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 01:07:28,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-30 01:07:28,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2023-08-30 01:07:28,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 239 [2023-08-30 01:07:28,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 2620 transitions, 37300 flow. Second operand has 14 states, 14 states have (on average 102.0) internal successors, (1428), 14 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:07:28,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 01:07:28,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 239 [2023-08-30 01:07:28,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 01:07:57,382 INFO L130 PetriNetUnfolder]: 46799/67257 cut-off events. [2023-08-30 01:07:57,382 INFO L131 PetriNetUnfolder]: For 2762776/2762972 co-relation queries the response was YES. [2023-08-30 01:07:59,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621822 conditions, 67257 events. 46799/67257 cut-off events. For 2762776/2762972 co-relation queries the response was YES. Maximal size of possible extension queue 3229. Compared 471446 event pairs, 444 based on Foata normal form. 1030/68279 useless extension candidates. Maximal degree in co-relation 621695. Up to 20969 conditions per place. [2023-08-30 01:07:59,886 INFO L137 encePairwiseOnDemand]: 229/239 looper letters, 3660 selfloop transitions, 3807 changer transitions 242/7720 dead transitions. [2023-08-30 01:07:59,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 7720 transitions, 132859 flow [2023-08-30 01:07:59,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-08-30 01:07:59,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-08-30 01:07:59,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 3145 transitions. [2023-08-30 01:07:59,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4537584764103304 [2023-08-30 01:07:59,891 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 3145 transitions. [2023-08-30 01:07:59,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 3145 transitions. [2023-08-30 01:07:59,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 01:07:59,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 3145 transitions. [2023-08-30 01:07:59,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 108.44827586206897) internal successors, (3145), 29 states have internal predecessors, (3145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:07:59,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 239.0) internal successors, (7170), 30 states have internal predecessors, (7170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:07:59,903 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 239.0) internal successors, (7170), 30 states have internal predecessors, (7170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:07:59,903 INFO L175 Difference]: Start difference. First operand has 348 places, 2620 transitions, 37300 flow. Second operand 29 states and 3145 transitions. [2023-08-30 01:07:59,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 7720 transitions, 132859 flow [2023-08-30 01:09:47,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 7720 transitions, 129151 flow, removed 1817 selfloop flow, removed 11 redundant places. [2023-08-30 01:09:47,637 INFO L231 Difference]: Finished difference. Result has 387 places, 5456 transitions, 97451 flow [2023-08-30 01:09:47,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=36660, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2619, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1367, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=983, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=97451, PETRI_PLACES=387, PETRI_TRANSITIONS=5456} [2023-08-30 01:09:47,640 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 342 predicate places. [2023-08-30 01:09:47,640 INFO L495 AbstractCegarLoop]: Abstraction has has 387 places, 5456 transitions, 97451 flow [2023-08-30 01:09:47,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 102.0) internal successors, (1428), 14 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:09:47,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 01:09:47,641 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 01:09:47,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-30 01:09:47,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-30 01:09:47,846 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 01:09:47,847 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 01:09:47,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1767353003, now seen corresponding path program 2 times [2023-08-30 01:09:47,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 01:09:47,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786770519] [2023-08-30 01:09:47,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 01:09:47,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 01:09:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 01:09:49,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 01:09:49,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 01:09:49,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786770519] [2023-08-30 01:09:49,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786770519] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 01:09:49,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954574645] [2023-08-30 01:09:49,188 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 01:09:49,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 01:09:49,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 01:09:49,189 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 01:09:49,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-30 01:09:49,348 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 01:09:49,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 01:09:49,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-30 01:09:49,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 01:09:50,419 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 01:09:50,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 01:09:52,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 01:09:52,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954574645] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 01:09:52,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 01:09:52,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2023-08-30 01:09:52,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390830302] [2023-08-30 01:09:52,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 01:09:52,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-30 01:09:52,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 01:09:52,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-30 01:09:52,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2023-08-30 01:09:53,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 239 [2023-08-30 01:09:53,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 5456 transitions, 97451 flow. Second operand has 23 states, 23 states have (on average 96.8695652173913) internal successors, (2228), 23 states have internal predecessors, (2228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:09:53,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 01:09:53,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 239 [2023-08-30 01:09:53,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 01:11:25,102 INFO L130 PetriNetUnfolder]: 60421/89331 cut-off events. [2023-08-30 01:11:25,102 INFO L131 PetriNetUnfolder]: For 3716722/3719877 co-relation queries the response was YES. [2023-08-30 01:11:28,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 887086 conditions, 89331 events. 60421/89331 cut-off events. For 3716722/3719877 co-relation queries the response was YES. Maximal size of possible extension queue 4427. Compared 688079 event pairs, 1847 based on Foata normal form. 908/90067 useless extension candidates. Maximal degree in co-relation 886946. Up to 31335 conditions per place. [2023-08-30 01:11:29,520 INFO L137 encePairwiseOnDemand]: 230/239 looper letters, 3713 selfloop transitions, 4175 changer transitions 627/8808 dead transitions. [2023-08-30 01:11:29,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 8808 transitions, 177151 flow [2023-08-30 01:11:29,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-08-30 01:11:29,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2023-08-30 01:11:29,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 6755 transitions. [2023-08-30 01:11:29,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421844751139699 [2023-08-30 01:11:29,529 INFO L72 ComplementDD]: Start complementDD. Operand 67 states and 6755 transitions. [2023-08-30 01:11:29,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 6755 transitions. [2023-08-30 01:11:29,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 01:11:29,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 67 states and 6755 transitions. [2023-08-30 01:11:29,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 68 states, 67 states have (on average 100.82089552238806) internal successors, (6755), 67 states have internal predecessors, (6755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:11:29,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 68 states, 68 states have (on average 239.0) internal successors, (16252), 68 states have internal predecessors, (16252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:11:29,557 INFO L81 ComplementDD]: Finished complementDD. Result has 68 states, 68 states have (on average 239.0) internal successors, (16252), 68 states have internal predecessors, (16252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:11:29,557 INFO L175 Difference]: Start difference. First operand has 387 places, 5456 transitions, 97451 flow. Second operand 67 states and 6755 transitions. [2023-08-30 01:11:29,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 8808 transitions, 177151 flow [2023-08-30 01:15:06,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 8808 transitions, 173003 flow, removed 2067 selfloop flow, removed 2 redundant places. [2023-08-30 01:15:06,741 INFO L231 Difference]: Finished difference. Result has 500 places, 7263 transitions, 147195 flow [2023-08-30 01:15:06,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=95319, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=5456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2644, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=67, PETRI_FLOW=147195, PETRI_PLACES=500, PETRI_TRANSITIONS=7263} [2023-08-30 01:15:06,746 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 455 predicate places. [2023-08-30 01:15:06,746 INFO L495 AbstractCegarLoop]: Abstraction has has 500 places, 7263 transitions, 147195 flow [2023-08-30 01:15:06,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 96.8695652173913) internal successors, (2228), 23 states have internal predecessors, (2228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:15:06,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 01:15:06,747 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 01:15:06,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-30 01:15:06,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-30 01:15:06,961 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-08-30 01:15:06,962 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 01:15:06,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1083429337, now seen corresponding path program 3 times [2023-08-30 01:15:06,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 01:15:06,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847485017] [2023-08-30 01:15:06,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 01:15:06,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 01:15:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 01:15:08,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 01:15:08,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 01:15:08,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847485017] [2023-08-30 01:15:08,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847485017] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 01:15:08,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064664098] [2023-08-30 01:15:08,811 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 01:15:08,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 01:15:08,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 01:15:08,812 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 01:15:08,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-30 01:15:08,985 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 01:15:08,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 01:15:08,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-30 01:15:08,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 01:15:10,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 01:15:10,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 01:15:11,542 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 01:15:11,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064664098] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 01:15:11,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 01:15:11,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 28 [2023-08-30 01:15:11,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502042101] [2023-08-30 01:15:11,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 01:15:11,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-30 01:15:11,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 01:15:11,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-30 01:15:11,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=699, Unknown=0, NotChecked=0, Total=870 [2023-08-30 01:15:13,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-30 01:15:15,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-30 01:15:15,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 239 [2023-08-30 01:15:15,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 500 places, 7263 transitions, 147195 flow. Second operand has 30 states, 30 states have (on average 88.5) internal successors, (2655), 30 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:15:15,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 01:15:15,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 239 [2023-08-30 01:15:15,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 01:18:21,589 INFO L130 PetriNetUnfolder]: 88472/127001 cut-off events. [2023-08-30 01:18:21,589 INFO L131 PetriNetUnfolder]: For 6462801/6462801 co-relation queries the response was YES. [2023-08-30 01:18:28,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1406019 conditions, 127001 events. 88472/127001 cut-off events. For 6462801/6462801 co-relation queries the response was YES. Maximal size of possible extension queue 6185. Compared 959765 event pairs, 395 based on Foata normal form. 144/127145 useless extension candidates. Maximal degree in co-relation 1405830. Up to 41543 conditions per place. [2023-08-30 01:18:29,066 INFO L137 encePairwiseOnDemand]: 224/239 looper letters, 3927 selfloop transitions, 11433 changer transitions 669/16029 dead transitions. [2023-08-30 01:18:29,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 666 places, 16029 transitions, 367649 flow [2023-08-30 01:18:29,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2023-08-30 01:18:29,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2023-08-30 01:18:29,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 17049 transitions. [2023-08-30 01:18:29,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3941145195219492 [2023-08-30 01:18:29,079 INFO L72 ComplementDD]: Start complementDD. Operand 181 states and 17049 transitions. [2023-08-30 01:18:29,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 181 states and 17049 transitions. [2023-08-30 01:18:29,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 01:18:29,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 181 states and 17049 transitions. [2023-08-30 01:18:29,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 182 states, 181 states have (on average 94.19337016574586) internal successors, (17049), 181 states have internal predecessors, (17049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:18:29,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 182 states, 182 states have (on average 239.0) internal successors, (43498), 182 states have internal predecessors, (43498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:18:29,142 INFO L81 ComplementDD]: Finished complementDD. Result has 182 states, 182 states have (on average 239.0) internal successors, (43498), 182 states have internal predecessors, (43498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 01:18:29,143 INFO L175 Difference]: Start difference. First operand has 500 places, 7263 transitions, 147195 flow. Second operand 181 states and 17049 transitions. [2023-08-30 01:18:29,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 666 places, 16029 transitions, 367649 flow Killed by 15