./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/chl-sre-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_345a9120-99a1-4a66-a1ca-f3e06941c743/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_345a9120-99a1-4a66-a1ca-f3e06941c743/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_345a9120-99a1-4a66-a1ca-f3e06941c743/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_345a9120-99a1-4a66-a1ca-f3e06941c743/bin/uautomizer-DQz5hQGWxF/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-sre-trans.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_345a9120-99a1-4a66-a1ca-f3e06941c743/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_345a9120-99a1-4a66-a1ca-f3e06941c743/bin/uautomizer-DQz5hQGWxF --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 672ab63d50f6d257836fb16bc257f69b3b166ee79333dc7cfe86a969c93c0f7f --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 05:39:15,799 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 05:39:15,801 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 05:39:15,862 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 05:39:15,862 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 05:39:15,868 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 05:39:15,870 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 05:39:15,874 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 05:39:15,877 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 05:39:15,884 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 05:39:15,885 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 05:39:15,886 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 05:39:15,887 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 05:39:15,888 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 05:39:15,889 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 05:39:15,891 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 05:39:15,892 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 05:39:15,893 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 05:39:15,895 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 05:39:15,904 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 05:39:15,906 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 05:39:15,908 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 05:39:15,915 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 05:39:15,916 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 05:39:15,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 05:39:15,925 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 05:39:15,926 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 05:39:15,928 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 05:39:15,929 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 05:39:15,930 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 05:39:15,931 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 05:39:15,932 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 05:39:15,934 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 05:39:15,935 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 05:39:15,937 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 05:39:15,937 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 05:39:15,938 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 05:39:15,938 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 05:39:15,938 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 05:39:15,939 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 05:39:15,940 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 05:39:15,941 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_345a9120-99a1-4a66-a1ca-f3e06941c743/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-20 05:39:15,989 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 05:39:15,990 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 05:39:15,990 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 05:39:15,990 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 05:39:15,991 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 05:39:15,991 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 05:39:15,992 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 05:39:15,992 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 05:39:15,992 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 05:39:15,992 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 05:39:15,993 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 05:39:15,993 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 05:39:15,993 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 05:39:15,993 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 05:39:15,993 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 05:39:15,994 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 05:39:15,994 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 05:39:15,994 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 05:39:15,994 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 05:39:15,994 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 05:39:15,995 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 05:39:15,995 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 05:39:15,995 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 05:39:15,995 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 05:39:15,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 05:39:15,996 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 05:39:15,996 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 05:39:16,001 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 05:39:16,002 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-20 05:39:16,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 05:39:16,004 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-20 05:39:16,004 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-20 05:39:16,004 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 05:39:16,004 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 05:39:16,005 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_345a9120-99a1-4a66-a1ca-f3e06941c743/bin/uautomizer-DQz5hQGWxF/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_345a9120-99a1-4a66-a1ca-f3e06941c743/bin/uautomizer-DQz5hQGWxF 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 -> 672ab63d50f6d257836fb16bc257f69b3b166ee79333dc7cfe86a969c93c0f7f [2021-11-20 05:39:16,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 05:39:16,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 05:39:16,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 05:39:16,283 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 05:39:16,284 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 05:39:16,285 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_345a9120-99a1-4a66-a1ca-f3e06941c743/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/weaver/chl-sre-trans.wvr.c [2021-11-20 05:39:16,344 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_345a9120-99a1-4a66-a1ca-f3e06941c743/bin/uautomizer-DQz5hQGWxF/data/a15a9b3a9/d4a72aa8b5b24ed890b024df17329e0d/FLAGffb1b7d42 [2021-11-20 05:39:16,795 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 05:39:16,795 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_345a9120-99a1-4a66-a1ca-f3e06941c743/sv-benchmarks/c/weaver/chl-sre-trans.wvr.c [2021-11-20 05:39:16,802 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_345a9120-99a1-4a66-a1ca-f3e06941c743/bin/uautomizer-DQz5hQGWxF/data/a15a9b3a9/d4a72aa8b5b24ed890b024df17329e0d/FLAGffb1b7d42 [2021-11-20 05:39:17,177 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_345a9120-99a1-4a66-a1ca-f3e06941c743/bin/uautomizer-DQz5hQGWxF/data/a15a9b3a9/d4a72aa8b5b24ed890b024df17329e0d [2021-11-20 05:39:17,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 05:39:17,180 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 05:39:17,182 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 05:39:17,182 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 05:39:17,185 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 05:39:17,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:39:17" (1/1) ... [2021-11-20 05:39:17,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1581ceb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:39:17, skipping insertion in model container [2021-11-20 05:39:17,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:39:17" (1/1) ... [2021-11-20 05:39:17,194 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 05:39:17,208 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 05:39:17,459 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_345a9120-99a1-4a66-a1ca-f3e06941c743/sv-benchmarks/c/weaver/chl-sre-trans.wvr.c[2272,2285] [2021-11-20 05:39:17,462 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 05:39:17,470 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 05:39:17,510 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_345a9120-99a1-4a66-a1ca-f3e06941c743/sv-benchmarks/c/weaver/chl-sre-trans.wvr.c[2272,2285] [2021-11-20 05:39:17,513 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 05:39:17,535 INFO L208 MainTranslator]: Completed translation [2021-11-20 05:39:17,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:39:17 WrapperNode [2021-11-20 05:39:17,537 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 05:39:17,538 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 05:39:17,538 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 05:39:17,539 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 05:39:17,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:39:17" (1/1) ... [2021-11-20 05:39:17,563 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:39:17" (1/1) ... [2021-11-20 05:39:17,590 INFO L137 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2021-11-20 05:39:17,591 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 05:39:17,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 05:39:17,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 05:39:17,592 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 05:39:17,600 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:39:17" (1/1) ... [2021-11-20 05:39:17,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:39:17" (1/1) ... [2021-11-20 05:39:17,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:39:17" (1/1) ... [2021-11-20 05:39:17,607 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:39:17" (1/1) ... [2021-11-20 05:39:17,621 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:39:17" (1/1) ... [2021-11-20 05:39:17,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:39:17" (1/1) ... [2021-11-20 05:39:17,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:39:17" (1/1) ... [2021-11-20 05:39:17,638 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 05:39:17,640 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 05:39:17,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 05:39:17,642 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 05:39:17,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:39:17" (1/1) ... [2021-11-20 05:39:17,650 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 05:39:17,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_345a9120-99a1-4a66-a1ca-f3e06941c743/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 05:39:17,682 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_345a9120-99a1-4a66-a1ca-f3e06941c743/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 05:39:17,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_345a9120-99a1-4a66-a1ca-f3e06941c743/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 05:39:17,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 05:39:17,728 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-11-20 05:39:17,729 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-11-20 05:39:17,729 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-11-20 05:39:17,729 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-11-20 05:39:17,729 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-11-20 05:39:17,729 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-11-20 05:39:17,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 05:39:17,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-20 05:39:17,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-20 05:39:17,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 05:39:17,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 05:39:17,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-20 05:39:17,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 05:39:17,732 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-20 05:39:17,828 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 05:39:17,830 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 05:39:18,089 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 05:39:18,107 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 05:39:18,108 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-20 05:39:18,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:39:18 BoogieIcfgContainer [2021-11-20 05:39:18,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 05:39:18,114 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 05:39:18,114 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 05:39:18,119 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 05:39:18,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:39:17" (1/3) ... [2021-11-20 05:39:18,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be2659e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:39:18, skipping insertion in model container [2021-11-20 05:39:18,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:39:17" (2/3) ... [2021-11-20 05:39:18,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be2659e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:39:18, skipping insertion in model container [2021-11-20 05:39:18,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:39:18" (3/3) ... [2021-11-20 05:39:18,125 INFO L111 eAbstractionObserver]: Analyzing ICFG chl-sre-trans.wvr.c [2021-11-20 05:39:18,130 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-20 05:39:18,131 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 05:39:18,131 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-20 05:39:18,131 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-20 05:39:18,191 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,191 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,191 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,191 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,192 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,192 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,192 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,192 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,192 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,193 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,193 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,193 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,193 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,193 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,194 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,194 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,194 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,194 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,194 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,194 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,195 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,195 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,196 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,196 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,196 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,196 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,196 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,197 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,197 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,197 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,197 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,197 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,198 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,198 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,198 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,198 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,199 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,199 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,199 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,199 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,200 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,200 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,200 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,200 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,201 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,201 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,201 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,201 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,201 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,202 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,202 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,202 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,202 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,202 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,203 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,203 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,203 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,203 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,203 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,203 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,207 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,207 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,207 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,207 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,210 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,211 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,211 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,211 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,212 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,212 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,212 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,213 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 05:39:18,217 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-11-20 05:39:18,268 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 05:39:18,276 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 05:39:18,276 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-11-20 05:39:18,292 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 119 places, 116 transitions, 256 flow [2021-11-20 05:39:18,398 INFO L129 PetriNetUnfolder]: 7/113 cut-off events. [2021-11-20 05:39:18,399 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-11-20 05:39:18,403 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 7/113 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 114 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2021-11-20 05:39:18,404 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 116 transitions, 256 flow [2021-11-20 05:39:18,410 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 102 transitions, 222 flow [2021-11-20 05:39:18,442 INFO L129 PetriNetUnfolder]: 7/101 cut-off events. [2021-11-20 05:39:18,442 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-11-20 05:39:18,442 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 05:39:18,443 INFO L254 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, 1, 1, 1, 1] [2021-11-20 05:39:18,444 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 05:39:18,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:39:18,449 INFO L85 PathProgramCache]: Analyzing trace with hash -64104107, now seen corresponding path program 1 times [2021-11-20 05:39:18,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:39:18,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161772248] [2021-11-20 05:39:18,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:39:18,459 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:39:18,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:39:18,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:39:18,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:39:18,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161772248] [2021-11-20 05:39:18,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161772248] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:39:18,854 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:39:18,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 05:39:18,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202400519] [2021-11-20 05:39:18,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:39:18,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 05:39:18,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:39:18,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 05:39:18,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-20 05:39:18,900 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 116 [2021-11-20 05:39:18,913 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 102 transitions, 222 flow. Second operand has 7 states, 7 states have (on average 96.57142857142857) internal successors, (676), 7 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:39:18,913 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 05:39:18,913 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 116 [2021-11-20 05:39:18,915 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 05:39:19,170 INFO L129 PetriNetUnfolder]: 83/396 cut-off events. [2021-11-20 05:39:19,171 INFO L130 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2021-11-20 05:39:19,175 INFO L84 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 396 events. 83/396 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1941 event pairs, 36 based on Foata normal form. 2/368 useless extension candidates. Maximal degree in co-relation 478. Up to 56 conditions per place. [2021-11-20 05:39:19,179 INFO L132 encePairwiseOnDemand]: 106/116 looper letters, 25 selfloop transitions, 5 changer transitions 6/117 dead transitions. [2021-11-20 05:39:19,179 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 117 transitions, 342 flow [2021-11-20 05:39:19,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 05:39:19,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-11-20 05:39:19,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 791 transitions. [2021-11-20 05:39:19,197 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8523706896551724 [2021-11-20 05:39:19,198 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 791 transitions. [2021-11-20 05:39:19,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 791 transitions. [2021-11-20 05:39:19,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 05:39:19,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 791 transitions. [2021-11-20 05:39:19,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 98.875) internal successors, (791), 8 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:39:19,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 116.0) internal successors, (1044), 9 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:39:19,222 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 116.0) internal successors, (1044), 9 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:39:19,224 INFO L186 Difference]: Start difference. First operand has 105 places, 102 transitions, 222 flow. Second operand 8 states and 791 transitions. [2021-11-20 05:39:19,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 117 transitions, 342 flow [2021-11-20 05:39:19,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 117 transitions, 318 flow, removed 0 selfloop flow, removed 6 redundant places. [2021-11-20 05:39:19,234 INFO L242 Difference]: Finished difference. Result has 110 places, 102 transitions, 236 flow [2021-11-20 05:39:19,236 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=236, PETRI_PLACES=110, PETRI_TRANSITIONS=102} [2021-11-20 05:39:19,240 INFO L334 CegarLoopForPetriNet]: 105 programPoint places, 5 predicate places. [2021-11-20 05:39:19,240 INFO L470 AbstractCegarLoop]: Abstraction has has 110 places, 102 transitions, 236 flow [2021-11-20 05:39:19,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 96.57142857142857) internal successors, (676), 7 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:39:19,242 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 05:39:19,242 INFO L254 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, 1, 1, 1, 1, 1, 1] [2021-11-20 05:39:19,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 05:39:19,242 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 05:39:19,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:39:19,243 INFO L85 PathProgramCache]: Analyzing trace with hash 785676326, now seen corresponding path program 1 times [2021-11-20 05:39:19,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:39:19,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342796625] [2021-11-20 05:39:19,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:39:19,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:39:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:39:19,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:39:19,460 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:39:19,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342796625] [2021-11-20 05:39:19,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342796625] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:39:19,462 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:39:19,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 05:39:19,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696227656] [2021-11-20 05:39:19,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:39:19,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 05:39:19,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:39:19,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 05:39:19,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 05:39:19,468 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 116 [2021-11-20 05:39:19,469 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 102 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 100.33333333333333) internal successors, (602), 6 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:39:19,469 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 05:39:19,469 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 116 [2021-11-20 05:39:19,469 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 05:39:19,612 INFO L129 PetriNetUnfolder]: 27/294 cut-off events. [2021-11-20 05:39:19,612 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-11-20 05:39:19,616 INFO L84 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 294 events. 27/294 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1331 event pairs, 6 based on Foata normal form. 1/268 useless extension candidates. Maximal degree in co-relation 394. Up to 20 conditions per place. [2021-11-20 05:39:19,617 INFO L132 encePairwiseOnDemand]: 109/116 looper letters, 14 selfloop transitions, 3 changer transitions 10/114 dead transitions. [2021-11-20 05:39:19,617 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 114 transitions, 325 flow [2021-11-20 05:39:19,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 05:39:19,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-11-20 05:39:19,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 616 transitions. [2021-11-20 05:39:19,621 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8850574712643678 [2021-11-20 05:39:19,621 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 616 transitions. [2021-11-20 05:39:19,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 616 transitions. [2021-11-20 05:39:19,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 05:39:19,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 616 transitions. [2021-11-20 05:39:19,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 102.66666666666667) internal successors, (616), 6 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:39:19,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:39:19,629 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:39:19,629 INFO L186 Difference]: Start difference. First operand has 110 places, 102 transitions, 236 flow. Second operand 6 states and 616 transitions. [2021-11-20 05:39:19,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 114 transitions, 325 flow [2021-11-20 05:39:19,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 114 transitions, 315 flow, removed 3 selfloop flow, removed 4 redundant places. [2021-11-20 05:39:19,640 INFO L242 Difference]: Finished difference. Result has 111 places, 102 transitions, 246 flow [2021-11-20 05:39:19,640 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=246, PETRI_PLACES=111, PETRI_TRANSITIONS=102} [2021-11-20 05:39:19,641 INFO L334 CegarLoopForPetriNet]: 105 programPoint places, 6 predicate places. [2021-11-20 05:39:19,642 INFO L470 AbstractCegarLoop]: Abstraction has has 111 places, 102 transitions, 246 flow [2021-11-20 05:39:19,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.33333333333333) internal successors, (602), 6 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:39:19,644 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 05:39:19,644 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:39:19,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-20 05:39:19,645 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 05:39:19,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:39:19,646 INFO L85 PathProgramCache]: Analyzing trace with hash -231943299, now seen corresponding path program 1 times [2021-11-20 05:39:19,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:39:19,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299879310] [2021-11-20 05:39:19,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:39:19,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:39:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:39:19,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:39:19,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:39:19,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299879310] [2021-11-20 05:39:19,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299879310] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:39:19,951 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:39:19,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 05:39:19,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530864965] [2021-11-20 05:39:19,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:39:19,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 05:39:19,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:39:19,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 05:39:19,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-20 05:39:19,962 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 116 [2021-11-20 05:39:19,963 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 102 transitions, 246 flow. Second operand has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:39:19,963 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 05:39:19,963 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 116 [2021-11-20 05:39:19,964 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 05:39:20,323 INFO L129 PetriNetUnfolder]: 357/1507 cut-off events. [2021-11-20 05:39:20,324 INFO L130 PetriNetUnfolder]: For 110/110 co-relation queries the response was YES. [2021-11-20 05:39:20,331 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2334 conditions, 1507 events. 357/1507 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 11915 event pairs, 47 based on Foata normal form. 0/1217 useless extension candidates. Maximal degree in co-relation 2313. Up to 298 conditions per place. [2021-11-20 05:39:20,345 INFO L132 encePairwiseOnDemand]: 107/116 looper letters, 46 selfloop transitions, 8 changer transitions 10/138 dead transitions. [2021-11-20 05:39:20,345 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 138 transitions, 449 flow [2021-11-20 05:39:20,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 05:39:20,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-11-20 05:39:20,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 511 transitions. [2021-11-20 05:39:20,349 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8810344827586207 [2021-11-20 05:39:20,349 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 511 transitions. [2021-11-20 05:39:20,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 511 transitions. [2021-11-20 05:39:20,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 05:39:20,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 511 transitions. [2021-11-20 05:39:20,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.2) internal successors, (511), 5 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) [2021-11-20 05:39:20,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:39:20,355 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:39:20,355 INFO L186 Difference]: Start difference. First operand has 111 places, 102 transitions, 246 flow. Second operand 5 states and 511 transitions. [2021-11-20 05:39:20,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 138 transitions, 449 flow [2021-11-20 05:39:20,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 138 transitions, 435 flow, removed 4 selfloop flow, removed 5 redundant places. [2021-11-20 05:39:20,369 INFO L242 Difference]: Finished difference. Result has 112 places, 106 transitions, 278 flow [2021-11-20 05:39:20,370 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=278, PETRI_PLACES=112, PETRI_TRANSITIONS=106} [2021-11-20 05:39:20,372 INFO L334 CegarLoopForPetriNet]: 105 programPoint places, 7 predicate places. [2021-11-20 05:39:20,373 INFO L470 AbstractCegarLoop]: Abstraction has has 112 places, 106 transitions, 278 flow [2021-11-20 05:39:20,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:39:20,374 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 05:39:20,374 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:39:20,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-20 05:39:20,375 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 05:39:20,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:39:20,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1485931439, now seen corresponding path program 2 times [2021-11-20 05:39:20,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:39:20,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599044744] [2021-11-20 05:39:20,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:39:20,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:39:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:39:20,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:39:20,554 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:39:20,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599044744] [2021-11-20 05:39:20,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599044744] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:39:20,555 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:39:20,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 05:39:20,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430538000] [2021-11-20 05:39:20,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:39:20,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 05:39:20,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:39:20,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 05:39:20,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-20 05:39:20,564 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 116 [2021-11-20 05:39:20,565 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 106 transitions, 278 flow. Second operand has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:39:20,565 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 05:39:20,565 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 116 [2021-11-20 05:39:20,565 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 05:39:20,926 INFO L129 PetriNetUnfolder]: 305/1729 cut-off events. [2021-11-20 05:39:20,926 INFO L130 PetriNetUnfolder]: For 495/495 co-relation queries the response was YES. [2021-11-20 05:39:20,933 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2833 conditions, 1729 events. 305/1729 cut-off events. For 495/495 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 15742 event pairs, 89 based on Foata normal form. 26/1660 useless extension candidates. Maximal degree in co-relation 2438. Up to 175 conditions per place. [2021-11-20 05:39:20,941 INFO L132 encePairwiseOnDemand]: 108/116 looper letters, 54 selfloop transitions, 11 changer transitions 9/150 dead transitions. [2021-11-20 05:39:20,941 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 150 transitions, 589 flow [2021-11-20 05:39:20,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 05:39:20,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-11-20 05:39:20,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 527 transitions. [2021-11-20 05:39:20,944 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9086206896551724 [2021-11-20 05:39:20,944 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 527 transitions. [2021-11-20 05:39:20,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 527 transitions. [2021-11-20 05:39:20,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 05:39:20,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 527 transitions. [2021-11-20 05:39:20,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:39:20,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:39:20,950 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:39:20,950 INFO L186 Difference]: Start difference. First operand has 112 places, 106 transitions, 278 flow. Second operand 5 states and 527 transitions. [2021-11-20 05:39:20,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 150 transitions, 589 flow [2021-11-20 05:39:20,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 150 transitions, 579 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-11-20 05:39:20,963 INFO L242 Difference]: Finished difference. Result has 114 places, 113 transitions, 356 flow [2021-11-20 05:39:20,964 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=356, PETRI_PLACES=114, PETRI_TRANSITIONS=113} [2021-11-20 05:39:20,965 INFO L334 CegarLoopForPetriNet]: 105 programPoint places, 9 predicate places. [2021-11-20 05:39:20,966 INFO L470 AbstractCegarLoop]: Abstraction has has 114 places, 113 transitions, 356 flow [2021-11-20 05:39:20,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:39:20,966 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 05:39:20,966 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:39:20,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-20 05:39:20,968 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 05:39:20,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:39:20,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1489489077, now seen corresponding path program 1 times [2021-11-20 05:39:20,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:39:20,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990367076] [2021-11-20 05:39:20,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:39:20,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:39:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:39:21,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:39:21,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:39:21,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990367076] [2021-11-20 05:39:21,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990367076] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:39:21,141 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:39:21,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-20 05:39:21,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954600293] [2021-11-20 05:39:21,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:39:21,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-20 05:39:21,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:39:21,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-20 05:39:21,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-20 05:39:21,145 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 116 [2021-11-20 05:39:21,146 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 113 transitions, 356 flow. Second operand has 8 states, 8 states have (on average 93.5) internal successors, (748), 8 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) [2021-11-20 05:39:21,147 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 05:39:21,147 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 116 [2021-11-20 05:39:21,147 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 05:39:21,328 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([274] L48-7-->L48-8: Formula: (= v_~result_4~0_1 |v_thread2Thread1of1ForFork0_#t~ite4_3|) InVars {thread2Thread1of1ForFork0_#t~ite4=|v_thread2Thread1of1ForFork0_#t~ite4_3|} OutVars{~result_4~0=v_~result_4~0_1, thread2Thread1of1ForFork0_#t~ite4=|v_thread2Thread1of1ForFork0_#t~ite4_3|} AuxVars[] AssignedVars[~result_4~0][77], [8#L48-8true, 18#L70-4true, 172#(and (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0)), Black: 161#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 162#(or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 159#true, Black: 171#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), 10#L54-8true, Black: 169#true, Black: 173#(not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))), 179#true, 78#L42-5true, 163#(and (or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))) (or (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0) (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))))]) [2021-11-20 05:39:21,328 INFO L384 tUnfolder$Statistics]: this new event has 55 ancestors and is cut-off event [2021-11-20 05:39:21,329 INFO L387 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2021-11-20 05:39:21,329 INFO L387 tUnfolder$Statistics]: existing Event has 53 ancestors and is cut-off event [2021-11-20 05:39:21,329 INFO L387 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2021-11-20 05:39:21,371 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([274] L48-7-->L48-8: Formula: (= v_~result_4~0_1 |v_thread2Thread1of1ForFork0_#t~ite4_3|) InVars {thread2Thread1of1ForFork0_#t~ite4=|v_thread2Thread1of1ForFork0_#t~ite4_3|} OutVars{~result_4~0=v_~result_4~0_1, thread2Thread1of1ForFork0_#t~ite4=|v_thread2Thread1of1ForFork0_#t~ite4_3|} AuxVars[] AssignedVars[~result_4~0][77], [8#L48-8true, 18#L70-4true, 172#(and (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0)), Black: 161#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 162#(or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 159#true, Black: 171#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), 10#L54-8true, Black: 169#true, Black: 173#(not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))), 179#true, 49#L42-6true, 163#(and (or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))) (or (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0) (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))))]) [2021-11-20 05:39:21,371 INFO L384 tUnfolder$Statistics]: this new event has 56 ancestors and is cut-off event [2021-11-20 05:39:21,371 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-11-20 05:39:21,371 INFO L387 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2021-11-20 05:39:21,372 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-11-20 05:39:21,373 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([287] L54-7-->L54-8: Formula: (= v_~result_5~0_1 |v_thread3Thread1of1ForFork1_#t~ite6_3|) InVars {thread3Thread1of1ForFork1_#t~ite6=|v_thread3Thread1of1ForFork1_#t~ite6_3|} OutVars{thread3Thread1of1ForFork1_#t~ite6=|v_thread3Thread1of1ForFork1_#t~ite6_3|, ~result_5~0=v_~result_5~0_1} AuxVars[] AssignedVars[~result_5~0][111], [8#L48-8true, 18#L70-4true, 172#(and (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0)), Black: 161#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 162#(or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 159#true, Black: 171#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), 10#L54-8true, Black: 169#true, Black: 173#(not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))), 179#true, 78#L42-5true, 163#(and (or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))) (or (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0) (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))))]) [2021-11-20 05:39:21,373 INFO L384 tUnfolder$Statistics]: this new event has 53 ancestors and is not cut-off event [2021-11-20 05:39:21,373 INFO L387 tUnfolder$Statistics]: existing Event has 55 ancestors and is not cut-off event [2021-11-20 05:39:21,373 INFO L387 tUnfolder$Statistics]: existing Event has 55 ancestors and is not cut-off event [2021-11-20 05:39:21,373 INFO L387 tUnfolder$Statistics]: existing Event has 55 ancestors and is not cut-off event [2021-11-20 05:39:21,390 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([274] L48-7-->L48-8: Formula: (= v_~result_4~0_1 |v_thread2Thread1of1ForFork0_#t~ite4_3|) InVars {thread2Thread1of1ForFork0_#t~ite4=|v_thread2Thread1of1ForFork0_#t~ite4_3|} OutVars{~result_4~0=v_~result_4~0_1, thread2Thread1of1ForFork0_#t~ite4=|v_thread2Thread1of1ForFork0_#t~ite4_3|} AuxVars[] AssignedVars[~result_4~0][77], [8#L48-8true, 18#L70-4true, 172#(and (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0)), Black: 161#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 162#(or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 159#true, 6#L42-7true, Black: 171#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), 10#L54-8true, Black: 169#true, Black: 173#(not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))), 179#true, 163#(and (or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))) (or (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0) (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))))]) [2021-11-20 05:39:21,391 INFO L384 tUnfolder$Statistics]: this new event has 57 ancestors and is cut-off event [2021-11-20 05:39:21,393 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-11-20 05:39:21,393 INFO L387 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2021-11-20 05:39:21,393 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-11-20 05:39:21,394 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([287] L54-7-->L54-8: Formula: (= v_~result_5~0_1 |v_thread3Thread1of1ForFork1_#t~ite6_3|) InVars {thread3Thread1of1ForFork1_#t~ite6=|v_thread3Thread1of1ForFork1_#t~ite6_3|} OutVars{thread3Thread1of1ForFork1_#t~ite6=|v_thread3Thread1of1ForFork1_#t~ite6_3|, ~result_5~0=v_~result_5~0_1} AuxVars[] AssignedVars[~result_5~0][111], [8#L48-8true, 18#L70-4true, 172#(and (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0)), Black: 161#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 162#(or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 159#true, 10#L54-8true, Black: 171#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 169#true, Black: 173#(not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))), 179#true, 49#L42-6true, 163#(and (or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))) (or (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0) (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))))]) [2021-11-20 05:39:21,394 INFO L384 tUnfolder$Statistics]: this new event has 54 ancestors and is not cut-off event [2021-11-20 05:39:21,394 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is not cut-off event [2021-11-20 05:39:21,394 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is not cut-off event [2021-11-20 05:39:21,394 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is not cut-off event [2021-11-20 05:39:21,409 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([274] L48-7-->L48-8: Formula: (= v_~result_4~0_1 |v_thread2Thread1of1ForFork0_#t~ite4_3|) InVars {thread2Thread1of1ForFork0_#t~ite4=|v_thread2Thread1of1ForFork0_#t~ite4_3|} OutVars{~result_4~0=v_~result_4~0_1, thread2Thread1of1ForFork0_#t~ite4=|v_thread2Thread1of1ForFork0_#t~ite4_3|} AuxVars[] AssignedVars[~result_4~0][77], [8#L48-8true, 18#L70-4true, 172#(and (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0)), Black: 161#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 162#(or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 159#true, Black: 171#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), 10#L54-8true, Black: 169#true, Black: 173#(not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))), 179#true, 7#L42-8true, 163#(and (or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))) (or (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0) (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))))]) [2021-11-20 05:39:21,410 INFO L384 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2021-11-20 05:39:21,410 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-11-20 05:39:21,411 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-11-20 05:39:21,411 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-11-20 05:39:21,411 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([287] L54-7-->L54-8: Formula: (= v_~result_5~0_1 |v_thread3Thread1of1ForFork1_#t~ite6_3|) InVars {thread3Thread1of1ForFork1_#t~ite6=|v_thread3Thread1of1ForFork1_#t~ite6_3|} OutVars{thread3Thread1of1ForFork1_#t~ite6=|v_thread3Thread1of1ForFork1_#t~ite6_3|, ~result_5~0=v_~result_5~0_1} AuxVars[] AssignedVars[~result_5~0][111], [8#L48-8true, 18#L70-4true, 172#(and (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0)), Black: 161#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 162#(or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 159#true, 6#L42-7true, Black: 171#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), 10#L54-8true, Black: 169#true, Black: 173#(not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))), 179#true, 163#(and (or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))) (or (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0) (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))))]) [2021-11-20 05:39:21,411 INFO L384 tUnfolder$Statistics]: this new event has 55 ancestors and is not cut-off event [2021-11-20 05:39:21,412 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is not cut-off event [2021-11-20 05:39:21,412 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is not cut-off event [2021-11-20 05:39:21,412 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is not cut-off event [2021-11-20 05:39:21,418 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([287] L54-7-->L54-8: Formula: (= v_~result_5~0_1 |v_thread3Thread1of1ForFork1_#t~ite6_3|) InVars {thread3Thread1of1ForFork1_#t~ite6=|v_thread3Thread1of1ForFork1_#t~ite6_3|} OutVars{thread3Thread1of1ForFork1_#t~ite6=|v_thread3Thread1of1ForFork1_#t~ite6_3|, ~result_5~0=v_~result_5~0_1} AuxVars[] AssignedVars[~result_5~0][112], [8#L48-8true, 18#L70-4true, 172#(and (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0)), Black: 161#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 162#(or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 159#true, 10#L54-8true, Black: 171#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 169#true, Black: 173#(not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))), 181#(<= (+ |thread1Thread1of1ForFork2_#t~ite1| 1) 0), 49#L42-6true, 163#(and (or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))) (or (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0) (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))))]) [2021-11-20 05:39:21,418 INFO L384 tUnfolder$Statistics]: this new event has 56 ancestors and is cut-off event [2021-11-20 05:39:21,418 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-11-20 05:39:21,418 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-11-20 05:39:21,419 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-11-20 05:39:21,426 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([274] L48-7-->L48-8: Formula: (= v_~result_4~0_1 |v_thread2Thread1of1ForFork0_#t~ite4_3|) InVars {thread2Thread1of1ForFork0_#t~ite4=|v_thread2Thread1of1ForFork0_#t~ite4_3|} OutVars{~result_4~0=v_~result_4~0_1, thread2Thread1of1ForFork0_#t~ite4=|v_thread2Thread1of1ForFork0_#t~ite4_3|} AuxVars[] AssignedVars[~result_4~0][77], [8#L48-8true, 18#L70-4true, 172#(and (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0)), Black: 161#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 162#(or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 159#true, Black: 171#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), 10#L54-8true, Black: 169#true, Black: 173#(not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))), 25#L42-9true, 179#true, 163#(and (or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))) (or (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0) (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))))]) [2021-11-20 05:39:21,427 INFO L384 tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event [2021-11-20 05:39:21,427 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-11-20 05:39:21,427 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-11-20 05:39:21,427 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-11-20 05:39:21,429 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([287] L54-7-->L54-8: Formula: (= v_~result_5~0_1 |v_thread3Thread1of1ForFork1_#t~ite6_3|) InVars {thread3Thread1of1ForFork1_#t~ite6=|v_thread3Thread1of1ForFork1_#t~ite6_3|} OutVars{thread3Thread1of1ForFork1_#t~ite6=|v_thread3Thread1of1ForFork1_#t~ite6_3|, ~result_5~0=v_~result_5~0_1} AuxVars[] AssignedVars[~result_5~0][111], [8#L48-8true, 18#L70-4true, 172#(and (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0)), Black: 161#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 162#(or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 159#true, Black: 171#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), 10#L54-8true, Black: 169#true, Black: 173#(not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))), 179#true, 7#L42-8true, 163#(and (or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))) (or (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0) (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))))]) [2021-11-20 05:39:21,429 INFO L384 tUnfolder$Statistics]: this new event has 56 ancestors and is not cut-off event [2021-11-20 05:39:21,429 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is not cut-off event [2021-11-20 05:39:21,430 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is not cut-off event [2021-11-20 05:39:21,430 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is not cut-off event [2021-11-20 05:39:21,434 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([287] L54-7-->L54-8: Formula: (= v_~result_5~0_1 |v_thread3Thread1of1ForFork1_#t~ite6_3|) InVars {thread3Thread1of1ForFork1_#t~ite6=|v_thread3Thread1of1ForFork1_#t~ite6_3|} OutVars{thread3Thread1of1ForFork1_#t~ite6=|v_thread3Thread1of1ForFork1_#t~ite6_3|, ~result_5~0=v_~result_5~0_1} AuxVars[] AssignedVars[~result_5~0][115], [8#L48-8true, 18#L70-4true, 172#(and (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0)), Black: 161#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 162#(or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 159#true, 6#L42-7true, Black: 171#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), 10#L54-8true, Black: 169#true, Black: 173#(not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))), 163#(and (or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))) (or (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0) (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256))))), 188#(and (<= (+ |thread1Thread1of1ForFork2_#t~ite2| 1) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite1| 1) 0))]) [2021-11-20 05:39:21,434 INFO L384 tUnfolder$Statistics]: this new event has 57 ancestors and is cut-off event [2021-11-20 05:39:21,434 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-11-20 05:39:21,434 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-11-20 05:39:21,434 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-11-20 05:39:21,440 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([274] L48-7-->L48-8: Formula: (= v_~result_4~0_1 |v_thread2Thread1of1ForFork0_#t~ite4_3|) InVars {thread2Thread1of1ForFork0_#t~ite4=|v_thread2Thread1of1ForFork0_#t~ite4_3|} OutVars{~result_4~0=v_~result_4~0_1, thread2Thread1of1ForFork0_#t~ite4=|v_thread2Thread1of1ForFork0_#t~ite4_3|} AuxVars[] AssignedVars[~result_4~0][77], [8#L48-8true, 18#L70-4true, 172#(and (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0)), Black: 161#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 162#(or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 159#true, Black: 171#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), 10#L54-8true, Black: 169#true, 34#L44true, Black: 173#(not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))), 179#true, 163#(and (or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))) (or (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0) (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))))]) [2021-11-20 05:39:21,441 INFO L384 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2021-11-20 05:39:21,441 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-11-20 05:39:21,441 INFO L387 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2021-11-20 05:39:21,441 INFO L387 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2021-11-20 05:39:21,442 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([287] L54-7-->L54-8: Formula: (= v_~result_5~0_1 |v_thread3Thread1of1ForFork1_#t~ite6_3|) InVars {thread3Thread1of1ForFork1_#t~ite6=|v_thread3Thread1of1ForFork1_#t~ite6_3|} OutVars{thread3Thread1of1ForFork1_#t~ite6=|v_thread3Thread1of1ForFork1_#t~ite6_3|, ~result_5~0=v_~result_5~0_1} AuxVars[] AssignedVars[~result_5~0][111], [8#L48-8true, 18#L70-4true, 172#(and (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0)), Black: 161#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 162#(or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 159#true, Black: 171#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), 10#L54-8true, Black: 169#true, Black: 173#(not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))), 25#L42-9true, 179#true, 163#(and (or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))) (or (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0) (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))))]) [2021-11-20 05:39:21,442 INFO L384 tUnfolder$Statistics]: this new event has 57 ancestors and is not cut-off event [2021-11-20 05:39:21,442 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is not cut-off event [2021-11-20 05:39:21,442 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is not cut-off event [2021-11-20 05:39:21,442 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is not cut-off event [2021-11-20 05:39:21,446 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([287] L54-7-->L54-8: Formula: (= v_~result_5~0_1 |v_thread3Thread1of1ForFork1_#t~ite6_3|) InVars {thread3Thread1of1ForFork1_#t~ite6=|v_thread3Thread1of1ForFork1_#t~ite6_3|} OutVars{thread3Thread1of1ForFork1_#t~ite6=|v_thread3Thread1of1ForFork1_#t~ite6_3|, ~result_5~0=v_~result_5~0_1} AuxVars[] AssignedVars[~result_5~0][117], [8#L48-8true, 18#L70-4true, 172#(and (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0)), Black: 161#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 162#(or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 159#true, 190#(and (<= (+ |thread1Thread1of1ForFork2_#t~ite2| 1) 0) (<= (+ ~result_3~0 1) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite1| 1) 0)), Black: 171#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), 10#L54-8true, Black: 169#true, Black: 173#(not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))), 7#L42-8true, 163#(and (or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))) (or (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0) (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))))]) [2021-11-20 05:39:21,447 INFO L384 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2021-11-20 05:39:21,447 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-11-20 05:39:21,447 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-11-20 05:39:21,447 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-11-20 05:39:21,452 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([287] L54-7-->L54-8: Formula: (= v_~result_5~0_1 |v_thread3Thread1of1ForFork1_#t~ite6_3|) InVars {thread3Thread1of1ForFork1_#t~ite6=|v_thread3Thread1of1ForFork1_#t~ite6_3|} OutVars{thread3Thread1of1ForFork1_#t~ite6=|v_thread3Thread1of1ForFork1_#t~ite6_3|, ~result_5~0=v_~result_5~0_1} AuxVars[] AssignedVars[~result_5~0][111], [8#L48-8true, 18#L70-4true, 172#(and (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0)), Black: 161#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 162#(or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 159#true, 10#L54-8true, Black: 171#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 169#true, 34#L44true, Black: 173#(not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))), 179#true, 163#(and (or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))) (or (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0) (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))))]) [2021-11-20 05:39:21,452 INFO L384 tUnfolder$Statistics]: this new event has 58 ancestors and is not cut-off event [2021-11-20 05:39:21,453 INFO L387 tUnfolder$Statistics]: existing Event has 60 ancestors and is not cut-off event [2021-11-20 05:39:21,453 INFO L387 tUnfolder$Statistics]: existing Event has 60 ancestors and is not cut-off event [2021-11-20 05:39:21,453 INFO L387 tUnfolder$Statistics]: existing Event has 60 ancestors and is not cut-off event [2021-11-20 05:39:21,456 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([287] L54-7-->L54-8: Formula: (= v_~result_5~0_1 |v_thread3Thread1of1ForFork1_#t~ite6_3|) InVars {thread3Thread1of1ForFork1_#t~ite6=|v_thread3Thread1of1ForFork1_#t~ite6_3|} OutVars{thread3Thread1of1ForFork1_#t~ite6=|v_thread3Thread1of1ForFork1_#t~ite6_3|, ~result_5~0=v_~result_5~0_1} AuxVars[] AssignedVars[~result_5~0][119], [8#L48-8true, 18#L70-4true, 172#(and (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0)), Black: 161#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 162#(or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 159#true, Black: 171#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), 10#L54-8true, Black: 169#true, Black: 173#(not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))), 25#L42-9true, 194#(and (<= (+ ~result_3~0 1) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite1| 1) 0)), 163#(and (or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))) (or (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0) (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))))]) [2021-11-20 05:39:21,457 INFO L384 tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event [2021-11-20 05:39:21,457 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-11-20 05:39:21,457 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-11-20 05:39:21,457 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-11-20 05:39:21,463 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([287] L54-7-->L54-8: Formula: (= v_~result_5~0_1 |v_thread3Thread1of1ForFork1_#t~ite6_3|) InVars {thread3Thread1of1ForFork1_#t~ite6=|v_thread3Thread1of1ForFork1_#t~ite6_3|} OutVars{thread3Thread1of1ForFork1_#t~ite6=|v_thread3Thread1of1ForFork1_#t~ite6_3|, ~result_5~0=v_~result_5~0_1} AuxVars[] AssignedVars[~result_5~0][121], [8#L48-8true, 18#L70-4true, 172#(and (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0)), Black: 161#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 162#(or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 159#true, 10#L54-8true, Black: 171#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), 183#(<= (+ ~result_3~0 1) 0), Black: 169#true, 34#L44true, Black: 173#(not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))), 163#(and (or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))) (or (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0) (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))))]) [2021-11-20 05:39:21,464 INFO L384 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2021-11-20 05:39:21,464 INFO L387 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2021-11-20 05:39:21,464 INFO L387 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2021-11-20 05:39:21,464 INFO L387 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2021-11-20 05:39:21,479 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([274] L48-7-->L48-8: Formula: (= v_~result_4~0_1 |v_thread2Thread1of1ForFork0_#t~ite4_3|) InVars {thread2Thread1of1ForFork0_#t~ite4=|v_thread2Thread1of1ForFork0_#t~ite4_3|} OutVars{~result_4~0=v_~result_4~0_1, thread2Thread1of1ForFork0_#t~ite4=|v_thread2Thread1of1ForFork0_#t~ite4_3|} AuxVars[] AssignedVars[~result_4~0][77], [Black: 169#true, Black: 173#(not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))), 106#L71-2true, 8#L48-8true, 172#(and (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0)), 179#true, Black: 161#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 162#(or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 159#true, 163#(and (or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))) (or (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0) (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256))))), Black: 171#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), 10#L54-8true]) [2021-11-20 05:39:21,480 INFO L384 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2021-11-20 05:39:21,480 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2021-11-20 05:39:21,480 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-11-20 05:39:21,480 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2021-11-20 05:39:21,482 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([287] L54-7-->L54-8: Formula: (= v_~result_5~0_1 |v_thread3Thread1of1ForFork1_#t~ite6_3|) InVars {thread3Thread1of1ForFork1_#t~ite6=|v_thread3Thread1of1ForFork1_#t~ite6_3|} OutVars{thread3Thread1of1ForFork1_#t~ite6=|v_thread3Thread1of1ForFork1_#t~ite6_3|, ~result_5~0=v_~result_5~0_1} AuxVars[] AssignedVars[~result_5~0][121], [183#(<= (+ ~result_3~0 1) 0), Black: 169#true, Black: 173#(not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))), 8#L48-8true, 106#L71-2true, 172#(and (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0)), Black: 161#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 162#(or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 159#true, 163#(and (or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))) (or (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0) (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256))))), Black: 171#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), 10#L54-8true]) [2021-11-20 05:39:21,482 INFO L384 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2021-11-20 05:39:21,482 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2021-11-20 05:39:21,482 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2021-11-20 05:39:21,482 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2021-11-20 05:39:21,490 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([287] L54-7-->L54-8: Formula: (= v_~result_5~0_1 |v_thread3Thread1of1ForFork1_#t~ite6_3|) InVars {thread3Thread1of1ForFork1_#t~ite6=|v_thread3Thread1of1ForFork1_#t~ite6_3|} OutVars{thread3Thread1of1ForFork1_#t~ite6=|v_thread3Thread1of1ForFork1_#t~ite6_3|, ~result_5~0=v_~result_5~0_1} AuxVars[] AssignedVars[~result_5~0][111], [Black: 169#true, Black: 173#(not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))), 8#L48-8true, 106#L71-2true, 172#(and (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0)), 179#true, Black: 161#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 162#(or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 159#true, 163#(and (or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))) (or (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0) (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256))))), Black: 171#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), 10#L54-8true]) [2021-11-20 05:39:21,490 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is not cut-off event [2021-11-20 05:39:21,490 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2021-11-20 05:39:21,490 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2021-11-20 05:39:21,490 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2021-11-20 05:39:21,502 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([287] L54-7-->L54-8: Formula: (= v_~result_5~0_1 |v_thread3Thread1of1ForFork1_#t~ite6_3|) InVars {thread3Thread1of1ForFork1_#t~ite6=|v_thread3Thread1of1ForFork1_#t~ite6_3|} OutVars{thread3Thread1of1ForFork1_#t~ite6=|v_thread3Thread1of1ForFork1_#t~ite6_3|, ~result_5~0=v_~result_5~0_1} AuxVars[] AssignedVars[~result_5~0][121], [Black: 169#true, 183#(<= (+ ~result_3~0 1) 0), 9#L72-2true, Black: 173#(not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))), 172#(and (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0)), Black: 161#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 162#(or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 159#true, 163#(and (or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))) (or (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0) (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256))))), Black: 171#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), 10#L54-8true]) [2021-11-20 05:39:21,502 INFO L384 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2021-11-20 05:39:21,502 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2021-11-20 05:39:21,503 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2021-11-20 05:39:21,503 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2021-11-20 05:39:21,504 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([287] L54-7-->L54-8: Formula: (= v_~result_5~0_1 |v_thread3Thread1of1ForFork1_#t~ite6_3|) InVars {thread3Thread1of1ForFork1_#t~ite6=|v_thread3Thread1of1ForFork1_#t~ite6_3|} OutVars{thread3Thread1of1ForFork1_#t~ite6=|v_thread3Thread1of1ForFork1_#t~ite6_3|, ~result_5~0=v_~result_5~0_1} AuxVars[] AssignedVars[~result_5~0][111], [Black: 169#true, Black: 173#(not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))), 9#L72-2true, 172#(and (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0)), 179#true, Black: 161#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 162#(or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), Black: 159#true, 163#(and (or (not (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))) (or (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0) (= ~sponsored_0~0 (* 256 (div ~sponsored_0~0 256))))), Black: 171#(or (not (= ~sponsored_1~0 (* 256 (div ~sponsored_1~0 256)))) (not (= (* 256 (div ~sponsored_2~0 256)) ~sponsored_2~0))), 10#L54-8true]) [2021-11-20 05:39:21,504 INFO L384 tUnfolder$Statistics]: this new event has 71 ancestors and is not cut-off event [2021-11-20 05:39:21,504 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is not cut-off event [2021-11-20 05:39:21,504 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is not cut-off event [2021-11-20 05:39:21,505 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is not cut-off event [2021-11-20 05:39:21,555 INFO L129 PetriNetUnfolder]: 566/1831 cut-off events. [2021-11-20 05:39:21,555 INFO L130 PetriNetUnfolder]: For 252/284 co-relation queries the response was YES. [2021-11-20 05:39:21,565 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3122 conditions, 1831 events. 566/1831 cut-off events. For 252/284 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 15585 event pairs, 186 based on Foata normal form. 6/1646 useless extension candidates. Maximal degree in co-relation 2183. Up to 492 conditions per place. [2021-11-20 05:39:21,573 INFO L132 encePairwiseOnDemand]: 106/116 looper letters, 29 selfloop transitions, 7 changer transitions 19/143 dead transitions. [2021-11-20 05:39:21,573 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 143 transitions, 531 flow [2021-11-20 05:39:21,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-20 05:39:21,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-11-20 05:39:21,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 962 transitions. [2021-11-20 05:39:21,577 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8293103448275863 [2021-11-20 05:39:21,577 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 962 transitions. [2021-11-20 05:39:21,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 962 transitions. [2021-11-20 05:39:21,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 05:39:21,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 962 transitions. [2021-11-20 05:39:21,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.2) internal successors, (962), 10 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:39:21,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:39:21,586 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:39:21,587 INFO L186 Difference]: Start difference. First operand has 114 places, 113 transitions, 356 flow. Second operand 10 states and 962 transitions. [2021-11-20 05:39:21,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 143 transitions, 531 flow [2021-11-20 05:39:21,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 143 transitions, 527 flow, removed 2 selfloop flow, removed 0 redundant places. [2021-11-20 05:39:21,593 INFO L242 Difference]: Finished difference. Result has 128 places, 113 transitions, 375 flow [2021-11-20 05:39:21,594 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=375, PETRI_PLACES=128, PETRI_TRANSITIONS=113} [2021-11-20 05:39:21,596 INFO L334 CegarLoopForPetriNet]: 105 programPoint places, 23 predicate places. [2021-11-20 05:39:21,597 INFO L470 AbstractCegarLoop]: Abstraction has has 128 places, 113 transitions, 375 flow [2021-11-20 05:39:21,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.5) internal successors, (748), 8 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) [2021-11-20 05:39:21,597 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 05:39:21,598 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:39:21,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-20 05:39:21,598 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 05:39:21,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:39:21,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1168574361, now seen corresponding path program 3 times [2021-11-20 05:39:21,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:39:21,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811941664] [2021-11-20 05:39:21,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:39:21,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:39:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:39:21,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:39:21,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:39:21,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811941664] [2021-11-20 05:39:21,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811941664] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:39:21,709 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:39:21,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 05:39:21,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715610326] [2021-11-20 05:39:21,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:39:21,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 05:39:21,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:39:21,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 05:39:21,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-20 05:39:21,713 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 116 [2021-11-20 05:39:21,714 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 113 transitions, 375 flow. Second operand has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:39:21,714 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 05:39:21,714 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 116 [2021-11-20 05:39:21,714 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 05:39:22,020 INFO L129 PetriNetUnfolder]: 214/1314 cut-off events. [2021-11-20 05:39:22,020 INFO L130 PetriNetUnfolder]: For 985/985 co-relation queries the response was YES. [2021-11-20 05:39:22,027 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2561 conditions, 1314 events. 214/1314 cut-off events. For 985/985 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 10664 event pairs, 42 based on Foata normal form. 30/1288 useless extension candidates. Maximal degree in co-relation 2527. Up to 195 conditions per place. [2021-11-20 05:39:22,032 INFO L132 encePairwiseOnDemand]: 105/116 looper letters, 50 selfloop transitions, 22 changer transitions 14/159 dead transitions. [2021-11-20 05:39:22,033 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 159 transitions, 798 flow [2021-11-20 05:39:22,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 05:39:22,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-11-20 05:39:22,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 602 transitions. [2021-11-20 05:39:22,036 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8649425287356322 [2021-11-20 05:39:22,036 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 602 transitions. [2021-11-20 05:39:22,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 602 transitions. [2021-11-20 05:39:22,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 05:39:22,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 602 transitions. [2021-11-20 05:39:22,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.33333333333333) internal successors, (602), 6 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:39:22,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:39:22,041 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:39:22,041 INFO L186 Difference]: Start difference. First operand has 128 places, 113 transitions, 375 flow. Second operand 6 states and 602 transitions. [2021-11-20 05:39:22,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 159 transitions, 798 flow [2021-11-20 05:39:22,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 159 transitions, 789 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-11-20 05:39:22,050 INFO L242 Difference]: Finished difference. Result has 132 places, 123 transitions, 560 flow [2021-11-20 05:39:22,050 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=560, PETRI_PLACES=132, PETRI_TRANSITIONS=123} [2021-11-20 05:39:22,051 INFO L334 CegarLoopForPetriNet]: 105 programPoint places, 27 predicate places. [2021-11-20 05:39:22,051 INFO L470 AbstractCegarLoop]: Abstraction has has 132 places, 123 transitions, 560 flow [2021-11-20 05:39:22,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:39:22,052 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 05:39:22,052 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:39:22,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-20 05:39:22,052 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 05:39:22,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:39:22,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1610344149, now seen corresponding path program 4 times [2021-11-20 05:39:22,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:39:22,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648616737] [2021-11-20 05:39:22,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:39:22,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:39:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:39:22,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:39:22,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:39:22,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648616737] [2021-11-20 05:39:22,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648616737] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:39:22,161 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:39:22,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 05:39:22,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131495348] [2021-11-20 05:39:22,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:39:22,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 05:39:22,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:39:22,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 05:39:22,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-20 05:39:22,169 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 116 [2021-11-20 05:39:22,170 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 123 transitions, 560 flow. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:39:22,170 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 05:39:22,170 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 116 [2021-11-20 05:39:22,170 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 05:39:22,459 INFO L129 PetriNetUnfolder]: 125/781 cut-off events. [2021-11-20 05:39:22,459 INFO L130 PetriNetUnfolder]: For 1246/1246 co-relation queries the response was YES. [2021-11-20 05:39:22,464 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1847 conditions, 781 events. 125/781 cut-off events. For 1246/1246 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5598 event pairs, 15 based on Foata normal form. 16/777 useless extension candidates. Maximal degree in co-relation 1813. Up to 93 conditions per place. [2021-11-20 05:39:22,469 INFO L132 encePairwiseOnDemand]: 107/116 looper letters, 56 selfloop transitions, 39 changer transitions 7/174 dead transitions. [2021-11-20 05:39:22,470 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 174 transitions, 1174 flow [2021-11-20 05:39:22,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 05:39:22,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-11-20 05:39:22,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 784 transitions. [2021-11-20 05:39:22,473 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8448275862068966 [2021-11-20 05:39:22,474 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 784 transitions. [2021-11-20 05:39:22,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 784 transitions. [2021-11-20 05:39:22,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 05:39:22,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 784 transitions. [2021-11-20 05:39:22,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:39:22,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 116.0) internal successors, (1044), 9 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:39:22,482 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 116.0) internal successors, (1044), 9 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:39:22,482 INFO L186 Difference]: Start difference. First operand has 132 places, 123 transitions, 560 flow. Second operand 8 states and 784 transitions. [2021-11-20 05:39:22,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 174 transitions, 1174 flow [2021-11-20 05:39:22,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 174 transitions, 1127 flow, removed 20 selfloop flow, removed 6 redundant places. [2021-11-20 05:39:22,497 INFO L242 Difference]: Finished difference. Result has 130 places, 144 transitions, 908 flow [2021-11-20 05:39:22,498 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=908, PETRI_PLACES=130, PETRI_TRANSITIONS=144} [2021-11-20 05:39:22,500 INFO L334 CegarLoopForPetriNet]: 105 programPoint places, 25 predicate places. [2021-11-20 05:39:22,500 INFO L470 AbstractCegarLoop]: Abstraction has has 130 places, 144 transitions, 908 flow [2021-11-20 05:39:22,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:39:22,501 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-20 05:39:22,501 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 05:39:22,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-20 05:39:22,501 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-20 05:39:22,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 05:39:22,502 INFO L85 PathProgramCache]: Analyzing trace with hash -282615927, now seen corresponding path program 1 times [2021-11-20 05:39:22,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 05:39:22,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084201966] [2021-11-20 05:39:22,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 05:39:22,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 05:39:22,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 05:39:22,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 05:39:22,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 05:39:22,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084201966] [2021-11-20 05:39:22,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084201966] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 05:39:22,605 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 05:39:22,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 05:39:22,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402054964] [2021-11-20 05:39:22,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 05:39:22,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 05:39:22,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 05:39:22,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 05:39:22,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-20 05:39:22,610 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 116 [2021-11-20 05:39:22,611 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 144 transitions, 908 flow. Second operand has 7 states, 7 states have (on average 97.28571428571429) internal successors, (681), 7 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:39:22,611 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-20 05:39:22,611 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 116 [2021-11-20 05:39:22,611 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-20 05:39:22,787 INFO L129 PetriNetUnfolder]: 98/662 cut-off events. [2021-11-20 05:39:22,787 INFO L130 PetriNetUnfolder]: For 1294/1422 co-relation queries the response was YES. [2021-11-20 05:39:22,792 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1526 conditions, 662 events. 98/662 cut-off events. For 1294/1422 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5116 event pairs, 0 based on Foata normal form. 2/650 useless extension candidates. Maximal degree in co-relation 1051. Up to 69 conditions per place. [2021-11-20 05:39:22,793 INFO L132 encePairwiseOnDemand]: 108/116 looper letters, 0 selfloop transitions, 0 changer transitions 151/151 dead transitions. [2021-11-20 05:39:22,793 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 151 transitions, 982 flow [2021-11-20 05:39:22,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 05:39:22,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-11-20 05:39:22,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 881 transitions. [2021-11-20 05:39:22,797 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8438697318007663 [2021-11-20 05:39:22,797 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 881 transitions. [2021-11-20 05:39:22,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 881 transitions. [2021-11-20 05:39:22,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 05:39:22,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 881 transitions. [2021-11-20 05:39:22,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.88888888888889) internal successors, (881), 9 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:39:22,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:39:22,805 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:39:22,805 INFO L186 Difference]: Start difference. First operand has 130 places, 144 transitions, 908 flow. Second operand 9 states and 881 transitions. [2021-11-20 05:39:22,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 151 transitions, 982 flow [2021-11-20 05:39:22,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 151 transitions, 867 flow, removed 48 selfloop flow, removed 2 redundant places. [2021-11-20 05:39:22,824 INFO L242 Difference]: Finished difference. Result has 131 places, 0 transitions, 0 flow [2021-11-20 05:39:22,825 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=0, PETRI_PLACES=131, PETRI_TRANSITIONS=0} [2021-11-20 05:39:22,827 INFO L334 CegarLoopForPetriNet]: 105 programPoint places, 26 predicate places. [2021-11-20 05:39:22,827 INFO L470 AbstractCegarLoop]: Abstraction has has 131 places, 0 transitions, 0 flow [2021-11-20 05:39:22,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.28571428571429) internal successors, (681), 7 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 05:39:22,830 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2021-11-20 05:39:22,831 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2021-11-20 05:39:22,831 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2021-11-20 05:39:22,831 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2021-11-20 05:39:22,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-20 05:39:22,835 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2021-11-20 05:39:22,837 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-11-20 05:39:22,838 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-20 05:39:22,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:39:22 BasicIcfg [2021-11-20 05:39:22,847 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-20 05:39:22,847 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-20 05:39:22,847 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-20 05:39:22,848 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-20 05:39:22,848 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:39:18" (3/4) ... [2021-11-20 05:39:22,851 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-20 05:39:22,857 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2021-11-20 05:39:22,857 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2021-11-20 05:39:22,857 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2021-11-20 05:39:22,863 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2021-11-20 05:39:22,864 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-11-20 05:39:22,864 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-20 05:39:22,864 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-20 05:39:22,904 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_345a9120-99a1-4a66-a1ca-f3e06941c743/bin/uautomizer-DQz5hQGWxF/witness.graphml [2021-11-20 05:39:22,904 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-20 05:39:22,905 INFO L158 Benchmark]: Toolchain (without parser) took 5724.59ms. Allocated memory was 100.7MB in the beginning and 186.6MB in the end (delta: 86.0MB). Free memory was 68.7MB in the beginning and 79.7MB in the end (delta: -11.0MB). Peak memory consumption was 74.9MB. Max. memory is 16.1GB. [2021-11-20 05:39:22,906 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 100.7MB. Free memory was 56.1MB in the beginning and 56.0MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 05:39:22,906 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.27ms. Allocated memory is still 100.7MB. Free memory was 68.7MB in the beginning and 74.0MB in the end (delta: -5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-20 05:39:22,906 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.95ms. Allocated memory is still 100.7MB. Free memory was 74.0MB in the beginning and 72.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 05:39:22,907 INFO L158 Benchmark]: Boogie Preprocessor took 48.03ms. Allocated memory is still 100.7MB. Free memory was 72.3MB in the beginning and 71.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 05:39:22,907 INFO L158 Benchmark]: RCFGBuilder took 471.45ms. Allocated memory is still 100.7MB. Free memory was 71.2MB in the beginning and 58.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-20 05:39:22,907 INFO L158 Benchmark]: TraceAbstraction took 4732.89ms. Allocated memory was 100.7MB in the beginning and 186.6MB in the end (delta: 86.0MB). Free memory was 58.3MB in the beginning and 82.8MB in the end (delta: -24.6MB). Peak memory consumption was 63.2MB. Max. memory is 16.1GB. [2021-11-20 05:39:22,908 INFO L158 Benchmark]: Witness Printer took 57.01ms. Allocated memory is still 186.6MB. Free memory was 82.8MB in the beginning and 79.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-20 05:39:22,911 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.30ms. Allocated memory is still 100.7MB. Free memory was 56.1MB in the beginning and 56.0MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 355.27ms. Allocated memory is still 100.7MB. Free memory was 68.7MB in the beginning and 74.0MB in the end (delta: -5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.95ms. Allocated memory is still 100.7MB. Free memory was 74.0MB in the beginning and 72.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.03ms. Allocated memory is still 100.7MB. Free memory was 72.3MB in the beginning and 71.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 471.45ms. Allocated memory is still 100.7MB. Free memory was 71.2MB in the beginning and 58.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4732.89ms. Allocated memory was 100.7MB in the beginning and 186.6MB in the end (delta: 86.0MB). Free memory was 58.3MB in the beginning and 82.8MB in the end (delta: -24.6MB). Peak memory consumption was 63.2MB. Max. memory is 16.1GB. * Witness Printer took 57.01ms. Allocated memory is still 186.6MB. Free memory was 82.8MB in the beginning and 79.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 76]: 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, 149 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: 4.6s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 244 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 244 mSDsluCounter, 320 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 416 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 644 IncrementalHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 121 mSDtfsCounter, 644 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=908occurred in iteration=7, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 682 NumberOfCodeBlocks, 682 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 674 ConstructedInterpolants, 0 QuantifiedInterpolants, 2450 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-11-20 05:39:22,973 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_345a9120-99a1-4a66-a1ca-f3e06941c743/bin/uautomizer-DQz5hQGWxF/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