./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ed4cbcf73a390a7811d007883e420d1e9d8d4b9f5e59201847b4262dc4b0025 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:14:18,921 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:14:18,923 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:14:18,973 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:14:18,974 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:14:18,978 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:14:18,981 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:14:18,989 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:14:18,991 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:14:18,998 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:14:18,999 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:14:19,002 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:14:19,002 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:14:19,006 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:14:19,009 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:14:19,011 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:14:19,013 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:14:19,014 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:14:19,016 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:14:19,025 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:14:19,028 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:14:19,029 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:14:19,033 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:14:19,034 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:14:19,044 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:14:19,045 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:14:19,046 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:14:19,048 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:14:19,048 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:14:19,049 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:14:19,051 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:14:19,052 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:14:19,054 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:14:19,055 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:14:19,057 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:14:19,057 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:14:19,058 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:14:19,058 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:14:19,059 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:14:19,060 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:14:19,060 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:14:19,061 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:14:19,105 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:14:19,106 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:14:19,107 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:14:19,107 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:14:19,108 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:14:19,108 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:14:19,109 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:14:19,109 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:14:19,109 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:14:19,110 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:14:19,111 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:14:19,111 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:14:19,111 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:14:19,112 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:14:19,112 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:14:19,112 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:14:19,112 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:14:19,112 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:14:19,113 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:14:19,113 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:14:19,113 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:14:19,113 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:14:19,114 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:14:19,114 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:14:19,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:14:19,114 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:14:19,116 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:14:19,117 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:14:19,117 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:14:19,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:14:19,118 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:14:19,118 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:14:19,119 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:14:19,119 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc 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 ! call(reach_error())) ) 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 -> 4ed4cbcf73a390a7811d007883e420d1e9d8d4b9f5e59201847b4262dc4b0025 [2022-11-02 20:14:19,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:14:19,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:14:19,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:14:19,517 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:14:19,518 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:14:19,520 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2022-11-02 20:14:19,622 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/data/8e863e0d7/5bee15f519204b56baffcb9eac16b258/FLAGcf495be65 [2022-11-02 20:14:20,128 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:14:20,129 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2022-11-02 20:14:20,137 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/data/8e863e0d7/5bee15f519204b56baffcb9eac16b258/FLAGcf495be65 [2022-11-02 20:14:20,482 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/data/8e863e0d7/5bee15f519204b56baffcb9eac16b258 [2022-11-02 20:14:20,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:14:20,489 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:14:20,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:14:20,496 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:14:20,500 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:14:20,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:14:20" (1/1) ... [2022-11-02 20:14:20,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f7762d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:14:20, skipping insertion in model container [2022-11-02 20:14:20,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:14:20" (1/1) ... [2022-11-02 20:14:20,515 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:14:20,547 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:14:20,898 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/sv-benchmarks/c/weaver/parallel-misc-4.wvr.c[2950,2963] [2022-11-02 20:14:20,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:14:20,925 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:14:20,969 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/sv-benchmarks/c/weaver/parallel-misc-4.wvr.c[2950,2963] [2022-11-02 20:14:20,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:14:20,999 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:14:21,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:14:21 WrapperNode [2022-11-02 20:14:21,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:14:21,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:14:21,002 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:14:21,002 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:14:21,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:14:21" (1/1) ... [2022-11-02 20:14:21,037 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:14:21" (1/1) ... [2022-11-02 20:14:21,073 INFO L138 Inliner]: procedures = 22, calls = 43, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2022-11-02 20:14:21,074 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:14:21,075 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:14:21,075 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:14:21,075 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:14:21,086 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:14:21" (1/1) ... [2022-11-02 20:14:21,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:14:21" (1/1) ... [2022-11-02 20:14:21,094 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:14:21" (1/1) ... [2022-11-02 20:14:21,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:14:21" (1/1) ... [2022-11-02 20:14:21,107 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:14:21" (1/1) ... [2022-11-02 20:14:21,111 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:14:21" (1/1) ... [2022-11-02 20:14:21,113 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:14:21" (1/1) ... [2022-11-02 20:14:21,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:14:21" (1/1) ... [2022-11-02 20:14:21,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:14:21,118 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:14:21,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:14:21,118 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:14:21,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:14:21" (1/1) ... [2022-11-02 20:14:21,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:14:21,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:14:21,163 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:14:21,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:14:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:14:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:14:21,231 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:14:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:14:21,231 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:14:21,232 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 20:14:21,232 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 20:14:21,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:14:21,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:14:21,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:14:21,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:14:21,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:14:21,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:14:21,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:14:21,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:14:21,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:14:21,235 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:14:21,410 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:14:21,414 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:14:21,719 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:14:21,763 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:14:21,763 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-02 20:14:21,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:14:21 BoogieIcfgContainer [2022-11-02 20:14:21,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:14:21,779 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:14:21,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:14:21,785 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:14:21,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:14:20" (1/3) ... [2022-11-02 20:14:21,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb7a7e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:14:21, skipping insertion in model container [2022-11-02 20:14:21,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:14:21" (2/3) ... [2022-11-02 20:14:21,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb7a7e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:14:21, skipping insertion in model container [2022-11-02 20:14:21,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:14:21" (3/3) ... [2022-11-02 20:14:21,795 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-4.wvr.c [2022-11-02 20:14:21,807 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:14:21,820 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:14:21,821 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:14:21,821 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:14:21,973 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-02 20:14:22,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 105 transitions, 234 flow [2022-11-02 20:14:22,128 INFO L130 PetriNetUnfolder]: 7/102 cut-off events. [2022-11-02 20:14:22,128 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 20:14:22,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 102 events. 7/102 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-11-02 20:14:22,133 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 105 transitions, 234 flow [2022-11-02 20:14:22,138 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 91 transitions, 200 flow [2022-11-02 20:14:22,151 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:14:22,160 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@4f5ef9c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:14:22,160 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-02 20:14:22,201 INFO L130 PetriNetUnfolder]: 7/90 cut-off events. [2022-11-02 20:14:22,202 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 20:14:22,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:14:22,203 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:14:22,204 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 20:14:22,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:22,211 INFO L85 PathProgramCache]: Analyzing trace with hash 533026207, now seen corresponding path program 1 times [2022-11-02 20:14:22,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:22,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801189277] [2022-11-02 20:14:22,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:22,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:22,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:14:22,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:22,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801189277] [2022-11-02 20:14:22,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801189277] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:22,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:22,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:14:22,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142138234] [2022-11-02 20:14:22,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:22,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:14:22,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:22,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:14:22,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:14:22,678 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 105 [2022-11-02 20:14:22,686 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 91 transitions, 200 flow. Second operand has 2 states, 2 states have (on average 97.0) internal successors, (194), 2 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:22,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:14:22,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 105 [2022-11-02 20:14:22,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:14:22,810 INFO L130 PetriNetUnfolder]: 13/115 cut-off events. [2022-11-02 20:14:22,811 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-11-02 20:14:22,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 115 events. 13/115 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 160 event pairs, 2 based on Foata normal form. 11/115 useless extension candidates. Maximal degree in co-relation 100. Up to 20 conditions per place. [2022-11-02 20:14:22,817 INFO L137 encePairwiseOnDemand]: 102/105 looper letters, 8 selfloop transitions, 0 changer transitions 1/88 dead transitions. [2022-11-02 20:14:22,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 88 transitions, 210 flow [2022-11-02 20:14:22,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:14:22,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-02 20:14:22,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 197 transitions. [2022-11-02 20:14:22,835 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9380952380952381 [2022-11-02 20:14:22,836 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 197 transitions. [2022-11-02 20:14:22,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 197 transitions. [2022-11-02 20:14:22,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:14:22,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 197 transitions. [2022-11-02 20:14:22,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 98.5) internal successors, (197), 2 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:22,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:22,861 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:22,864 INFO L175 Difference]: Start difference. First operand has 94 places, 91 transitions, 200 flow. Second operand 2 states and 197 transitions. [2022-11-02 20:14:22,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 88 transitions, 210 flow [2022-11-02 20:14:22,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 88 transitions, 198 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-02 20:14:22,923 INFO L231 Difference]: Finished difference. Result has 89 places, 87 transitions, 180 flow [2022-11-02 20:14:22,925 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=180, PETRI_PLACES=89, PETRI_TRANSITIONS=87} [2022-11-02 20:14:22,938 INFO L287 CegarLoopForPetriNet]: 94 programPoint places, -5 predicate places. [2022-11-02 20:14:22,939 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 87 transitions, 180 flow [2022-11-02 20:14:22,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 97.0) internal successors, (194), 2 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:22,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:14:22,954 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:14:22,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:14:22,955 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 20:14:22,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:22,958 INFO L85 PathProgramCache]: Analyzing trace with hash -525475073, now seen corresponding path program 1 times [2022-11-02 20:14:22,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:22,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261585206] [2022-11-02 20:14:22,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:22,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:23,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:23,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:14:23,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:23,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261585206] [2022-11-02 20:14:23,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261585206] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:23,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:23,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:14:23,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22987063] [2022-11-02 20:14:23,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:23,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:14:23,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:23,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:14:23,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:14:23,744 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 105 [2022-11-02 20:14:23,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 87 transitions, 180 flow. Second operand has 6 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:23,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:14:23,746 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 105 [2022-11-02 20:14:23,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:14:24,030 INFO L130 PetriNetUnfolder]: 79/268 cut-off events. [2022-11-02 20:14:24,030 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-02 20:14:24,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 268 events. 79/268 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 936 event pairs, 9 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 402. Up to 53 conditions per place. [2022-11-02 20:14:24,034 INFO L137 encePairwiseOnDemand]: 99/105 looper letters, 30 selfloop transitions, 6 changer transitions 0/102 dead transitions. [2022-11-02 20:14:24,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 102 transitions, 285 flow [2022-11-02 20:14:24,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:14:24,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:14:24,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 511 transitions. [2022-11-02 20:14:24,044 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8111111111111111 [2022-11-02 20:14:24,044 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 511 transitions. [2022-11-02 20:14:24,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 511 transitions. [2022-11-02 20:14:24,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:14:24,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 511 transitions. [2022-11-02 20:14:24,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:24,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:24,057 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:24,058 INFO L175 Difference]: Start difference. First operand has 89 places, 87 transitions, 180 flow. Second operand 6 states and 511 transitions. [2022-11-02 20:14:24,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 102 transitions, 285 flow [2022-11-02 20:14:24,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 102 transitions, 285 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:14:24,063 INFO L231 Difference]: Finished difference. Result has 95 places, 89 transitions, 205 flow [2022-11-02 20:14:24,065 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=205, PETRI_PLACES=95, PETRI_TRANSITIONS=89} [2022-11-02 20:14:24,066 INFO L287 CegarLoopForPetriNet]: 94 programPoint places, 1 predicate places. [2022-11-02 20:14:24,067 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 89 transitions, 205 flow [2022-11-02 20:14:24,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:24,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:14:24,069 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:14:24,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:14:24,069 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 20:14:24,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:24,071 INFO L85 PathProgramCache]: Analyzing trace with hash 902775591, now seen corresponding path program 2 times [2022-11-02 20:14:24,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:24,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345882377] [2022-11-02 20:14:24,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:24,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:24,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:14:24,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:24,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345882377] [2022-11-02 20:14:24,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345882377] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:24,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:24,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:14:24,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045537603] [2022-11-02 20:14:24,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:24,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:14:24,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:24,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:14:24,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:14:24,569 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 105 [2022-11-02 20:14:24,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 89 transitions, 205 flow. Second operand has 7 states, 7 states have (on average 81.28571428571429) internal successors, (569), 7 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:24,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:14:24,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 105 [2022-11-02 20:14:24,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:14:24,908 INFO L130 PetriNetUnfolder]: 66/249 cut-off events. [2022-11-02 20:14:24,908 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-11-02 20:14:24,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 414 conditions, 249 events. 66/249 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 852 event pairs, 12 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 408. Up to 46 conditions per place. [2022-11-02 20:14:24,912 INFO L137 encePairwiseOnDemand]: 97/105 looper letters, 28 selfloop transitions, 10 changer transitions 0/104 dead transitions. [2022-11-02 20:14:24,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 104 transitions, 325 flow [2022-11-02 20:14:24,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:14:24,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 20:14:24,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 591 transitions. [2022-11-02 20:14:24,916 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8040816326530612 [2022-11-02 20:14:24,917 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 591 transitions. [2022-11-02 20:14:24,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 591 transitions. [2022-11-02 20:14:24,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:14:24,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 591 transitions. [2022-11-02 20:14:24,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 84.42857142857143) internal successors, (591), 7 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:24,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 105.0) internal successors, (840), 8 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:24,925 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 105.0) internal successors, (840), 8 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:24,925 INFO L175 Difference]: Start difference. First operand has 95 places, 89 transitions, 205 flow. Second operand 7 states and 591 transitions. [2022-11-02 20:14:24,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 104 transitions, 325 flow [2022-11-02 20:14:24,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 104 transitions, 316 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-02 20:14:24,930 INFO L231 Difference]: Finished difference. Result has 102 places, 94 transitions, 258 flow [2022-11-02 20:14:24,931 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=258, PETRI_PLACES=102, PETRI_TRANSITIONS=94} [2022-11-02 20:14:24,932 INFO L287 CegarLoopForPetriNet]: 94 programPoint places, 8 predicate places. [2022-11-02 20:14:24,932 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 94 transitions, 258 flow [2022-11-02 20:14:24,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 81.28571428571429) internal successors, (569), 7 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:24,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:14:24,934 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:14:24,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:14:24,934 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 20:14:24,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:24,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1693986353, now seen corresponding path program 3 times [2022-11-02 20:14:24,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:24,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631659439] [2022-11-02 20:14:24,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:24,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:25,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:14:25,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:25,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631659439] [2022-11-02 20:14:25,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631659439] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:25,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:25,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:14:25,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081418080] [2022-11-02 20:14:25,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:25,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:14:25,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:25,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:14:25,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:14:25,477 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 105 [2022-11-02 20:14:25,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 94 transitions, 258 flow. Second operand has 7 states, 7 states have (on average 77.57142857142857) internal successors, (543), 7 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:25,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:14:25,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 105 [2022-11-02 20:14:25,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:14:25,852 INFO L130 PetriNetUnfolder]: 224/586 cut-off events. [2022-11-02 20:14:25,852 INFO L131 PetriNetUnfolder]: For 279/279 co-relation queries the response was YES. [2022-11-02 20:14:25,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1221 conditions, 586 events. 224/586 cut-off events. For 279/279 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3031 event pairs, 29 based on Foata normal form. 6/549 useless extension candidates. Maximal degree in co-relation 1212. Up to 157 conditions per place. [2022-11-02 20:14:25,863 INFO L137 encePairwiseOnDemand]: 94/105 looper letters, 35 selfloop transitions, 7 changer transitions 38/142 dead transitions. [2022-11-02 20:14:25,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 142 transitions, 586 flow [2022-11-02 20:14:25,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:14:25,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 20:14:25,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 748 transitions. [2022-11-02 20:14:25,868 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7915343915343915 [2022-11-02 20:14:25,868 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 748 transitions. [2022-11-02 20:14:25,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 748 transitions. [2022-11-02 20:14:25,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:14:25,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 748 transitions. [2022-11-02 20:14:25,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 83.11111111111111) internal successors, (748), 9 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:25,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:25,882 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:25,882 INFO L175 Difference]: Start difference. First operand has 102 places, 94 transitions, 258 flow. Second operand 9 states and 748 transitions. [2022-11-02 20:14:25,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 142 transitions, 586 flow [2022-11-02 20:14:25,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 142 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:14:25,895 INFO L231 Difference]: Finished difference. Result has 113 places, 95 transitions, 299 flow [2022-11-02 20:14:25,895 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=299, PETRI_PLACES=113, PETRI_TRANSITIONS=95} [2022-11-02 20:14:25,897 INFO L287 CegarLoopForPetriNet]: 94 programPoint places, 19 predicate places. [2022-11-02 20:14:25,897 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 95 transitions, 299 flow [2022-11-02 20:14:25,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.57142857142857) internal successors, (543), 7 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:25,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:14:25,898 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, 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, 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, 1, 1, 1] [2022-11-02 20:14:25,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:14:25,899 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 20:14:25,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:25,900 INFO L85 PathProgramCache]: Analyzing trace with hash -37950906, now seen corresponding path program 1 times [2022-11-02 20:14:25,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:25,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845718654] [2022-11-02 20:14:25,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:25,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:26,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:14:26,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:26,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845718654] [2022-11-02 20:14:26,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845718654] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:14:26,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660379523] [2022-11-02 20:14:26,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:26,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:14:26,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:14:26,237 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:14:26,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:14:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:26,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:14:26,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:14:26,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:14:26,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:14:26,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:14:26,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660379523] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:14:26,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:14:26,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-11-02 20:14:26,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278308833] [2022-11-02 20:14:26,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:14:26,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:14:26,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:26,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:14:26,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:14:26,629 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 105 [2022-11-02 20:14:26,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 95 transitions, 299 flow. Second operand has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:26,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:14:26,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 105 [2022-11-02 20:14:26,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:14:26,924 INFO L130 PetriNetUnfolder]: 242/623 cut-off events. [2022-11-02 20:14:26,924 INFO L131 PetriNetUnfolder]: For 668/668 co-relation queries the response was YES. [2022-11-02 20:14:26,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1515 conditions, 623 events. 242/623 cut-off events. For 668/668 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3134 event pairs, 19 based on Foata normal form. 15/584 useless extension candidates. Maximal degree in co-relation 1500. Up to 125 conditions per place. [2022-11-02 20:14:26,934 INFO L137 encePairwiseOnDemand]: 96/105 looper letters, 51 selfloop transitions, 22 changer transitions 1/142 dead transitions. [2022-11-02 20:14:26,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 142 transitions, 684 flow [2022-11-02 20:14:26,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:14:26,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 20:14:26,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 632 transitions. [2022-11-02 20:14:26,937 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8598639455782313 [2022-11-02 20:14:26,938 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 632 transitions. [2022-11-02 20:14:26,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 632 transitions. [2022-11-02 20:14:26,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:14:26,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 632 transitions. [2022-11-02 20:14:26,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 90.28571428571429) internal successors, (632), 7 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:26,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 105.0) internal successors, (840), 8 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:26,944 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 105.0) internal successors, (840), 8 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:26,944 INFO L175 Difference]: Start difference. First operand has 113 places, 95 transitions, 299 flow. Second operand 7 states and 632 transitions. [2022-11-02 20:14:26,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 142 transitions, 684 flow [2022-11-02 20:14:26,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 142 transitions, 658 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-11-02 20:14:26,953 INFO L231 Difference]: Finished difference. Result has 116 places, 113 transitions, 504 flow [2022-11-02 20:14:26,953 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=504, PETRI_PLACES=116, PETRI_TRANSITIONS=113} [2022-11-02 20:14:26,954 INFO L287 CegarLoopForPetriNet]: 94 programPoint places, 22 predicate places. [2022-11-02 20:14:26,955 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 113 transitions, 504 flow [2022-11-02 20:14:26,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:26,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:14:26,958 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, 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, 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, 1, 1, 1] [2022-11-02 20:14:27,012 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:14:27,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:14:27,185 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 20:14:27,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:27,186 INFO L85 PathProgramCache]: Analyzing trace with hash 883802218, now seen corresponding path program 2 times [2022-11-02 20:14:27,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:27,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172802661] [2022-11-02 20:14:27,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:27,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:27,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:14:27,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:27,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172802661] [2022-11-02 20:14:27,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172802661] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:27,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:27,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:14:27,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114004732] [2022-11-02 20:14:27,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:27,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:14:27,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:27,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:14:27,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:14:27,436 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 105 [2022-11-02 20:14:27,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 113 transitions, 504 flow. Second operand has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:27,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:14:27,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 105 [2022-11-02 20:14:27,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:14:27,621 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([259] L83-->L70: Formula: (not (= (mod v_thread2Thread1of1ForFork2_~lv_assert~1_5 256) 0)) InVars {thread2Thread1of1ForFork2_~lv_assert~1=v_thread2Thread1of1ForFork2_~lv_assert~1_5} OutVars{thread2Thread1of1ForFork2_~lv_assert~1=v_thread2Thread1of1ForFork2_~lv_assert~1_5} AuxVars[] AssignedVars[][66], [111#true, Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 24#L110-4true, Black: 633#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 638#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 164#true, Black: 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 166#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), 137#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 6#L46true, Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 127#true, 648#true, 35#L70true, 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 636#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 147#(<= 0 ~pos~0)]) [2022-11-02 20:14:27,621 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2022-11-02 20:14:27,622 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-11-02 20:14:27,622 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-11-02 20:14:27,622 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-11-02 20:14:27,638 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([268] thread3ENTRY-->L92: Formula: (= (ite (= (ite (<= 0 v_~pos~0_9) 1 0) 0) 0 1) v_~v_assert~0_5) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][81], [111#true, Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 633#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 638#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 164#true, 29#L59true, Black: 166#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 636#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 137#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#true, 57#L83true, 4#L111-4true, 27#L92true, 648#true, 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 147#(<= 0 ~pos~0)]) [2022-11-02 20:14:27,638 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is not cut-off event [2022-11-02 20:14:27,638 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is not cut-off event [2022-11-02 20:14:27,638 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is not cut-off event [2022-11-02 20:14:27,639 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is not cut-off event [2022-11-02 20:14:27,641 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([268] thread3ENTRY-->L92: Formula: (= (ite (= (ite (<= 0 v_~pos~0_9) 1 0) 0) 0 1) v_~v_assert~0_5) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][81], [111#true, Black: 633#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 638#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 164#true, Black: 166#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), 29#L59true, Black: 636#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), 50#L78true, Black: 137#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#true, 4#L111-4true, 27#L92true, 648#true, 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 147#(<= 0 ~pos~0)]) [2022-11-02 20:14:27,641 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-11-02 20:14:27,642 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 20:14:27,642 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 20:14:27,642 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-02 20:14:27,656 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([255] L57-->L59: Formula: (= v_~v_assert~0_2 v_thread1Thread1of1ForFork1_~lv_assert~0_7) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{thread1Thread1of1ForFork1_~lv_assert~0=v_thread1Thread1of1ForFork1_~lv_assert~0_7, ~v_assert~0=v_~v_assert~0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~lv_assert~0][96], [111#true, Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 633#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 164#true, Black: 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 29#L59true, Black: 166#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 636#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 50#L78true, Black: 137#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), 27#L92true, 4#L111-4true, 648#true, 638#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 127#true, Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 147#(<= 0 ~pos~0)]) [2022-11-02 20:14:27,656 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-11-02 20:14:27,656 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 20:14:27,656 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 20:14:27,656 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-02 20:14:27,677 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([268] thread3ENTRY-->L92: Formula: (= (ite (= (ite (<= 0 v_~pos~0_9) 1 0) 0) 0 1) v_~v_assert~0_5) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][81], [111#true, Black: 633#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 638#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 164#true, Black: 166#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), 29#L59true, Black: 636#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 137#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#true, 57#L83true, 4#L111-4true, 27#L92true, 648#true, 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 147#(<= 0 ~pos~0)]) [2022-11-02 20:14:27,680 INFO L383 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-11-02 20:14:27,680 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-02 20:14:27,680 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-11-02 20:14:27,681 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-02 20:14:27,681 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-02 20:14:27,703 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([259] L83-->L70: Formula: (not (= (mod v_thread2Thread1of1ForFork2_~lv_assert~1_5 256) 0)) InVars {thread2Thread1of1ForFork2_~lv_assert~1=v_thread2Thread1of1ForFork2_~lv_assert~1_5} OutVars{thread2Thread1of1ForFork2_~lv_assert~1=v_thread2Thread1of1ForFork2_~lv_assert~1_5} AuxVars[] AssignedVars[][66], [111#true, Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 633#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 638#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 164#true, Black: 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 166#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), 73#thread3ENTRYtrue, 137#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 6#L46true, Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 127#true, 4#L111-4true, 648#true, 35#L70true, 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 636#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 147#(<= 0 ~pos~0)]) [2022-11-02 20:14:27,703 INFO L383 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-11-02 20:14:27,703 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 20:14:27,703 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:14:27,703 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:14:27,735 INFO L130 PetriNetUnfolder]: 228/717 cut-off events. [2022-11-02 20:14:27,736 INFO L131 PetriNetUnfolder]: For 1640/1728 co-relation queries the response was YES. [2022-11-02 20:14:27,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2000 conditions, 717 events. 228/717 cut-off events. For 1640/1728 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4287 event pairs, 33 based on Foata normal form. 23/663 useless extension candidates. Maximal degree in co-relation 1982. Up to 120 conditions per place. [2022-11-02 20:14:27,750 INFO L137 encePairwiseOnDemand]: 99/105 looper letters, 20 selfloop transitions, 5 changer transitions 0/120 dead transitions. [2022-11-02 20:14:27,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 120 transitions, 573 flow [2022-11-02 20:14:27,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:14:27,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 20:14:27,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-11-02 20:14:27,753 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8380952380952381 [2022-11-02 20:14:27,753 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 440 transitions. [2022-11-02 20:14:27,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 440 transitions. [2022-11-02 20:14:27,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:14:27,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 440 transitions. [2022-11-02 20:14:27,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:27,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:27,782 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:27,782 INFO L175 Difference]: Start difference. First operand has 116 places, 113 transitions, 504 flow. Second operand 5 states and 440 transitions. [2022-11-02 20:14:27,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 120 transitions, 573 flow [2022-11-02 20:14:27,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 120 transitions, 573 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:14:27,794 INFO L231 Difference]: Finished difference. Result has 122 places, 115 transitions, 530 flow [2022-11-02 20:14:27,794 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=530, PETRI_PLACES=122, PETRI_TRANSITIONS=115} [2022-11-02 20:14:27,798 INFO L287 CegarLoopForPetriNet]: 94 programPoint places, 28 predicate places. [2022-11-02 20:14:27,798 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 115 transitions, 530 flow [2022-11-02 20:14:27,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:27,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:14:27,799 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, 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, 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, 1, 1, 1] [2022-11-02 20:14:27,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:14:27,800 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 20:14:27,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:27,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1808979198, now seen corresponding path program 1 times [2022-11-02 20:14:27,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:27,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517332669] [2022-11-02 20:14:27,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:27,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:28,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:14:28,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:28,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517332669] [2022-11-02 20:14:28,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517332669] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:28,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:28,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:14:28,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74444480] [2022-11-02 20:14:28,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:28,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:14:28,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:28,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:14:28,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:14:28,008 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 105 [2022-11-02 20:14:28,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 115 transitions, 530 flow. Second operand has 5 states, 5 states have (on average 85.8) internal successors, (429), 5 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:28,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:14:28,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 105 [2022-11-02 20:14:28,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:14:28,152 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([252] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][77], [111#true, Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 24#L110-4true, Black: 633#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 638#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 164#true, 652#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 44#L54true, 658#true, Black: 166#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), 137#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 36#L81true, Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 127#true, Black: 648#true, 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 636#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 147#(<= 0 ~pos~0)]) [2022-11-02 20:14:28,153 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2022-11-02 20:14:28,153 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-02 20:14:28,158 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-11-02 20:14:28,158 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-02 20:14:28,247 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([252] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][77], [111#true, Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 633#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 638#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 164#true, 652#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 44#L54true, Black: 166#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), 658#true, 73#thread3ENTRYtrue, 137#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 36#L81true, Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 127#true, Black: 648#true, 4#L111-4true, 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 636#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 147#(<= 0 ~pos~0)]) [2022-11-02 20:14:28,247 INFO L383 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-11-02 20:14:28,248 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:14:28,248 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 20:14:28,248 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 20:14:28,319 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([253] L52-->L54: Formula: (= (+ v_~pos~0_23 1) v_~pos~0_24) InVars {~pos~0=v_~pos~0_24} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_23} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][87], [111#true, Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 633#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 638#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 164#true, 44#L54true, Black: 166#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), 658#true, Black: 636#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 137#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 36#L81true, Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#true, Black: 652#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 27#L92true, 4#L111-4true, 648#true, 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 147#(<= 0 ~pos~0)]) [2022-11-02 20:14:28,320 INFO L383 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-11-02 20:14:28,320 INFO L386 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-11-02 20:14:28,320 INFO L386 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-11-02 20:14:28,321 INFO L386 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-11-02 20:14:28,343 INFO L130 PetriNetUnfolder]: 374/1001 cut-off events. [2022-11-02 20:14:28,344 INFO L131 PetriNetUnfolder]: For 1803/1853 co-relation queries the response was YES. [2022-11-02 20:14:28,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2853 conditions, 1001 events. 374/1001 cut-off events. For 1803/1853 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 6017 event pairs, 52 based on Foata normal form. 16/904 useless extension candidates. Maximal degree in co-relation 2833. Up to 214 conditions per place. [2022-11-02 20:14:28,363 INFO L137 encePairwiseOnDemand]: 99/105 looper letters, 22 selfloop transitions, 5 changer transitions 0/124 dead transitions. [2022-11-02 20:14:28,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 124 transitions, 614 flow [2022-11-02 20:14:28,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:14:28,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 20:14:28,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 441 transitions. [2022-11-02 20:14:28,366 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.84 [2022-11-02 20:14:28,366 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 441 transitions. [2022-11-02 20:14:28,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 441 transitions. [2022-11-02 20:14:28,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:14:28,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 441 transitions. [2022-11-02 20:14:28,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:28,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:28,371 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:28,372 INFO L175 Difference]: Start difference. First operand has 122 places, 115 transitions, 530 flow. Second operand 5 states and 441 transitions. [2022-11-02 20:14:28,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 124 transitions, 614 flow [2022-11-02 20:14:28,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 124 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:14:28,386 INFO L231 Difference]: Finished difference. Result has 126 places, 117 transitions, 552 flow [2022-11-02 20:14:28,387 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=552, PETRI_PLACES=126, PETRI_TRANSITIONS=117} [2022-11-02 20:14:28,388 INFO L287 CegarLoopForPetriNet]: 94 programPoint places, 32 predicate places. [2022-11-02 20:14:28,388 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 117 transitions, 552 flow [2022-11-02 20:14:28,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.8) internal successors, (429), 5 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:28,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:14:28,389 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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, 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, 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, 1, 1] [2022-11-02 20:14:28,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:14:28,390 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 20:14:28,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:28,391 INFO L85 PathProgramCache]: Analyzing trace with hash -195568119, now seen corresponding path program 1 times [2022-11-02 20:14:28,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:28,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134499493] [2022-11-02 20:14:28,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:28,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:28,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:28,780 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:14:28,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:28,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134499493] [2022-11-02 20:14:28,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134499493] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:14:28,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938629062] [2022-11-02 20:14:28,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:28,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:14:28,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:14:28,785 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:14:28,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:14:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:28,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:14:28,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:14:28,999 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:14:29,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:14:29,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:14:29,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938629062] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-02 20:14:29,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:14:29,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 9 [2022-11-02 20:14:29,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755237539] [2022-11-02 20:14:29,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:29,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:14:29,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:29,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:14:29,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:14:29,135 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 105 [2022-11-02 20:14:29,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 117 transitions, 552 flow. Second operand has 5 states, 5 states have (on average 84.8) internal successors, (424), 5 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:29,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:14:29,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 105 [2022-11-02 20:14:29,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:14:29,737 INFO L130 PetriNetUnfolder]: 746/1816 cut-off events. [2022-11-02 20:14:29,737 INFO L131 PetriNetUnfolder]: For 4859/4861 co-relation queries the response was YES. [2022-11-02 20:14:29,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6317 conditions, 1816 events. 746/1816 cut-off events. For 4859/4861 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12554 event pairs, 46 based on Foata normal form. 26/1827 useless extension candidates. Maximal degree in co-relation 6295. Up to 514 conditions per place. [2022-11-02 20:14:29,767 INFO L137 encePairwiseOnDemand]: 96/105 looper letters, 64 selfloop transitions, 43 changer transitions 0/179 dead transitions. [2022-11-02 20:14:29,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 179 transitions, 1236 flow [2022-11-02 20:14:29,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:14:29,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 20:14:29,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 635 transitions. [2022-11-02 20:14:29,770 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8639455782312925 [2022-11-02 20:14:29,770 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 635 transitions. [2022-11-02 20:14:29,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 635 transitions. [2022-11-02 20:14:29,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:14:29,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 635 transitions. [2022-11-02 20:14:29,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 90.71428571428571) internal successors, (635), 7 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:29,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 105.0) internal successors, (840), 8 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:29,776 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 105.0) internal successors, (840), 8 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:29,776 INFO L175 Difference]: Start difference. First operand has 126 places, 117 transitions, 552 flow. Second operand 7 states and 635 transitions. [2022-11-02 20:14:29,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 179 transitions, 1236 flow [2022-11-02 20:14:29,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 179 transitions, 1232 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:14:29,797 INFO L231 Difference]: Finished difference. Result has 135 places, 146 transitions, 1017 flow [2022-11-02 20:14:29,797 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1017, PETRI_PLACES=135, PETRI_TRANSITIONS=146} [2022-11-02 20:14:29,801 INFO L287 CegarLoopForPetriNet]: 94 programPoint places, 41 predicate places. [2022-11-02 20:14:29,801 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 146 transitions, 1017 flow [2022-11-02 20:14:29,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.8) internal successors, (424), 5 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:29,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:14:29,802 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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, 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, 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, 1, 1] [2022-11-02 20:14:29,851 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:14:30,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:14:30,016 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 20:14:30,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:30,017 INFO L85 PathProgramCache]: Analyzing trace with hash 766735449, now seen corresponding path program 2 times [2022-11-02 20:14:30,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:30,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392659796] [2022-11-02 20:14:30,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:30,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:30,364 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:14:30,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:30,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392659796] [2022-11-02 20:14:30,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392659796] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:30,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:30,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:14:30,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723051968] [2022-11-02 20:14:30,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:30,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:14:30,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:30,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:14:30,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:14:30,368 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 105 [2022-11-02 20:14:30,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 146 transitions, 1017 flow. Second operand has 8 states, 8 states have (on average 77.75) internal successors, (622), 8 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:30,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:14:30,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 105 [2022-11-02 20:14:30,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:14:32,068 INFO L130 PetriNetUnfolder]: 1855/4661 cut-off events. [2022-11-02 20:14:32,069 INFO L131 PetriNetUnfolder]: For 22727/22848 co-relation queries the response was YES. [2022-11-02 20:14:32,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19028 conditions, 4661 events. 1855/4661 cut-off events. For 22727/22848 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 40429 event pairs, 178 based on Foata normal form. 62/4637 useless extension candidates. Maximal degree in co-relation 19000. Up to 818 conditions per place. [2022-11-02 20:14:32,143 INFO L137 encePairwiseOnDemand]: 92/105 looper letters, 170 selfloop transitions, 29 changer transitions 83/359 dead transitions. [2022-11-02 20:14:32,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 359 transitions, 3698 flow [2022-11-02 20:14:32,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:14:32,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-02 20:14:32,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1012 transitions. [2022-11-02 20:14:32,147 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8031746031746032 [2022-11-02 20:14:32,147 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1012 transitions. [2022-11-02 20:14:32,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1012 transitions. [2022-11-02 20:14:32,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:14:32,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1012 transitions. [2022-11-02 20:14:32,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 84.33333333333333) internal successors, (1012), 12 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:32,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 105.0) internal successors, (1365), 13 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:32,158 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 105.0) internal successors, (1365), 13 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:32,158 INFO L175 Difference]: Start difference. First operand has 135 places, 146 transitions, 1017 flow. Second operand 12 states and 1012 transitions. [2022-11-02 20:14:32,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 359 transitions, 3698 flow [2022-11-02 20:14:32,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 359 transitions, 3662 flow, removed 18 selfloop flow, removed 0 redundant places. [2022-11-02 20:14:32,210 INFO L231 Difference]: Finished difference. Result has 154 places, 170 transitions, 1444 flow [2022-11-02 20:14:32,211 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=999, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1444, PETRI_PLACES=154, PETRI_TRANSITIONS=170} [2022-11-02 20:14:32,212 INFO L287 CegarLoopForPetriNet]: 94 programPoint places, 60 predicate places. [2022-11-02 20:14:32,212 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 170 transitions, 1444 flow [2022-11-02 20:14:32,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 77.75) internal successors, (622), 8 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:32,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:14:32,213 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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, 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, 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, 1, 1] [2022-11-02 20:14:32,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:14:32,214 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 20:14:32,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:32,215 INFO L85 PathProgramCache]: Analyzing trace with hash -218705779, now seen corresponding path program 3 times [2022-11-02 20:14:32,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:32,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573100495] [2022-11-02 20:14:32,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:32,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:32,620 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:14:32,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:32,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573100495] [2022-11-02 20:14:32,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573100495] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:14:32,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080437987] [2022-11-02 20:14:32,621 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:14:32,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:14:32,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:14:32,625 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:14:32,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:14:32,766 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-02 20:14:32,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:14:32,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:14:32,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:14:32,858 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:14:32,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:14:32,991 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:14:32,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080437987] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-02 20:14:32,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:14:32,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 9 [2022-11-02 20:14:32,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166705997] [2022-11-02 20:14:32,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:32,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:14:32,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:32,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:14:32,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:14:32,995 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 105 [2022-11-02 20:14:32,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 170 transitions, 1444 flow. Second operand has 5 states, 5 states have (on average 84.8) internal successors, (424), 5 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:32,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:14:32,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 105 [2022-11-02 20:14:32,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:14:34,634 INFO L130 PetriNetUnfolder]: 1875/4663 cut-off events. [2022-11-02 20:14:34,634 INFO L131 PetriNetUnfolder]: For 32410/32471 co-relation queries the response was YES. [2022-11-02 20:14:34,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21797 conditions, 4663 events. 1875/4663 cut-off events. For 32410/32471 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 40819 event pairs, 69 based on Foata normal form. 91/4731 useless extension candidates. Maximal degree in co-relation 21760. Up to 2114 conditions per place. [2022-11-02 20:14:34,727 INFO L137 encePairwiseOnDemand]: 94/105 looper letters, 114 selfloop transitions, 73 changer transitions 0/266 dead transitions. [2022-11-02 20:14:34,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 266 transitions, 2897 flow [2022-11-02 20:14:34,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:14:34,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:14:34,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 545 transitions. [2022-11-02 20:14:34,730 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8650793650793651 [2022-11-02 20:14:34,730 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 545 transitions. [2022-11-02 20:14:34,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 545 transitions. [2022-11-02 20:14:34,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:14:34,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 545 transitions. [2022-11-02 20:14:34,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.83333333333333) internal successors, (545), 6 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:34,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:34,736 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:34,736 INFO L175 Difference]: Start difference. First operand has 154 places, 170 transitions, 1444 flow. Second operand 6 states and 545 transitions. [2022-11-02 20:14:34,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 266 transitions, 2897 flow [2022-11-02 20:14:34,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 266 transitions, 2811 flow, removed 41 selfloop flow, removed 4 redundant places. [2022-11-02 20:14:34,866 INFO L231 Difference]: Finished difference. Result has 157 places, 223 transitions, 2424 flow [2022-11-02 20:14:34,867 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1396, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2424, PETRI_PLACES=157, PETRI_TRANSITIONS=223} [2022-11-02 20:14:34,868 INFO L287 CegarLoopForPetriNet]: 94 programPoint places, 63 predicate places. [2022-11-02 20:14:34,869 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 223 transitions, 2424 flow [2022-11-02 20:14:34,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.8) internal successors, (424), 5 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:34,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:14:34,870 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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, 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, 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, 1, 1] [2022-11-02 20:14:34,916 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:14:35,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-02 20:14:35,089 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 20:14:35,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:35,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1477421223, now seen corresponding path program 1 times [2022-11-02 20:14:35,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:35,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353139734] [2022-11-02 20:14:35,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:35,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:35,399 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:14:35,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:35,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353139734] [2022-11-02 20:14:35,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353139734] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:14:35,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723025502] [2022-11-02 20:14:35,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:35,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:14:35,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:14:35,402 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:14:35,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:14:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:35,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-02 20:14:35,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:14:35,784 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:14:35,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:14:35,939 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:14:35,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723025502] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:14:35,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:14:35,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 14 [2022-11-02 20:14:35,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168304865] [2022-11-02 20:14:35,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:14:35,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:14:35,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:35,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:14:35,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:14:35,945 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 105 [2022-11-02 20:14:35,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 223 transitions, 2424 flow. Second operand has 14 states, 14 states have (on average 77.78571428571429) internal successors, (1089), 14 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:35,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:14:35,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 105 [2022-11-02 20:14:35,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:14:39,677 INFO L130 PetriNetUnfolder]: 3633/9379 cut-off events. [2022-11-02 20:14:39,678 INFO L131 PetriNetUnfolder]: For 79485/79682 co-relation queries the response was YES. [2022-11-02 20:14:39,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47731 conditions, 9379 events. 3633/9379 cut-off events. For 79485/79682 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 93307 event pairs, 211 based on Foata normal form. 86/9399 useless extension candidates. Maximal degree in co-relation 47691. Up to 1786 conditions per place. [2022-11-02 20:14:39,868 INFO L137 encePairwiseOnDemand]: 92/105 looper letters, 164 selfloop transitions, 176 changer transitions 231/656 dead transitions. [2022-11-02 20:14:39,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 656 transitions, 9426 flow [2022-11-02 20:14:39,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 20:14:39,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-02 20:14:39,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1729 transitions. [2022-11-02 20:14:39,875 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7841269841269841 [2022-11-02 20:14:39,875 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1729 transitions. [2022-11-02 20:14:39,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1729 transitions. [2022-11-02 20:14:39,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:14:39,877 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1729 transitions. [2022-11-02 20:14:39,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 82.33333333333333) internal successors, (1729), 21 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:39,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 105.0) internal successors, (2310), 22 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:39,889 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 105.0) internal successors, (2310), 22 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:39,889 INFO L175 Difference]: Start difference. First operand has 157 places, 223 transitions, 2424 flow. Second operand 21 states and 1729 transitions. [2022-11-02 20:14:39,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 656 transitions, 9426 flow [2022-11-02 20:14:40,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 656 transitions, 9358 flow, removed 34 selfloop flow, removed 0 redundant places. [2022-11-02 20:14:40,140 INFO L231 Difference]: Finished difference. Result has 190 places, 359 transitions, 5167 flow [2022-11-02 20:14:40,141 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=2404, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=5167, PETRI_PLACES=190, PETRI_TRANSITIONS=359} [2022-11-02 20:14:40,141 INFO L287 CegarLoopForPetriNet]: 94 programPoint places, 96 predicate places. [2022-11-02 20:14:40,142 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 359 transitions, 5167 flow [2022-11-02 20:14:40,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 77.78571428571429) internal successors, (1089), 14 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:40,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:14:40,143 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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, 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, 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, 1, 1] [2022-11-02 20:14:40,182 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:14:40,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-02 20:14:40,357 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 20:14:40,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:40,358 INFO L85 PathProgramCache]: Analyzing trace with hash 14122153, now seen corresponding path program 2 times [2022-11-02 20:14:40,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:40,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596810282] [2022-11-02 20:14:40,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:40,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:40,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:14:40,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:40,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596810282] [2022-11-02 20:14:40,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596810282] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:14:40,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683612911] [2022-11-02 20:14:40,561 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:14:40,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:14:40,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:14:40,563 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:14:40,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:14:40,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:14:40,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:14:40,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:14:40,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:14:40,749 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:14:40,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:14:40,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:14:40,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683612911] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:14:40,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:14:40,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-11-02 20:14:40,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839091046] [2022-11-02 20:14:40,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:14:40,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:14:40,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:40,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:14:40,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:14:40,829 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 105 [2022-11-02 20:14:40,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 359 transitions, 5167 flow. Second operand has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:40,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:14:40,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 105 [2022-11-02 20:14:40,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:14:41,196 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([252] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][89], [Black: 633#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 638#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 164#true, Black: 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 166#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 127#true, 1186#(<= 1 ~pos~0), Black: 648#true, 147#(<= 0 ~pos~0), Black: 673#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 1018#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1014#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 658#true, Black: 1170#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), 73#thread3ENTRYtrue, 4#L111-4true, Black: 1210#true, Black: 1578#(or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)), Black: 1192#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1574#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1712#(and (or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 1194#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= (div thread2Thread1of1ForFork2_~lv_assert~1 256) 0) (<= 0 ~pos~0)), Black: 1196#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 1185#(<= 0 ~pos~0), Black: 1187#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 111#true, 662#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 44#L54true, 137#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 50#L78true, Black: 2248#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 2238#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 0 ~pos~0)), 2232#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 2 ~pos~0)), Black: 2236#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2228#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 2230#(and (= ~pos~0 0) (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 2234#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 0 ~pos~0)), Black: 1724#(<= 2 ~pos~0), Black: 2250#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 1723#(<= 0 ~pos~0), Black: 2246#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 2244#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 2240#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 1215#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 652#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 2764#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 1172#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 636#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-11-02 20:14:41,196 INFO L383 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2022-11-02 20:14:41,196 INFO L386 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-11-02 20:14:41,197 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-02 20:14:41,197 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-02 20:14:42,334 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([252] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][214], [Black: 633#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 638#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 164#true, Black: 166#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 636#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 137#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#true, Black: 648#true, 2269#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 1018#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1014#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1172#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 658#true, Black: 1170#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 147#(<= 0 ~pos~0), 673#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), 2040#(not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)), Black: 1186#(<= 1 ~pos~0), Black: 1210#true, 4#L111-4true, 27#L92true, Black: 1192#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1578#(or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)), Black: 1574#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1712#(and (or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 1194#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= (div thread2Thread1of1ForFork2_~lv_assert~1 256) 0) (<= 0 ~pos~0)), Black: 1196#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 1185#(<= 0 ~pos~0), Black: 1187#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), 111#true, 662#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 44#L54true, 50#L78true, Black: 2248#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 2238#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 0 ~pos~0)), Black: 2236#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2228#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 2230#(and (= ~pos~0 0) (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 2232#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 2 ~pos~0)), Black: 2234#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 0 ~pos~0)), Black: 1724#(<= 2 ~pos~0), Black: 2250#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 1723#(<= 0 ~pos~0), Black: 2246#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 2244#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 2240#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 1215#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 652#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 1181#true, Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-11-02 20:14:42,335 INFO L383 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-11-02 20:14:42,335 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:14:42,335 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:14:42,335 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:14:43,311 INFO L130 PetriNetUnfolder]: 2683/7561 cut-off events. [2022-11-02 20:14:43,311 INFO L131 PetriNetUnfolder]: For 81934/82245 co-relation queries the response was YES. [2022-11-02 20:14:43,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40684 conditions, 7561 events. 2683/7561 cut-off events. For 81934/82245 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 76008 event pairs, 356 based on Foata normal form. 128/7643 useless extension candidates. Maximal degree in co-relation 40630. Up to 1781 conditions per place. [2022-11-02 20:14:43,441 INFO L137 encePairwiseOnDemand]: 100/105 looper letters, 190 selfloop transitions, 139 changer transitions 38/478 dead transitions. [2022-11-02 20:14:43,442 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 478 transitions, 7823 flow [2022-11-02 20:14:43,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:14:43,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 20:14:43,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 458 transitions. [2022-11-02 20:14:43,444 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8723809523809524 [2022-11-02 20:14:43,444 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 458 transitions. [2022-11-02 20:14:43,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 458 transitions. [2022-11-02 20:14:43,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:14:43,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 458 transitions. [2022-11-02 20:14:43,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:43,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:43,448 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:43,448 INFO L175 Difference]: Start difference. First operand has 190 places, 359 transitions, 5167 flow. Second operand 5 states and 458 transitions. [2022-11-02 20:14:43,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 478 transitions, 7823 flow [2022-11-02 20:14:43,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 478 transitions, 7699 flow, removed 59 selfloop flow, removed 3 redundant places. [2022-11-02 20:14:43,999 INFO L231 Difference]: Finished difference. Result has 194 places, 403 transitions, 6503 flow [2022-11-02 20:14:44,000 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=5031, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6503, PETRI_PLACES=194, PETRI_TRANSITIONS=403} [2022-11-02 20:14:44,004 INFO L287 CegarLoopForPetriNet]: 94 programPoint places, 100 predicate places. [2022-11-02 20:14:44,004 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 403 transitions, 6503 flow [2022-11-02 20:14:44,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:44,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:14:44,005 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 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, 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, 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] [2022-11-02 20:14:44,049 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:14:44,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-02 20:14:44,221 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 20:14:44,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:44,222 INFO L85 PathProgramCache]: Analyzing trace with hash -777772952, now seen corresponding path program 4 times [2022-11-02 20:14:44,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:44,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455412605] [2022-11-02 20:14:44,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:44,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:44,421 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:14:44,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:44,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455412605] [2022-11-02 20:14:44,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455412605] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:44,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:44,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:14:44,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670614212] [2022-11-02 20:14:44,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:44,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:14:44,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:44,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:14:44,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:14:44,427 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 105 [2022-11-02 20:14:44,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 403 transitions, 6503 flow. Second operand has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:44,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:14:44,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 105 [2022-11-02 20:14:44,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:14:45,908 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([252] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][69], [Black: 633#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 638#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 658#true, Black: 166#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 636#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 164#true, 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 137#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 2770#true, Black: 127#true, Black: 648#true, 668#true, Black: 673#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 1018#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 662#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 1014#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1172#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1170#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 147#(<= 0 ~pos~0), Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), 1578#(or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)), 57#L83true, 27#L92true, Black: 1210#true, Black: 1186#(<= 1 ~pos~0), 4#L111-4true, Black: 1192#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1574#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1712#(and (or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 1194#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= (div thread2Thread1of1ForFork2_~lv_assert~1 256) 0) (<= 0 ~pos~0)), Black: 1215#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 1196#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 1185#(<= 0 ~pos~0), Black: 1187#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), 111#true, 44#L54true, Black: 2248#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 2238#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 0 ~pos~0)), Black: 2764#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 2236#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2269#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 2228#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 2230#(and (= ~pos~0 0) (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 2265#true, Black: 2232#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 2 ~pos~0)), Black: 2234#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 0 ~pos~0)), Black: 1724#(<= 2 ~pos~0), Black: 2250#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 1723#(<= 0 ~pos~0), 2267#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 2244#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 2240#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 652#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 1181#true, 2246#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-11-02 20:14:45,909 INFO L383 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-11-02 20:14:45,909 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 20:14:45,909 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-02 20:14:45,909 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-02 20:14:45,912 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([252] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][69], [Black: 633#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 638#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 658#true, Black: 166#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 636#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 164#true, 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 137#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 2770#true, Black: 127#true, Black: 648#true, 668#true, Black: 673#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 1018#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 662#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 1014#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1172#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1170#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 147#(<= 0 ~pos~0), 2248#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), 1578#(or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)), 57#L83true, 27#L92true, Black: 1210#true, Black: 1186#(<= 1 ~pos~0), 4#L111-4true, Black: 1192#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1574#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1712#(and (or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 1194#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= (div thread2Thread1of1ForFork2_~lv_assert~1 256) 0) (<= 0 ~pos~0)), Black: 1215#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 1196#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 1185#(<= 0 ~pos~0), Black: 1187#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), 111#true, 44#L54true, Black: 2238#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 0 ~pos~0)), Black: 2764#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 2236#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2269#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 2228#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 2230#(and (= ~pos~0 0) (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 2265#true, Black: 2232#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 2 ~pos~0)), Black: 2234#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 0 ~pos~0)), Black: 1724#(<= 2 ~pos~0), Black: 2250#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 1723#(<= 0 ~pos~0), 2267#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 2246#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 2244#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 2240#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 652#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 1181#true, Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-11-02 20:14:45,913 INFO L383 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-11-02 20:14:45,913 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-02 20:14:45,913 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-02 20:14:45,913 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 20:14:46,183 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([252] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][69], [Black: 633#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 638#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 164#true, Black: 166#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 636#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 137#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#true, 2770#true, Black: 648#true, Black: 1018#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1014#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1172#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 658#true, Black: 1170#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 147#(<= 0 ~pos~0), 673#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), 27#L92true, Black: 1210#true, Black: 1186#(<= 1 ~pos~0), 4#L111-4true, Black: 1578#(or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)), Black: 1192#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1574#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1712#(and (or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 1194#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= (div thread2Thread1of1ForFork2_~lv_assert~1 256) 0) (<= 0 ~pos~0)), Black: 1196#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 1185#(<= 0 ~pos~0), Black: 1187#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), 111#true, 662#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 44#L54true, 50#L78true, Black: 2248#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 2238#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 0 ~pos~0)), Black: 2236#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2269#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 2228#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 2230#(and (= ~pos~0 0) (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 2267#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 2265#true, Black: 2232#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 2 ~pos~0)), Black: 2234#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 0 ~pos~0)), Black: 1724#(<= 2 ~pos~0), Black: 2250#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 1723#(<= 0 ~pos~0), Black: 2244#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), 1215#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 2240#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 652#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 1181#true, 2764#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 2246#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-11-02 20:14:46,184 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-11-02 20:14:46,184 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 20:14:46,184 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:14:46,184 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:14:46,186 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([252] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][69], [Black: 633#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 638#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 164#true, Black: 166#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 636#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 137#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 2770#true, Black: 127#true, Black: 648#true, Black: 1018#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1014#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1172#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 658#true, Black: 1170#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 147#(<= 0 ~pos~0), 673#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 2248#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), 27#L92true, Black: 1210#true, Black: 1186#(<= 1 ~pos~0), 4#L111-4true, Black: 1192#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1578#(or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)), Black: 1574#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1712#(and (or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 1194#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= (div thread2Thread1of1ForFork2_~lv_assert~1 256) 0) (<= 0 ~pos~0)), Black: 1196#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 1185#(<= 0 ~pos~0), Black: 1187#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), 111#true, 662#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 44#L54true, 50#L78true, Black: 2238#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 0 ~pos~0)), Black: 2236#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2269#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 2228#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 2230#(and (= ~pos~0 0) (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 2267#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 2265#true, Black: 2232#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 2 ~pos~0)), Black: 2234#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 0 ~pos~0)), Black: 1724#(<= 2 ~pos~0), Black: 2250#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 1723#(<= 0 ~pos~0), Black: 2246#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 2244#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 2240#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 1215#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 652#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 1181#true, 2764#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-11-02 20:14:46,186 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-11-02 20:14:46,187 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:14:46,187 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:14:46,187 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-02 20:14:46,422 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([252] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][69], [Black: 633#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 638#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 166#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), 658#true, Black: 636#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 164#true, 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 137#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 2770#true, Black: 127#true, Black: 648#true, 668#true, Black: 673#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 1018#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1014#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 662#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 1172#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1170#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 147#(<= 0 ~pos~0), Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), 1578#(or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)), 57#L83true, 27#L92true, Black: 1210#true, Black: 1186#(<= 1 ~pos~0), 4#L111-4true, Black: 1192#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1574#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1712#(and (or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 1194#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= (div thread2Thread1of1ForFork2_~lv_assert~1 256) 0) (<= 0 ~pos~0)), Black: 1215#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 1196#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 1185#(<= 0 ~pos~0), Black: 1187#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), 111#true, 44#L54true, Black: 2248#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 2238#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 0 ~pos~0)), Black: 2236#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2269#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 2228#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 2230#(and (= ~pos~0 0) (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 2267#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 2265#true, Black: 2232#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 2 ~pos~0)), Black: 2234#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 0 ~pos~0)), Black: 1724#(<= 2 ~pos~0), Black: 2250#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 1723#(<= 0 ~pos~0), Black: 2244#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 2240#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 652#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 1181#true, 2764#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 2246#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-11-02 20:14:46,422 INFO L383 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-11-02 20:14:46,423 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 20:14:46,423 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-02 20:14:46,423 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 20:14:46,424 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([252] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][69], [Black: 633#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 638#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 658#true, Black: 166#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 636#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 164#true, 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 137#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 2770#true, Black: 127#true, Black: 648#true, 668#true, Black: 673#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 1018#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1014#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 662#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 1172#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1170#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 147#(<= 0 ~pos~0), Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), 1578#(or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)), 2238#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 0 ~pos~0)), 57#L83true, Black: 1210#true, 27#L92true, Black: 1186#(<= 1 ~pos~0), 4#L111-4true, Black: 1192#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1574#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1712#(and (or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 1194#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= (div thread2Thread1of1ForFork2_~lv_assert~1 256) 0) (<= 0 ~pos~0)), Black: 1215#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 1196#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 1185#(<= 0 ~pos~0), Black: 1187#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), 111#true, 44#L54true, Black: 2248#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 2764#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 2236#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2269#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 2228#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 2230#(and (= ~pos~0 0) (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 2265#true, Black: 2232#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 2 ~pos~0)), Black: 2234#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 0 ~pos~0)), Black: 1724#(<= 2 ~pos~0), Black: 2250#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 1723#(<= 0 ~pos~0), 2267#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 2246#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 2244#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 2240#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 652#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 1181#true, Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-11-02 20:14:46,425 INFO L383 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-11-02 20:14:46,425 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 20:14:46,425 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-02 20:14:46,425 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-02 20:14:46,427 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([252] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][69], [Black: 633#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 638#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 658#true, Black: 166#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 636#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 164#true, 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 137#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 2770#true, Black: 127#true, Black: 648#true, 668#true, Black: 673#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 1018#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 662#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 1014#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1172#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1170#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 147#(<= 0 ~pos~0), Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), 1578#(or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)), 57#L83true, Black: 1210#true, 27#L92true, Black: 1186#(<= 1 ~pos~0), 4#L111-4true, Black: 1192#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1574#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1712#(and (or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 1194#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= (div thread2Thread1of1ForFork2_~lv_assert~1 256) 0) (<= 0 ~pos~0)), Black: 1215#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 1196#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 1185#(<= 0 ~pos~0), Black: 1187#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), 111#true, 44#L54true, Black: 2248#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 2238#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 0 ~pos~0)), Black: 2764#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 2236#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2269#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 2228#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 2230#(and (= ~pos~0 0) (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 2265#true, Black: 2232#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 2 ~pos~0)), Black: 2234#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 0 ~pos~0)), Black: 1724#(<= 2 ~pos~0), Black: 2250#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 1723#(<= 0 ~pos~0), 2267#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 2246#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 2244#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 2240#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 652#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 1181#true, 1719#true, Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-11-02 20:14:46,427 INFO L383 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-11-02 20:14:46,427 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-02 20:14:46,427 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 20:14:46,428 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 20:14:46,429 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([252] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][69], [Black: 633#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 638#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 658#true, Black: 166#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 636#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 164#true, 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 137#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#true, 2770#true, Black: 648#true, 668#true, Black: 673#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 1018#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 662#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 1014#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1172#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1170#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 147#(<= 0 ~pos~0), Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 2248#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), 1578#(or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)), 57#L83true, 27#L92true, Black: 1210#true, Black: 1186#(<= 1 ~pos~0), 4#L111-4true, Black: 1192#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1574#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1712#(and (or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 1194#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= (div thread2Thread1of1ForFork2_~lv_assert~1 256) 0) (<= 0 ~pos~0)), Black: 1215#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 1196#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 1185#(<= 0 ~pos~0), Black: 1187#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), 111#true, 44#L54true, Black: 2238#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 0 ~pos~0)), Black: 2236#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2269#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 2228#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 2230#(and (= ~pos~0 0) (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 2267#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 2265#true, Black: 2232#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 2 ~pos~0)), Black: 2234#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 0 ~pos~0)), Black: 1724#(<= 2 ~pos~0), Black: 2250#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 1723#(<= 0 ~pos~0), Black: 2246#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 2244#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 2240#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 652#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 1181#true, 2764#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-11-02 20:14:46,429 INFO L383 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-11-02 20:14:46,429 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-02 20:14:46,429 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 20:14:46,430 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 20:14:46,431 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([252] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][69], [Black: 633#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 638#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 658#true, Black: 166#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 636#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 164#true, 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 137#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#true, 2770#true, Black: 648#true, 668#true, Black: 673#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 1018#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 662#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 1014#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1172#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1170#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 147#(<= 0 ~pos~0), Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), 1578#(or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)), 2238#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 0 ~pos~0)), 57#L83true, 27#L92true, Black: 1210#true, Black: 1186#(<= 1 ~pos~0), 4#L111-4true, Black: 1192#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1574#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1712#(and (or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 1194#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= (div thread2Thread1of1ForFork2_~lv_assert~1 256) 0) (<= 0 ~pos~0)), Black: 1215#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 1196#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 1185#(<= 0 ~pos~0), Black: 1187#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), 111#true, 44#L54true, Black: 2248#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 2236#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2269#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 2228#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 2230#(and (= ~pos~0 0) (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 2267#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 2265#true, Black: 2232#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 2 ~pos~0)), Black: 2234#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 0 ~pos~0)), Black: 1724#(<= 2 ~pos~0), Black: 2250#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 1723#(<= 0 ~pos~0), Black: 2246#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 2244#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 2240#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 652#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 1181#true, 2764#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-11-02 20:14:46,431 INFO L383 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-11-02 20:14:46,431 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 20:14:46,431 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-11-02 20:14:46,431 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 20:14:46,734 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([253] L52-->L54: Formula: (= (+ v_~pos~0_23 1) v_~pos~0_24) InVars {~pos~0=v_~pos~0_24} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_23} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][240], [Black: 633#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 638#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 164#true, Black: 166#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), 658#true, Black: 636#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 137#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#true, Black: 652#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 2269#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 1018#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 662#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 1014#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1172#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1170#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), 2772#(= (* 256 (div ~d1~0 256)) ~d1~0), Black: 147#(<= 0 ~pos~0), 673#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), 2040#(not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)), 27#L92true, Black: 1210#true, 4#L111-4true, Black: 1186#(<= 1 ~pos~0), Black: 1192#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1578#(or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)), Black: 1574#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1712#(and (or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 1194#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= (div thread2Thread1of1ForFork2_~lv_assert~1 256) 0) (<= 0 ~pos~0)), Black: 1196#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 1185#(<= 0 ~pos~0), Black: 1187#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), 111#true, 44#L54true, 50#L78true, Black: 2248#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 2238#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 0 ~pos~0)), Black: 2764#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 2236#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2228#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 2230#(and (= ~pos~0 0) (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 2267#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 2232#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 2 ~pos~0)), Black: 2265#true, Black: 2234#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 0 ~pos~0)), Black: 1724#(<= 2 ~pos~0), 648#true, Black: 2250#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 1723#(<= 0 ~pos~0), Black: 2246#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 2244#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 2240#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 1215#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 1181#true, Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-11-02 20:14:46,734 INFO L383 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-11-02 20:14:46,734 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:14:46,734 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-02 20:14:46,735 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-02 20:14:46,756 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([252] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][69], [Black: 633#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 638#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 164#true, Black: 166#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 636#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 137#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#true, 2770#true, Black: 648#true, Black: 1018#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1014#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1172#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 658#true, Black: 1170#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 147#(<= 0 ~pos~0), 673#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), 2040#(not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)), Black: 1186#(<= 1 ~pos~0), Black: 1210#true, 27#L92true, 4#L111-4true, Black: 1578#(or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)), Black: 1192#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1574#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1712#(and (or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 1194#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= (div thread2Thread1of1ForFork2_~lv_assert~1 256) 0) (<= 0 ~pos~0)), Black: 1196#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 1185#(<= 0 ~pos~0), Black: 1187#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), 111#true, 662#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 44#L54true, 50#L78true, Black: 2248#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 2238#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 0 ~pos~0)), Black: 2236#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2269#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 2228#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 2267#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 2230#(and (= ~pos~0 0) (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 2232#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 2 ~pos~0)), Black: 2265#true, Black: 2234#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 0 ~pos~0)), Black: 1724#(<= 2 ~pos~0), Black: 2250#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 1723#(<= 0 ~pos~0), Black: 2246#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 2244#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), 1215#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 2240#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 652#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 1181#true, 2764#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-11-02 20:14:46,756 INFO L383 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-11-02 20:14:46,756 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:14:46,756 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-02 20:14:46,756 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-02 20:14:46,817 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([253] L52-->L54: Formula: (= (+ v_~pos~0_23 1) v_~pos~0_24) InVars {~pos~0=v_~pos~0_24} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_23} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][281], [Black: 633#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 638#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 166#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), 658#true, Black: 636#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 164#true, 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 137#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#true, Black: 652#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 668#true, Black: 673#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 1018#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1014#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 662#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 1172#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1170#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), 2772#(= (* 256 (div ~d1~0 256)) ~d1~0), Black: 147#(<= 0 ~pos~0), Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), 1578#(or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)), 57#L83true, Black: 1186#(<= 1 ~pos~0), 27#L92true, Black: 1210#true, 4#L111-4true, Black: 1192#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1574#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1712#(and (or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 1194#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= (div thread2Thread1of1ForFork2_~lv_assert~1 256) 0) (<= 0 ~pos~0)), Black: 1215#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 1196#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 1185#(<= 0 ~pos~0), Black: 1187#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), 111#true, 44#L54true, Black: 2248#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 2238#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 0 ~pos~0)), Black: 2764#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 2236#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2228#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 2269#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 2230#(and (= ~pos~0 0) (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 2232#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 2 ~pos~0)), Black: 2265#true, Black: 2234#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 0 ~pos~0)), Black: 1724#(<= 2 ~pos~0), 648#true, Black: 2250#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 1723#(<= 0 ~pos~0), 2267#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 2246#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 2244#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 2240#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 1719#true, 1181#true, Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-11-02 20:14:46,817 INFO L383 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-11-02 20:14:46,817 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 20:14:46,817 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-11-02 20:14:46,817 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-11-02 20:14:46,839 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([252] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][69], [Black: 633#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 638#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 658#true, Black: 166#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), 164#true, Black: 636#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 137#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 2770#true, Black: 127#true, Black: 648#true, 668#true, Black: 673#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 1018#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 662#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 1014#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1172#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1170#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 147#(<= 0 ~pos~0), Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), 1578#(or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)), 57#L83true, Black: 1210#true, 27#L92true, Black: 1186#(<= 1 ~pos~0), 4#L111-4true, Black: 1192#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1574#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1712#(and (or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 1215#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 1194#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= (div thread2Thread1of1ForFork2_~lv_assert~1 256) 0) (<= 0 ~pos~0)), Black: 1196#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 1185#(<= 0 ~pos~0), Black: 1187#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), 111#true, 44#L54true, Black: 2248#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 2238#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 0 ~pos~0)), Black: 2236#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2269#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 2228#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 2230#(and (= ~pos~0 0) (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 2267#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 2265#true, Black: 2232#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 2 ~pos~0)), Black: 2234#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 0 ~pos~0)), Black: 1724#(<= 2 ~pos~0), Black: 2250#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 1723#(<= 0 ~pos~0), Black: 2246#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 2244#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 2240#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 652#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 1719#true, 1181#true, 2764#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-11-02 20:14:46,839 INFO L383 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-11-02 20:14:46,839 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-11-02 20:14:46,839 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 20:14:46,840 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-11-02 20:14:46,850 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([253] L52-->L54: Formula: (= (+ v_~pos~0_23 1) v_~pos~0_24) InVars {~pos~0=v_~pos~0_24} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_23} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][240], [Black: 633#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 638#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 164#true, Black: 166#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), 658#true, Black: 636#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 137#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#true, Black: 652#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 1018#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1014#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 662#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 1172#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1170#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), 2772#(= (* 256 (div ~d1~0 256)) ~d1~0), Black: 147#(<= 0 ~pos~0), 673#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), 2040#(not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)), Black: 1186#(<= 1 ~pos~0), 27#L92true, Black: 1210#true, 4#L111-4true, Black: 1578#(or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)), Black: 1192#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1574#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1712#(and (or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 1194#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= (div thread2Thread1of1ForFork2_~lv_assert~1 256) 0) (<= 0 ~pos~0)), Black: 1196#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 1185#(<= 0 ~pos~0), Black: 1187#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), 111#true, 44#L54true, Black: 2248#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 2238#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 0 ~pos~0)), Black: 2236#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2228#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 2269#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 2267#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 2230#(and (= ~pos~0 0) (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 2232#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 2 ~pos~0)), Black: 2265#true, Black: 2234#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 0 ~pos~0)), Black: 1724#(<= 2 ~pos~0), 648#true, Black: 2250#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 1723#(<= 0 ~pos~0), Black: 2246#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 2244#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 2240#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 1215#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 1181#true, 2764#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 35#L70true, Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-11-02 20:14:46,850 INFO L383 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-11-02 20:14:46,850 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-11-02 20:14:46,850 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-11-02 20:14:46,850 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-02 20:14:46,900 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([253] L52-->L54: Formula: (= (+ v_~pos~0_23 1) v_~pos~0_24) InVars {~pos~0=v_~pos~0_24} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_23} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][240], [Black: 633#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 638#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 164#true, Black: 166#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), 658#true, Black: 636#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 137#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#true, Black: 652#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 1018#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 662#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 1014#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1172#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1170#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), 2772#(= (* 256 (div ~d1~0 256)) ~d1~0), Black: 147#(<= 0 ~pos~0), 673#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), 2040#(not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)), Black: 1186#(<= 1 ~pos~0), 27#L92true, Black: 1210#true, 4#L111-4true, Black: 1578#(or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)), Black: 1192#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1574#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1712#(and (or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 1194#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= (div thread2Thread1of1ForFork2_~lv_assert~1 256) 0) (<= 0 ~pos~0)), Black: 1196#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 1185#(<= 0 ~pos~0), Black: 1187#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), 111#true, 44#L54true, 50#L78true, Black: 2248#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 2238#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 0 ~pos~0)), Black: 2236#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2228#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 2269#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 2267#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 2230#(and (= ~pos~0 0) (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 2232#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 2 ~pos~0)), Black: 2265#true, Black: 2234#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 0 ~pos~0)), Black: 1724#(<= 2 ~pos~0), 648#true, Black: 2250#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 1723#(<= 0 ~pos~0), Black: 2246#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 2244#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 2240#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 1215#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 1181#true, 2764#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-11-02 20:14:46,900 INFO L383 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-11-02 20:14:46,900 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-11-02 20:14:46,900 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-11-02 20:14:46,900 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-02 20:14:46,946 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([253] L52-->L54: Formula: (= (+ v_~pos~0_23 1) v_~pos~0_24) InVars {~pos~0=v_~pos~0_24} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_23} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][281], [Black: 633#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 638#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 166#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), 658#true, 164#true, Black: 636#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 137#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#true, Black: 652#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 668#true, Black: 673#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 1018#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 662#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 1014#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1172#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1170#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), 2772#(= (* 256 (div ~d1~0 256)) ~d1~0), Black: 147#(<= 0 ~pos~0), Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), 1578#(or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)), 57#L83true, Black: 1186#(<= 1 ~pos~0), 27#L92true, Black: 1210#true, 4#L111-4true, Black: 1192#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1574#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1712#(and (or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 1215#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 1194#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= (div thread2Thread1of1ForFork2_~lv_assert~1 256) 0) (<= 0 ~pos~0)), Black: 1196#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 1185#(<= 0 ~pos~0), Black: 1187#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), 111#true, 44#L54true, Black: 2248#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 2238#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 0 ~pos~0)), Black: 2236#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 2269#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 2228#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 2267#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 2230#(and (= ~pos~0 0) (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 2232#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 2 ~pos~0)), Black: 2265#true, Black: 2234#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 0 ~pos~0)), Black: 1724#(<= 2 ~pos~0), 648#true, Black: 2250#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 1723#(<= 0 ~pos~0), Black: 2246#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 2244#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 2240#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 1719#true, 1181#true, 2764#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-11-02 20:14:46,946 INFO L383 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-11-02 20:14:46,946 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-11-02 20:14:46,946 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-11-02 20:14:46,947 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-11-02 20:14:47,029 INFO L130 PetriNetUnfolder]: 2077/7146 cut-off events. [2022-11-02 20:14:47,029 INFO L131 PetriNetUnfolder]: For 71815/72419 co-relation queries the response was YES. [2022-11-02 20:14:47,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37902 conditions, 7146 events. 2077/7146 cut-off events. For 71815/72419 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 77222 event pairs, 247 based on Foata normal form. 456/7489 useless extension candidates. Maximal degree in co-relation 37844. Up to 1112 conditions per place. [2022-11-02 20:14:47,294 INFO L137 encePairwiseOnDemand]: 100/105 looper letters, 46 selfloop transitions, 5 changer transitions 24/400 dead transitions. [2022-11-02 20:14:47,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 400 transitions, 6310 flow [2022-11-02 20:14:47,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:14:47,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-02 20:14:47,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 379 transitions. [2022-11-02 20:14:47,297 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9023809523809524 [2022-11-02 20:14:47,298 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 379 transitions. [2022-11-02 20:14:47,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 379 transitions. [2022-11-02 20:14:47,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:14:47,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 379 transitions. [2022-11-02 20:14:47,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:47,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:47,304 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:47,304 INFO L175 Difference]: Start difference. First operand has 194 places, 403 transitions, 6503 flow. Second operand 4 states and 379 transitions. [2022-11-02 20:14:47,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 400 transitions, 6310 flow [2022-11-02 20:14:47,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 400 transitions, 6242 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-11-02 20:14:47,692 INFO L231 Difference]: Finished difference. Result has 197 places, 364 transitions, 5576 flow [2022-11-02 20:14:47,693 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=6084, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=5576, PETRI_PLACES=197, PETRI_TRANSITIONS=364} [2022-11-02 20:14:47,694 INFO L287 CegarLoopForPetriNet]: 94 programPoint places, 103 predicate places. [2022-11-02 20:14:47,694 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 364 transitions, 5576 flow [2022-11-02 20:14:47,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:47,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:14:47,695 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 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, 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, 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] [2022-11-02 20:14:47,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:14:47,695 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 20:14:47,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:47,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1695189094, now seen corresponding path program 3 times [2022-11-02 20:14:47,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:47,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270564521] [2022-11-02 20:14:47,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:47,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:47,889 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:14:47,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:47,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270564521] [2022-11-02 20:14:47,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270564521] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:47,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:47,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:14:47,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991620128] [2022-11-02 20:14:47,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:47,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:14:47,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:47,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:14:47,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:14:47,894 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 105 [2022-11-02 20:14:47,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 364 transitions, 5576 flow. Second operand has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:47,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:14:47,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 105 [2022-11-02 20:14:47,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:14:50,574 INFO L130 PetriNetUnfolder]: 2178/7532 cut-off events. [2022-11-02 20:14:50,574 INFO L131 PetriNetUnfolder]: For 77658/78189 co-relation queries the response was YES. [2022-11-02 20:14:50,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41024 conditions, 7532 events. 2178/7532 cut-off events. For 77658/78189 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 79583 event pairs, 356 based on Foata normal form. 284/7606 useless extension candidates. Maximal degree in co-relation 40965. Up to 1217 conditions per place. [2022-11-02 20:14:50,686 INFO L137 encePairwiseOnDemand]: 100/105 looper letters, 56 selfloop transitions, 5 changer transitions 9/365 dead transitions. [2022-11-02 20:14:50,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 365 transitions, 5459 flow [2022-11-02 20:14:50,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:14:50,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-02 20:14:50,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 378 transitions. [2022-11-02 20:14:50,689 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9 [2022-11-02 20:14:50,689 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 378 transitions. [2022-11-02 20:14:50,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 378 transitions. [2022-11-02 20:14:50,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:14:50,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 378 transitions. [2022-11-02 20:14:50,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:50,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:50,693 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:50,693 INFO L175 Difference]: Start difference. First operand has 197 places, 364 transitions, 5576 flow. Second operand 4 states and 378 transitions. [2022-11-02 20:14:50,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 365 transitions, 5459 flow [2022-11-02 20:14:51,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 365 transitions, 5370 flow, removed 17 selfloop flow, removed 4 redundant places. [2022-11-02 20:14:51,086 INFO L231 Difference]: Finished difference. Result has 199 places, 334 transitions, 4956 flow [2022-11-02 20:14:51,086 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=5069, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4956, PETRI_PLACES=199, PETRI_TRANSITIONS=334} [2022-11-02 20:14:51,087 INFO L287 CegarLoopForPetriNet]: 94 programPoint places, 105 predicate places. [2022-11-02 20:14:51,087 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 334 transitions, 4956 flow [2022-11-02 20:14:51,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:51,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:14:51,088 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1] [2022-11-02 20:14:51,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:14:51,089 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 20:14:51,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:51,090 INFO L85 PathProgramCache]: Analyzing trace with hash 544338661, now seen corresponding path program 1 times [2022-11-02 20:14:51,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:51,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046441537] [2022-11-02 20:14:51,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:51,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:51,698 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:14:51,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:51,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046441537] [2022-11-02 20:14:51,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046441537] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:14:51,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956713165] [2022-11-02 20:14:51,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:51,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:14:51,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:14:51,701 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:14:51,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:14:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:51,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-02 20:14:51,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:14:52,051 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:14:52,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:14:52,230 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:14:52,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956713165] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:14:52,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:14:52,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 15 [2022-11-02 20:14:52,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363033344] [2022-11-02 20:14:52,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:14:52,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:14:52,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:52,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:14:52,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:14:52,235 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 105 [2022-11-02 20:14:52,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 334 transitions, 4956 flow. Second operand has 15 states, 15 states have (on average 77.86666666666666) internal successors, (1168), 15 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:52,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:14:52,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 105 [2022-11-02 20:14:52,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:14:56,572 INFO L130 PetriNetUnfolder]: 3875/11137 cut-off events. [2022-11-02 20:14:56,572 INFO L131 PetriNetUnfolder]: For 147548/147694 co-relation queries the response was YES. [2022-11-02 20:14:56,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69083 conditions, 11137 events. 3875/11137 cut-off events. For 147548/147694 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 120004 event pairs, 189 based on Foata normal form. 338/11435 useless extension candidates. Maximal degree in co-relation 69024. Up to 2124 conditions per place. [2022-11-02 20:14:57,011 INFO L137 encePairwiseOnDemand]: 92/105 looper letters, 104 selfloop transitions, 170 changer transitions 295/725 dead transitions. [2022-11-02 20:14:57,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 725 transitions, 13051 flow [2022-11-02 20:14:57,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-02 20:14:57,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-11-02 20:14:57,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2110 transitions. [2022-11-02 20:14:57,018 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7728937728937729 [2022-11-02 20:14:57,018 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 2110 transitions. [2022-11-02 20:14:57,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 2110 transitions. [2022-11-02 20:14:57,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:14:57,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2110 transitions. [2022-11-02 20:14:57,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 81.15384615384616) internal successors, (2110), 26 states have internal predecessors, (2110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:57,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 105.0) internal successors, (2835), 27 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:57,034 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 105.0) internal successors, (2835), 27 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:57,035 INFO L175 Difference]: Start difference. First operand has 199 places, 334 transitions, 4956 flow. Second operand 26 states and 2110 transitions. [2022-11-02 20:14:57,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 725 transitions, 13051 flow [2022-11-02 20:14:57,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 725 transitions, 12993 flow, removed 29 selfloop flow, removed 1 redundant places. [2022-11-02 20:14:57,795 INFO L231 Difference]: Finished difference. Result has 236 places, 375 transitions, 5673 flow [2022-11-02 20:14:57,796 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=4920, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=5673, PETRI_PLACES=236, PETRI_TRANSITIONS=375} [2022-11-02 20:14:57,797 INFO L287 CegarLoopForPetriNet]: 94 programPoint places, 142 predicate places. [2022-11-02 20:14:57,797 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 375 transitions, 5673 flow [2022-11-02 20:14:57,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 77.86666666666666) internal successors, (1168), 15 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:57,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:14:57,798 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1] [2022-11-02 20:14:57,825 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:14:58,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-02 20:14:58,011 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 20:14:58,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:58,012 INFO L85 PathProgramCache]: Analyzing trace with hash -589429049, now seen corresponding path program 2 times [2022-11-02 20:14:58,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:58,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658699155] [2022-11-02 20:14:58,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:58,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:58,402 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:14:58,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:58,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658699155] [2022-11-02 20:14:58,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658699155] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:14:58,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260519345] [2022-11-02 20:14:58,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:14:58,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:14:58,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:14:58,405 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:14:58,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:14:58,530 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:14:58,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:14:58,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-02 20:14:58,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:14:58,752 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:14:58,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:14:58,938 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:14:58,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260519345] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:14:58,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:14:58,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 15 [2022-11-02 20:14:58,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002451865] [2022-11-02 20:14:58,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:14:58,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:14:58,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:58,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:14:58,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:14:58,943 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 105 [2022-11-02 20:14:58,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 375 transitions, 5673 flow. Second operand has 15 states, 15 states have (on average 77.93333333333334) internal successors, (1169), 15 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:58,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:14:58,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 105 [2022-11-02 20:14:58,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:15:03,870 INFO L130 PetriNetUnfolder]: 5161/13633 cut-off events. [2022-11-02 20:15:03,871 INFO L131 PetriNetUnfolder]: For 239449/239701 co-relation queries the response was YES. [2022-11-02 20:15:04,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96154 conditions, 13633 events. 5161/13633 cut-off events. For 239449/239701 co-relation queries the response was YES. Maximal size of possible extension queue 729. Compared 150171 event pairs, 402 based on Foata normal form. 128/13699 useless extension candidates. Maximal degree in co-relation 96081. Up to 2924 conditions per place. [2022-11-02 20:15:04,070 INFO L137 encePairwiseOnDemand]: 92/105 looper letters, 175 selfloop transitions, 286 changer transitions 154/771 dead transitions. [2022-11-02 20:15:04,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 771 transitions, 14696 flow [2022-11-02 20:15:04,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-02 20:15:04,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-11-02 20:15:04,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2106 transitions. [2022-11-02 20:15:04,078 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7714285714285715 [2022-11-02 20:15:04,078 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 2106 transitions. [2022-11-02 20:15:04,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 2106 transitions. [2022-11-02 20:15:04,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:15:04,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2106 transitions. [2022-11-02 20:15:04,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 81.0) internal successors, (2106), 26 states have internal predecessors, (2106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:15:04,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 105.0) internal successors, (2835), 27 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:15:04,097 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 105.0) internal successors, (2835), 27 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:15:04,099 INFO L175 Difference]: Start difference. First operand has 236 places, 375 transitions, 5673 flow. Second operand 26 states and 2106 transitions. [2022-11-02 20:15:04,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 771 transitions, 14696 flow [2022-11-02 20:15:06,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 771 transitions, 12963 flow, removed 756 selfloop flow, removed 17 redundant places. [2022-11-02 20:15:06,140 INFO L231 Difference]: Finished difference. Result has 248 places, 551 transitions, 8795 flow [2022-11-02 20:15:06,140 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=4990, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=8795, PETRI_PLACES=248, PETRI_TRANSITIONS=551} [2022-11-02 20:15:06,140 INFO L287 CegarLoopForPetriNet]: 94 programPoint places, 154 predicate places. [2022-11-02 20:15:06,141 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 551 transitions, 8795 flow [2022-11-02 20:15:06,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 77.93333333333334) internal successors, (1169), 15 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:15:06,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:15:06,142 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1] [2022-11-02 20:15:06,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:15:06,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-02 20:15:06,352 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-02 20:15:06,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:15:06,353 INFO L85 PathProgramCache]: Analyzing trace with hash -543887815, now seen corresponding path program 3 times [2022-11-02 20:15:06,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:15:06,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989348190] [2022-11-02 20:15:06,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:15:06,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:15:06,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:15:06,669 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:15:06,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:15:06,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989348190] [2022-11-02 20:15:06,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989348190] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:15:06,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037724425] [2022-11-02 20:15:06,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:15:06,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:15:06,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:15:06,672 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:15:06,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:15:06,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-02 20:15:06,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:15:06,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-02 20:15:06,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:15:06,989 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:15:06,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:15:07,357 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:15:07,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037724425] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:15:07,357 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:15:07,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 16 [2022-11-02 20:15:07,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857727108] [2022-11-02 20:15:07,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:15:07,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-02 20:15:07,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:15:07,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-02 20:15:07,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:15:07,361 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 105 [2022-11-02 20:15:07,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 551 transitions, 8795 flow. Second operand has 16 states, 16 states have (on average 77.5625) internal successors, (1241), 16 states have internal predecessors, (1241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:15:07,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:15:07,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 105 [2022-11-02 20:15:07,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:15:12,628 INFO L130 PetriNetUnfolder]: 5153/12894 cut-off events. [2022-11-02 20:15:12,628 INFO L131 PetriNetUnfolder]: For 221690/221866 co-relation queries the response was YES. [2022-11-02 20:15:12,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90170 conditions, 12894 events. 5153/12894 cut-off events. For 221690/221866 co-relation queries the response was YES. Maximal size of possible extension queue 802. Compared 140055 event pairs, 206 based on Foata normal form. 96/12971 useless extension candidates. Maximal degree in co-relation 90095. Up to 2919 conditions per place. [2022-11-02 20:15:12,803 INFO L137 encePairwiseOnDemand]: 92/105 looper letters, 0 selfloop transitions, 0 changer transitions 861/861 dead transitions. [2022-11-02 20:15:12,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 861 transitions, 16924 flow [2022-11-02 20:15:12,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-02 20:15:12,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-11-02 20:15:12,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 2171 transitions. [2022-11-02 20:15:12,808 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7657848324514991 [2022-11-02 20:15:12,809 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 2171 transitions. [2022-11-02 20:15:12,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 2171 transitions. [2022-11-02 20:15:12,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:15:12,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 2171 transitions. [2022-11-02 20:15:12,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 80.4074074074074) internal successors, (2171), 27 states have internal predecessors, (2171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:15:12,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 105.0) internal successors, (2940), 28 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:15:12,821 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 105.0) internal successors, (2940), 28 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:15:12,821 INFO L175 Difference]: Start difference. First operand has 248 places, 551 transitions, 8795 flow. Second operand 27 states and 2171 transitions. [2022-11-02 20:15:12,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 861 transitions, 16924 flow [2022-11-02 20:15:15,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 861 transitions, 16015 flow, removed 315 selfloop flow, removed 14 redundant places. [2022-11-02 20:15:15,313 INFO L231 Difference]: Finished difference. Result has 240 places, 0 transitions, 0 flow [2022-11-02 20:15:15,313 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=8191, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=532, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=0, PETRI_PLACES=240, PETRI_TRANSITIONS=0} [2022-11-02 20:15:15,314 INFO L287 CegarLoopForPetriNet]: 94 programPoint places, 146 predicate places. [2022-11-02 20:15:15,314 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 0 transitions, 0 flow [2022-11-02 20:15:15,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 77.5625) internal successors, (1241), 16 states have internal predecessors, (1241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:15:15,318 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-11-02 20:15:15,318 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-11-02 20:15:15,319 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-11-02 20:15:15,319 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-11-02 20:15:15,362 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:15:15,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-02 20:15:15,533 INFO L444 BasicCegarLoop]: Path program histogram: [4, 3, 3, 3, 2, 1, 1] [2022-11-02 20:15:15,537 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:15:15,537 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:15:15,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:15:15 BasicIcfg [2022-11-02 20:15:15,545 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:15:15,546 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:15:15,546 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:15:15,547 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:15:15,547 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:14:21" (3/4) ... [2022-11-02 20:15:15,550 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:15:15,557 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-02 20:15:15,557 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-02 20:15:15,557 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-02 20:15:15,564 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2022-11-02 20:15:15,564 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-02 20:15:15,564 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:15:15,564 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:15:15,628 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:15:15,628 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:15:15,630 INFO L158 Benchmark]: Toolchain (without parser) took 55139.93ms. Allocated memory was 134.2MB in the beginning and 10.4GB in the end (delta: 10.3GB). Free memory was 99.8MB in the beginning and 8.9GB in the end (delta: -8.8GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2022-11-02 20:15:15,630 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 86.0MB. Free memory is still 43.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:15:15,632 INFO L158 Benchmark]: CACSL2BoogieTranslator took 505.44ms. Allocated memory is still 134.2MB. Free memory was 99.5MB in the beginning and 108.8MB in the end (delta: -9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:15:15,633 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.01ms. Allocated memory is still 134.2MB. Free memory was 108.8MB in the beginning and 107.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:15:15,633 INFO L158 Benchmark]: Boogie Preprocessor took 42.33ms. Allocated memory is still 134.2MB. Free memory was 107.5MB in the beginning and 106.0MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:15:15,634 INFO L158 Benchmark]: RCFGBuilder took 648.79ms. Allocated memory is still 134.2MB. Free memory was 106.0MB in the beginning and 91.4MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-02 20:15:15,634 INFO L158 Benchmark]: TraceAbstraction took 53766.24ms. Allocated memory was 134.2MB in the beginning and 10.4GB in the end (delta: 10.3GB). Free memory was 90.7MB in the beginning and 8.9GB in the end (delta: -8.9GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2022-11-02 20:15:15,634 INFO L158 Benchmark]: Witness Printer took 82.31ms. Allocated memory is still 10.4GB. Free memory was 8.9GB in the beginning and 8.9GB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:15:15,638 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 86.0MB. Free memory is still 43.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 505.44ms. Allocated memory is still 134.2MB. Free memory was 99.5MB in the beginning and 108.8MB in the end (delta: -9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.01ms. Allocated memory is still 134.2MB. Free memory was 108.8MB in the beginning and 107.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.33ms. Allocated memory is still 134.2MB. Free memory was 107.5MB in the beginning and 106.0MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 648.79ms. Allocated memory is still 134.2MB. Free memory was 106.0MB in the beginning and 91.4MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 53766.24ms. Allocated memory was 134.2MB in the beginning and 10.4GB in the end (delta: 10.3GB). Free memory was 90.7MB in the beginning and 8.9GB in the end (delta: -8.9GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 82.31ms. Allocated memory is still 10.4GB. Free memory was 8.9GB in the beginning and 8.9GB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 116]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 126 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 53.5s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 41.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 899 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 899 mSDsluCounter, 783 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1158 mSDsCounter, 307 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2881 IncrementalHoareTripleChecker+Invalid, 3188 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 307 mSolverCounterUnsat, 213 mSDtfsCounter, 2881 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1575 GetRequests, 1356 SyntacticMatches, 26 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8795occurred in iteration=16, InterpolantAutomatonStates: 179, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 2085 NumberOfCodeBlocks, 2071 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2741 ConstructedInterpolants, 0 QuantifiedInterpolants, 7208 SizeOfPredicates, 48 NumberOfNonLiveVariables, 1693 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 33 InterpolantComputations, 11 PerfectInterpolantSequences, 141/223 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-02 20:15:15,677 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e8127f-c32f-4d09-92aa-ed38965c1cf2/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE