./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-queue-add-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-queue-add-2.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa --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 89f85a9c071b9d85a8a89a1542b8738a051beeaf8ef3f8b389c5a92dd50b70df --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 21:49:44,888 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 21:49:44,889 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 21:49:44,912 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 21:49:44,913 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 21:49:44,914 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 21:49:44,915 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 21:49:44,917 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 21:49:44,919 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 21:49:44,919 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 21:49:44,920 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 21:49:44,921 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 21:49:44,922 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 21:49:44,923 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 21:49:44,924 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 21:49:44,925 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 21:49:44,926 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 21:49:44,927 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 21:49:44,928 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 21:49:44,930 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 21:49:44,932 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 21:49:44,933 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 21:49:44,934 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 21:49:44,935 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 21:49:44,938 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 21:49:44,938 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 21:49:44,938 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 21:49:44,939 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 21:49:44,940 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 21:49:44,940 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 21:49:44,941 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 21:49:44,941 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 21:49:44,942 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 21:49:44,943 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 21:49:44,944 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 21:49:44,944 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 21:49:44,945 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 21:49:44,945 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 21:49:44,945 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 21:49:44,946 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 21:49:44,947 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 21:49:44,947 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 21:49:44,971 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 21:49:44,972 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 21:49:44,972 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 21:49:44,972 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 21:49:44,973 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 21:49:44,973 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 21:49:44,974 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 21:49:44,974 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 21:49:44,974 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 21:49:44,974 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 21:49:44,975 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 21:49:44,975 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 21:49:44,975 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 21:49:44,975 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 21:49:44,975 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 21:49:44,976 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 21:49:44,976 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 21:49:44,976 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 21:49:44,976 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 21:49:44,976 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 21:49:44,977 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 21:49:44,977 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 21:49:44,977 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 21:49:44,977 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 21:49:44,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 21:49:44,978 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 21:49:44,978 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 21:49:44,978 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 21:49:44,978 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 21:49:44,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 21:49:44,979 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 21:49:44,979 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 21:49:44,979 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 21:49:44,979 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 21:49:44,979 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_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/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_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa 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 -> 89f85a9c071b9d85a8a89a1542b8738a051beeaf8ef3f8b389c5a92dd50b70df [2021-12-06 21:49:45,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 21:49:45,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 21:49:45,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 21:49:45,177 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 21:49:45,177 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 21:49:45,178 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/weaver/popl20-queue-add-2.wvr.c [2021-12-06 21:49:45,220 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/data/91173cdbe/b7b20809eaac40a49b6d8ea92fa2a924/FLAGa977f02cc [2021-12-06 21:49:45,602 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 21:49:45,603 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/sv-benchmarks/c/weaver/popl20-queue-add-2.wvr.c [2021-12-06 21:49:45,608 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/data/91173cdbe/b7b20809eaac40a49b6d8ea92fa2a924/FLAGa977f02cc [2021-12-06 21:49:45,617 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/data/91173cdbe/b7b20809eaac40a49b6d8ea92fa2a924 [2021-12-06 21:49:45,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 21:49:45,619 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 21:49:45,620 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 21:49:45,621 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 21:49:45,623 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 21:49:45,623 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 09:49:45" (1/1) ... [2021-12-06 21:49:45,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dfd90bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:49:45, skipping insertion in model container [2021-12-06 21:49:45,624 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 09:49:45" (1/1) ... [2021-12-06 21:49:45,629 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 21:49:45,642 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 21:49:45,773 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_097e4876-bbd3-4a1a-b7a7-2f94c4932841/sv-benchmarks/c/weaver/popl20-queue-add-2.wvr.c[2696,2709] [2021-12-06 21:49:45,779 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 21:49:45,785 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 21:49:45,801 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_097e4876-bbd3-4a1a-b7a7-2f94c4932841/sv-benchmarks/c/weaver/popl20-queue-add-2.wvr.c[2696,2709] [2021-12-06 21:49:45,803 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 21:49:45,814 INFO L208 MainTranslator]: Completed translation [2021-12-06 21:49:45,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:49:45 WrapperNode [2021-12-06 21:49:45,814 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 21:49:45,815 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 21:49:45,815 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 21:49:45,815 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 21:49:45,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:49:45" (1/1) ... [2021-12-06 21:49:45,827 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:49:45" (1/1) ... [2021-12-06 21:49:45,844 INFO L137 Inliner]: procedures = 24, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 154 [2021-12-06 21:49:45,844 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 21:49:45,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 21:49:45,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 21:49:45,845 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 21:49:45,851 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:49:45" (1/1) ... [2021-12-06 21:49:45,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:49:45" (1/1) ... [2021-12-06 21:49:45,854 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:49:45" (1/1) ... [2021-12-06 21:49:45,854 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:49:45" (1/1) ... [2021-12-06 21:49:45,859 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:49:45" (1/1) ... [2021-12-06 21:49:45,862 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:49:45" (1/1) ... [2021-12-06 21:49:45,864 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:49:45" (1/1) ... [2021-12-06 21:49:45,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 21:49:45,867 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 21:49:45,867 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 21:49:45,867 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 21:49:45,868 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:49:45" (1/1) ... [2021-12-06 21:49:45,873 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 21:49:45,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:49:45,889 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 21:49:45,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 21:49:45,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 21:49:45,928 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-12-06 21:49:45,928 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-12-06 21:49:45,928 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-12-06 21:49:45,928 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-12-06 21:49:45,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 21:49:45,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-06 21:49:45,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-06 21:49:45,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-06 21:49:45,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-06 21:49:45,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-06 21:49:45,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 21:49:45,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 21:49:45,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-06 21:49:45,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 21:49:45,930 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-06 21:49:45,993 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 21:49:45,994 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 21:49:46,171 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 21:49:46,231 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 21:49:46,231 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-06 21:49:46,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 09:49:46 BoogieIcfgContainer [2021-12-06 21:49:46,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 21:49:46,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 21:49:46,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 21:49:46,237 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 21:49:46,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 09:49:45" (1/3) ... [2021-12-06 21:49:46,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a1a8663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 09:49:46, skipping insertion in model container [2021-12-06 21:49:46,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:49:45" (2/3) ... [2021-12-06 21:49:46,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a1a8663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 09:49:46, skipping insertion in model container [2021-12-06 21:49:46,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 09:49:46" (3/3) ... [2021-12-06 21:49:46,239 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-2.wvr.c [2021-12-06 21:49:46,243 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-06 21:49:46,243 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 21:49:46,243 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-06 21:49:46,243 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-06 21:49:46,271 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,271 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,271 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,272 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,272 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,272 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,272 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,272 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,272 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,272 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,273 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,273 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,273 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,273 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,273 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,273 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,273 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,274 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,274 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,274 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,274 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,274 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,274 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,274 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,275 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,275 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,275 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,275 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,275 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,275 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,275 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,275 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,276 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,276 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,276 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,276 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,276 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,276 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,277 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,277 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,277 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,277 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,277 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,277 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,277 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,278 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,278 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,278 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,278 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,278 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,278 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,278 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,279 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,279 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,279 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,279 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,279 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,280 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,282 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,282 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,282 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,282 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,282 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,283 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,283 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,283 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,284 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,284 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,284 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,284 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,284 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,284 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,285 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,285 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,285 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:49:46,287 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-12-06 21:49:46,322 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 21:49:46,328 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-12-06 21:49:46,328 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-12-06 21:49:46,338 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 132 places, 136 transitions, 288 flow [2021-12-06 21:49:46,382 INFO L129 PetriNetUnfolder]: 11/134 cut-off events. [2021-12-06 21:49:46,382 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-12-06 21:49:46,385 INFO L84 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 134 events. 11/134 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 99. Up to 3 conditions per place. [2021-12-06 21:49:46,385 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 136 transitions, 288 flow [2021-12-06 21:49:46,389 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 125 transitions, 262 flow [2021-12-06 21:49:46,411 INFO L129 PetriNetUnfolder]: 11/124 cut-off events. [2021-12-06 21:49:46,412 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-12-06 21:49:46,412 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:49:46,412 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:49:46,413 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-06 21:49:46,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:49:46,417 INFO L85 PathProgramCache]: Analyzing trace with hash 321786498, now seen corresponding path program 1 times [2021-12-06 21:49:46,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:49:46,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693881823] [2021-12-06 21:49:46,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:49:46,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:49:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:49:46,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:49:46,578 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:49:46,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693881823] [2021-12-06 21:49:46,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693881823] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:49:46,579 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:49:46,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 21:49:46,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410221884] [2021-12-06 21:49:46,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:49:46,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-06 21:49:46,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:49:46,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-06 21:49:46,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-06 21:49:46,610 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 136 [2021-12-06 21:49:46,612 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 125 transitions, 262 flow. Second operand has 2 states, 2 states have (on average 123.5) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 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-12-06 21:49:46,613 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:49:46,613 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 136 [2021-12-06 21:49:46,614 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:49:46,663 INFO L129 PetriNetUnfolder]: 12/147 cut-off events. [2021-12-06 21:49:46,663 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-12-06 21:49:46,664 INFO L84 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 147 events. 12/147 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 172 event pairs, 5 based on Foata normal form. 14/150 useless extension candidates. Maximal degree in co-relation 97. Up to 22 conditions per place. [2021-12-06 21:49:46,666 INFO L132 encePairwiseOnDemand]: 128/136 looper letters, 7 selfloop transitions, 0 changer transitions 4/117 dead transitions. [2021-12-06 21:49:46,666 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 117 transitions, 260 flow [2021-12-06 21:49:46,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-06 21:49:46,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2021-12-06 21:49:46,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 255 transitions. [2021-12-06 21:49:46,677 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9375 [2021-12-06 21:49:46,678 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 255 transitions. [2021-12-06 21:49:46,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 255 transitions. [2021-12-06 21:49:46,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:49:46,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 255 transitions. [2021-12-06 21:49:46,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:49:46,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 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-12-06 21:49:46,688 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 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-12-06 21:49:46,690 INFO L186 Difference]: Start difference. First operand has 121 places, 125 transitions, 262 flow. Second operand 2 states and 255 transitions. [2021-12-06 21:49:46,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 117 transitions, 260 flow [2021-12-06 21:49:46,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 117 transitions, 252 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-06 21:49:46,697 INFO L242 Difference]: Finished difference. Result has 118 places, 113 transitions, 230 flow [2021-12-06 21:49:46,698 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=230, PETRI_PLACES=118, PETRI_TRANSITIONS=113} [2021-12-06 21:49:46,701 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, -3 predicate places. [2021-12-06 21:49:46,701 INFO L470 AbstractCegarLoop]: Abstraction has has 118 places, 113 transitions, 230 flow [2021-12-06 21:49:46,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 123.5) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 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-12-06 21:49:46,702 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:49:46,702 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:49:46,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 21:49:46,702 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-06 21:49:46,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:49:46,703 INFO L85 PathProgramCache]: Analyzing trace with hash -632914253, now seen corresponding path program 1 times [2021-12-06 21:49:46,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:49:46,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922181549] [2021-12-06 21:49:46,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:49:46,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:49:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:49:46,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:49:46,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:49:46,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922181549] [2021-12-06 21:49:46,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922181549] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:49:46,866 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:49:46,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 21:49:46,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705238181] [2021-12-06 21:49:46,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:49:46,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 21:49:46,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:49:46,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 21:49:46,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 21:49:46,871 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 136 [2021-12-06 21:49:46,872 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 113 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 0 states have call successors, (0), 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-12-06 21:49:46,872 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:49:46,872 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 136 [2021-12-06 21:49:46,872 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:49:46,976 INFO L129 PetriNetUnfolder]: 12/179 cut-off events. [2021-12-06 21:49:46,976 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-12-06 21:49:46,977 INFO L84 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 179 events. 12/179 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 250 event pairs, 5 based on Foata normal form. 5/175 useless extension candidates. Maximal degree in co-relation 227. Up to 31 conditions per place. [2021-12-06 21:49:46,978 INFO L132 encePairwiseOnDemand]: 126/136 looper letters, 19 selfloop transitions, 6 changer transitions 3/120 dead transitions. [2021-12-06 21:49:46,978 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 120 transitions, 302 flow [2021-12-06 21:49:46,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 21:49:46,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-06 21:49:46,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 773 transitions. [2021-12-06 21:49:46,984 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8119747899159664 [2021-12-06 21:49:46,984 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 773 transitions. [2021-12-06 21:49:46,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 773 transitions. [2021-12-06 21:49:46,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:49:46,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 773 transitions. [2021-12-06 21:49:46,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.42857142857143) internal successors, (773), 7 states have internal predecessors, (773), 0 states have call successors, (0), 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-12-06 21:49:46,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 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-12-06 21:49:46,994 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 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-12-06 21:49:46,994 INFO L186 Difference]: Start difference. First operand has 118 places, 113 transitions, 230 flow. Second operand 7 states and 773 transitions. [2021-12-06 21:49:46,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 120 transitions, 302 flow [2021-12-06 21:49:46,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 120 transitions, 302 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-06 21:49:46,997 INFO L242 Difference]: Finished difference. Result has 122 places, 114 transitions, 256 flow [2021-12-06 21:49:46,998 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=256, PETRI_PLACES=122, PETRI_TRANSITIONS=114} [2021-12-06 21:49:46,998 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 1 predicate places. [2021-12-06 21:49:46,999 INFO L470 AbstractCegarLoop]: Abstraction has has 122 places, 114 transitions, 256 flow [2021-12-06 21:49:46,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 0 states have call successors, (0), 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-12-06 21:49:46,999 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:49:46,999 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:49:47,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 21:49:47,000 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-06 21:49:47,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:49:47,001 INFO L85 PathProgramCache]: Analyzing trace with hash 853527032, now seen corresponding path program 1 times [2021-12-06 21:49:47,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:49:47,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604242281] [2021-12-06 21:49:47,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:49:47,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:49:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:49:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 21:49:47,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:49:47,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604242281] [2021-12-06 21:49:47,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604242281] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:49:47,125 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:49:47,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 21:49:47,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144814224] [2021-12-06 21:49:47,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:49:47,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 21:49:47,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:49:47,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 21:49:47,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 21:49:47,128 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 136 [2021-12-06 21:49:47,128 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 114 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 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-12-06 21:49:47,129 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:49:47,129 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 136 [2021-12-06 21:49:47,129 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:49:47,162 INFO L129 PetriNetUnfolder]: 13/156 cut-off events. [2021-12-06 21:49:47,162 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-12-06 21:49:47,163 INFO L84 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 156 events. 13/156 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 162 event pairs, 1 based on Foata normal form. 1/151 useless extension candidates. Maximal degree in co-relation 208. Up to 23 conditions per place. [2021-12-06 21:49:47,164 INFO L132 encePairwiseOnDemand]: 132/136 looper letters, 11 selfloop transitions, 3 changer transitions 0/117 dead transitions. [2021-12-06 21:49:47,164 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 117 transitions, 295 flow [2021-12-06 21:49:47,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 21:49:47,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-06 21:49:47,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2021-12-06 21:49:47,166 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8897058823529411 [2021-12-06 21:49:47,166 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 363 transitions. [2021-12-06 21:49:47,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 363 transitions. [2021-12-06 21:49:47,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:49:47,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 363 transitions. [2021-12-06 21:49:47,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:49:47,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 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-12-06 21:49:47,169 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 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-12-06 21:49:47,169 INFO L186 Difference]: Start difference. First operand has 122 places, 114 transitions, 256 flow. Second operand 3 states and 363 transitions. [2021-12-06 21:49:47,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 117 transitions, 295 flow [2021-12-06 21:49:47,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 117 transitions, 285 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-06 21:49:47,173 INFO L242 Difference]: Finished difference. Result has 120 places, 116 transitions, 269 flow [2021-12-06 21:49:47,173 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=269, PETRI_PLACES=120, PETRI_TRANSITIONS=116} [2021-12-06 21:49:47,174 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, -1 predicate places. [2021-12-06 21:49:47,174 INFO L470 AbstractCegarLoop]: Abstraction has has 120 places, 116 transitions, 269 flow [2021-12-06 21:49:47,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 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-12-06 21:49:47,175 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:49:47,175 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:49:47,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 21:49:47,176 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-06 21:49:47,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:49:47,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1991812262, now seen corresponding path program 2 times [2021-12-06 21:49:47,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:49:47,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450986290] [2021-12-06 21:49:47,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:49:47,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:49:47,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:49:47,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 21:49:47,424 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:49:47,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450986290] [2021-12-06 21:49:47,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450986290] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:49:47,425 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:49:47,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-06 21:49:47,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103165964] [2021-12-06 21:49:47,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:49:47,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-06 21:49:47,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:49:47,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-06 21:49:47,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-12-06 21:49:47,429 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 136 [2021-12-06 21:49:47,431 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 116 transitions, 269 flow. Second operand has 12 states, 12 states have (on average 90.5) internal successors, (1086), 12 states have internal predecessors, (1086), 0 states have call successors, (0), 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-12-06 21:49:47,431 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:49:47,431 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 136 [2021-12-06 21:49:47,431 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:49:47,601 INFO L129 PetriNetUnfolder]: 82/335 cut-off events. [2021-12-06 21:49:47,602 INFO L130 PetriNetUnfolder]: For 103/103 co-relation queries the response was YES. [2021-12-06 21:49:47,603 INFO L84 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 335 events. 82/335 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1209 event pairs, 20 based on Foata normal form. 1/312 useless extension candidates. Maximal degree in co-relation 637. Up to 73 conditions per place. [2021-12-06 21:49:47,606 INFO L132 encePairwiseOnDemand]: 121/136 looper letters, 49 selfloop transitions, 13 changer transitions 6/147 dead transitions. [2021-12-06 21:49:47,606 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 147 transitions, 498 flow [2021-12-06 21:49:47,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 21:49:47,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-06 21:49:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1213 transitions. [2021-12-06 21:49:47,611 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6860859728506787 [2021-12-06 21:49:47,611 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1213 transitions. [2021-12-06 21:49:47,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1213 transitions. [2021-12-06 21:49:47,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:49:47,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1213 transitions. [2021-12-06 21:49:47,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 93.3076923076923) internal successors, (1213), 13 states have internal predecessors, (1213), 0 states have call successors, (0), 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-12-06 21:49:47,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 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-12-06 21:49:47,624 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 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-12-06 21:49:47,624 INFO L186 Difference]: Start difference. First operand has 120 places, 116 transitions, 269 flow. Second operand 13 states and 1213 transitions. [2021-12-06 21:49:47,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 147 transitions, 498 flow [2021-12-06 21:49:47,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 147 transitions, 473 flow, removed 11 selfloop flow, removed 2 redundant places. [2021-12-06 21:49:47,628 INFO L242 Difference]: Finished difference. Result has 135 places, 122 transitions, 318 flow [2021-12-06 21:49:47,629 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=318, PETRI_PLACES=135, PETRI_TRANSITIONS=122} [2021-12-06 21:49:47,629 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 14 predicate places. [2021-12-06 21:49:47,629 INFO L470 AbstractCegarLoop]: Abstraction has has 135 places, 122 transitions, 318 flow [2021-12-06 21:49:47,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 90.5) internal successors, (1086), 12 states have internal predecessors, (1086), 0 states have call successors, (0), 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-12-06 21:49:47,630 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:49:47,630 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-06 21:49:47,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 21:49:47,631 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-06 21:49:47,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:49:47,631 INFO L85 PathProgramCache]: Analyzing trace with hash -199541928, now seen corresponding path program 1 times [2021-12-06 21:49:47,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:49:47,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080828844] [2021-12-06 21:49:47,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:49:47,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:49:47,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:49:47,837 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:49:47,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:49:47,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080828844] [2021-12-06 21:49:47,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080828844] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:49:47,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731971230] [2021-12-06 21:49:47,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:49:47,838 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:49:47,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:49:47,839 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:49:47,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 21:49:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:49:47,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-06 21:49:47,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:49:48,103 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 21:49:48,104 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:49:48,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731971230] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:49:48,104 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 21:49:48,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2021-12-06 21:49:48,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846921348] [2021-12-06 21:49:48,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:49:48,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 21:49:48,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:49:48,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 21:49:48,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-12-06 21:49:48,107 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 136 [2021-12-06 21:49:48,108 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 122 transitions, 318 flow. Second operand has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 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-12-06 21:49:48,108 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:49:48,108 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 136 [2021-12-06 21:49:48,108 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:49:48,184 INFO L129 PetriNetUnfolder]: 26/275 cut-off events. [2021-12-06 21:49:48,184 INFO L130 PetriNetUnfolder]: For 82/93 co-relation queries the response was YES. [2021-12-06 21:49:48,185 INFO L84 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 275 events. 26/275 cut-off events. For 82/93 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 828 event pairs, 2 based on Foata normal form. 6/277 useless extension candidates. Maximal degree in co-relation 442. Up to 37 conditions per place. [2021-12-06 21:49:48,187 INFO L132 encePairwiseOnDemand]: 132/136 looper letters, 16 selfloop transitions, 7 changer transitions 3/132 dead transitions. [2021-12-06 21:49:48,187 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 132 transitions, 399 flow [2021-12-06 21:49:48,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 21:49:48,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-12-06 21:49:48,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2021-12-06 21:49:48,189 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8952205882352942 [2021-12-06 21:49:48,189 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 487 transitions. [2021-12-06 21:49:48,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 487 transitions. [2021-12-06 21:49:48,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:49:48,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 487 transitions. [2021-12-06 21:49:48,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 21:49:48,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 136.0) internal successors, (680), 5 states have internal predecessors, (680), 0 states have call successors, (0), 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-12-06 21:49:48,194 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 136.0) internal successors, (680), 5 states have internal predecessors, (680), 0 states have call successors, (0), 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-12-06 21:49:48,194 INFO L186 Difference]: Start difference. First operand has 135 places, 122 transitions, 318 flow. Second operand 4 states and 487 transitions. [2021-12-06 21:49:48,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 132 transitions, 399 flow [2021-12-06 21:49:48,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 132 transitions, 383 flow, removed 3 selfloop flow, removed 7 redundant places. [2021-12-06 21:49:48,198 INFO L242 Difference]: Finished difference. Result has 130 places, 123 transitions, 336 flow [2021-12-06 21:49:48,198 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=336, PETRI_PLACES=130, PETRI_TRANSITIONS=123} [2021-12-06 21:49:48,199 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 9 predicate places. [2021-12-06 21:49:48,199 INFO L470 AbstractCegarLoop]: Abstraction has has 130 places, 123 transitions, 336 flow [2021-12-06 21:49:48,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 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-12-06 21:49:48,200 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:49:48,200 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, 1, 1, 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-12-06 21:49:48,231 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 21:49:48,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:49:48,402 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-06 21:49:48,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:49:48,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1155105201, now seen corresponding path program 1 times [2021-12-06 21:49:48,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:49:48,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657431479] [2021-12-06 21:49:48,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:49:48,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:49:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:49:48,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:49:48,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:49:48,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657431479] [2021-12-06 21:49:48,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657431479] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:49:48,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24182470] [2021-12-06 21:49:48,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:49:48,606 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:49:48,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:49:48,607 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:49:48,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 21:49:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:49:48,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-06 21:49:48,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:49:48,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:49:48,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:49:49,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:49:49,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24182470] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:49:49,133 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:49:49,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2021-12-06 21:49:49,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50300448] [2021-12-06 21:49:49,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:49:49,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-06 21:49:49,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:49:49,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-06 21:49:49,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2021-12-06 21:49:49,137 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 136 [2021-12-06 21:49:49,139 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 123 transitions, 336 flow. Second operand has 19 states, 19 states have (on average 105.63157894736842) internal successors, (2007), 19 states have internal predecessors, (2007), 0 states have call successors, (0), 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-12-06 21:49:49,140 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:49:49,140 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 136 [2021-12-06 21:49:49,140 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:49:49,327 INFO L129 PetriNetUnfolder]: 26/315 cut-off events. [2021-12-06 21:49:49,328 INFO L130 PetriNetUnfolder]: For 221/270 co-relation queries the response was YES. [2021-12-06 21:49:49,329 INFO L84 FinitePrefix]: Finished finitePrefix Result has 579 conditions, 315 events. 26/315 cut-off events. For 221/270 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 924 event pairs, 6 based on Foata normal form. 7/318 useless extension candidates. Maximal degree in co-relation 568. Up to 54 conditions per place. [2021-12-06 21:49:49,330 INFO L132 encePairwiseOnDemand]: 124/136 looper letters, 28 selfloop transitions, 11 changer transitions 6/137 dead transitions. [2021-12-06 21:49:49,330 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 137 transitions, 475 flow [2021-12-06 21:49:49,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 21:49:49,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-06 21:49:49,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1277 transitions. [2021-12-06 21:49:49,335 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7824754901960784 [2021-12-06 21:49:49,335 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1277 transitions. [2021-12-06 21:49:49,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1277 transitions. [2021-12-06 21:49:49,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:49:49,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1277 transitions. [2021-12-06 21:49:49,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 106.41666666666667) internal successors, (1277), 12 states have internal predecessors, (1277), 0 states have call successors, (0), 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-12-06 21:49:49,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 0 states have call successors, (0), 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-12-06 21:49:49,345 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 0 states have call successors, (0), 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-12-06 21:49:49,345 INFO L186 Difference]: Start difference. First operand has 130 places, 123 transitions, 336 flow. Second operand 12 states and 1277 transitions. [2021-12-06 21:49:49,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 137 transitions, 475 flow [2021-12-06 21:49:49,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 137 transitions, 459 flow, removed 8 selfloop flow, removed 1 redundant places. [2021-12-06 21:49:49,349 INFO L242 Difference]: Finished difference. Result has 144 places, 127 transitions, 385 flow [2021-12-06 21:49:49,350 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=385, PETRI_PLACES=144, PETRI_TRANSITIONS=127} [2021-12-06 21:49:49,350 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 23 predicate places. [2021-12-06 21:49:49,350 INFO L470 AbstractCegarLoop]: Abstraction has has 144 places, 127 transitions, 385 flow [2021-12-06 21:49:49,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 105.63157894736842) internal successors, (2007), 19 states have internal predecessors, (2007), 0 states have call successors, (0), 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-12-06 21:49:49,351 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:49:49,351 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-06 21:49:49,383 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-06 21:49:49,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-06 21:49:49,552 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-06 21:49:49,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:49:49,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1901575578, now seen corresponding path program 2 times [2021-12-06 21:49:49,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:49:49,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543236839] [2021-12-06 21:49:49,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:49:49,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:49:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:49:49,930 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:49:49,931 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:49:49,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543236839] [2021-12-06 21:49:49,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543236839] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:49:49,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409828256] [2021-12-06 21:49:49,931 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 21:49:49,931 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:49:49,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:49:49,932 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:49:49,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 21:49:49,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 21:49:49,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 21:49:50,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-06 21:49:50,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:49:50,775 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-12-06 21:49:50,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2021-12-06 21:49:50,807 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:49:50,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:49:50,992 INFO L354 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2021-12-06 21:49:50,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2021-12-06 21:49:51,730 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:49:51,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409828256] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:49:51,730 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:49:51,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 14] total 41 [2021-12-06 21:49:51,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647835211] [2021-12-06 21:49:51,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:49:51,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-06 21:49:51,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:49:51,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-06 21:49:51,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1412, Unknown=0, NotChecked=0, Total=1640 [2021-12-06 21:49:51,737 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 136 [2021-12-06 21:49:51,742 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 127 transitions, 385 flow. Second operand has 41 states, 41 states have (on average 84.97560975609755) internal successors, (3484), 41 states have internal predecessors, (3484), 0 states have call successors, (0), 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-12-06 21:49:51,742 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:49:51,742 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 136 [2021-12-06 21:49:51,742 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:49:53,942 INFO L129 PetriNetUnfolder]: 754/2361 cut-off events. [2021-12-06 21:49:53,942 INFO L130 PetriNetUnfolder]: For 2339/2427 co-relation queries the response was YES. [2021-12-06 21:49:53,949 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5533 conditions, 2361 events. 754/2361 cut-off events. For 2339/2427 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 18524 event pairs, 47 based on Foata normal form. 36/2321 useless extension candidates. Maximal degree in co-relation 5516. Up to 386 conditions per place. [2021-12-06 21:49:53,960 INFO L132 encePairwiseOnDemand]: 111/136 looper letters, 181 selfloop transitions, 109 changer transitions 0/359 dead transitions. [2021-12-06 21:49:53,960 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 359 transitions, 1970 flow [2021-12-06 21:49:53,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-12-06 21:49:53,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2021-12-06 21:49:53,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 3779 transitions. [2021-12-06 21:49:53,970 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.646203830369357 [2021-12-06 21:49:53,970 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 3779 transitions. [2021-12-06 21:49:53,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 3779 transitions. [2021-12-06 21:49:53,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:49:53,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 3779 transitions. [2021-12-06 21:49:53,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 87.88372093023256) internal successors, (3779), 43 states have internal predecessors, (3779), 0 states have call successors, (0), 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-12-06 21:49:53,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 136.0) internal successors, (5984), 44 states have internal predecessors, (5984), 0 states have call successors, (0), 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-12-06 21:49:53,990 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 136.0) internal successors, (5984), 44 states have internal predecessors, (5984), 0 states have call successors, (0), 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-12-06 21:49:53,990 INFO L186 Difference]: Start difference. First operand has 144 places, 127 transitions, 385 flow. Second operand 43 states and 3779 transitions. [2021-12-06 21:49:53,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 359 transitions, 1970 flow [2021-12-06 21:49:53,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 359 transitions, 1887 flow, removed 37 selfloop flow, removed 6 redundant places. [2021-12-06 21:49:54,001 INFO L242 Difference]: Finished difference. Result has 203 places, 230 transitions, 1388 flow [2021-12-06 21:49:54,001 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=1388, PETRI_PLACES=203, PETRI_TRANSITIONS=230} [2021-12-06 21:49:54,002 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 82 predicate places. [2021-12-06 21:49:54,002 INFO L470 AbstractCegarLoop]: Abstraction has has 203 places, 230 transitions, 1388 flow [2021-12-06 21:49:54,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 84.97560975609755) internal successors, (3484), 41 states have internal predecessors, (3484), 0 states have call successors, (0), 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-12-06 21:49:54,004 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:49:54,004 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-06 21:49:54,035 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-06 21:49:54,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:49:54,204 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-06 21:49:54,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:49:54,205 INFO L85 PathProgramCache]: Analyzing trace with hash 202496092, now seen corresponding path program 3 times [2021-12-06 21:49:54,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:49:54,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614951915] [2021-12-06 21:49:54,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:49:54,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:49:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:49:54,568 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:49:54,568 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:49:54,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614951915] [2021-12-06 21:49:54,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614951915] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:49:54,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143703596] [2021-12-06 21:49:54,569 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-06 21:49:54,569 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:49:54,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:49:54,570 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:49:54,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-06 21:49:54,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-06 21:49:54,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 21:49:54,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-06 21:49:54,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:49:54,907 INFO L354 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2021-12-06 21:49:54,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2021-12-06 21:49:54,929 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 21:49:54,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:49:54,970 INFO L354 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2021-12-06 21:49:54,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2021-12-06 21:49:55,124 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 21:49:55,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143703596] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:49:55,124 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:49:55,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 5, 5] total 23 [2021-12-06 21:49:55,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055654706] [2021-12-06 21:49:55,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:49:55,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-06 21:49:55,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:49:55,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-06 21:49:55,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2021-12-06 21:49:55,127 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 136 [2021-12-06 21:49:55,128 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 230 transitions, 1388 flow. Second operand has 23 states, 23 states have (on average 85.73913043478261) internal successors, (1972), 23 states have internal predecessors, (1972), 0 states have call successors, (0), 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-12-06 21:49:55,128 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:49:55,128 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 136 [2021-12-06 21:49:55,128 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:49:56,059 INFO L129 PetriNetUnfolder]: 990/2800 cut-off events. [2021-12-06 21:49:56,059 INFO L130 PetriNetUnfolder]: For 14478/14796 co-relation queries the response was YES. [2021-12-06 21:49:56,088 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9887 conditions, 2800 events. 990/2800 cut-off events. For 14478/14796 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 22601 event pairs, 148 based on Foata normal form. 72/2751 useless extension candidates. Maximal degree in co-relation 9848. Up to 1168 conditions per place. [2021-12-06 21:49:56,104 INFO L132 encePairwiseOnDemand]: 112/136 looper letters, 179 selfloop transitions, 106 changer transitions 0/354 dead transitions. [2021-12-06 21:49:56,104 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 354 transitions, 2895 flow [2021-12-06 21:49:56,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-06 21:49:56,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2021-12-06 21:49:56,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 2433 transitions. [2021-12-06 21:49:56,111 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6389180672268907 [2021-12-06 21:49:56,111 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 2433 transitions. [2021-12-06 21:49:56,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 2433 transitions. [2021-12-06 21:49:56,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:49:56,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 2433 transitions. [2021-12-06 21:49:56,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 86.89285714285714) internal successors, (2433), 28 states have internal predecessors, (2433), 0 states have call successors, (0), 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-12-06 21:49:56,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 136.0) internal successors, (3944), 29 states have internal predecessors, (3944), 0 states have call successors, (0), 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-12-06 21:49:56,124 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 136.0) internal successors, (3944), 29 states have internal predecessors, (3944), 0 states have call successors, (0), 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-12-06 21:49:56,124 INFO L186 Difference]: Start difference. First operand has 203 places, 230 transitions, 1388 flow. Second operand 28 states and 2433 transitions. [2021-12-06 21:49:56,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 354 transitions, 2895 flow [2021-12-06 21:49:56,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 354 transitions, 2662 flow, removed 105 selfloop flow, removed 11 redundant places. [2021-12-06 21:49:56,165 INFO L242 Difference]: Finished difference. Result has 227 places, 288 transitions, 2168 flow [2021-12-06 21:49:56,166 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=1253, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=2168, PETRI_PLACES=227, PETRI_TRANSITIONS=288} [2021-12-06 21:49:56,166 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 106 predicate places. [2021-12-06 21:49:56,166 INFO L470 AbstractCegarLoop]: Abstraction has has 227 places, 288 transitions, 2168 flow [2021-12-06 21:49:56,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 85.73913043478261) internal successors, (1972), 23 states have internal predecessors, (1972), 0 states have call successors, (0), 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-12-06 21:49:56,167 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:49:56,167 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-06 21:49:56,201 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-06 21:49:56,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:49:56,369 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-06 21:49:56,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:49:56,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1195965478, now seen corresponding path program 4 times [2021-12-06 21:49:56,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:49:56,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187257029] [2021-12-06 21:49:56,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:49:56,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:49:56,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:49:56,929 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:49:56,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:49:56,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187257029] [2021-12-06 21:49:56,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187257029] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:49:56,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634606826] [2021-12-06 21:49:56,930 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-06 21:49:56,930 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:49:56,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:49:56,931 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:49:56,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-06 21:49:56,981 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-06 21:49:56,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 21:49:56,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-06 21:49:56,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:49:57,544 INFO L354 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2021-12-06 21:49:57,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2021-12-06 21:49:57,566 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:49:57,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:49:57,652 INFO L354 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2021-12-06 21:49:57,653 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2021-12-06 21:49:58,136 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:49:58,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634606826] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:49:58,137 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:49:58,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14, 14] total 44 [2021-12-06 21:49:58,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406414024] [2021-12-06 21:49:58,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:49:58,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-12-06 21:49:58,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:49:58,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-12-06 21:49:58,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=1609, Unknown=0, NotChecked=0, Total=1892 [2021-12-06 21:49:58,141 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 136 [2021-12-06 21:49:58,143 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 288 transitions, 2168 flow. Second operand has 44 states, 44 states have (on average 67.5909090909091) internal successors, (2974), 44 states have internal predecessors, (2974), 0 states have call successors, (0), 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-12-06 21:49:58,143 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:49:58,143 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 136 [2021-12-06 21:49:58,143 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:49:59,560 INFO L129 PetriNetUnfolder]: 1148/3452 cut-off events. [2021-12-06 21:49:59,560 INFO L130 PetriNetUnfolder]: For 23726/24038 co-relation queries the response was YES. [2021-12-06 21:49:59,576 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13433 conditions, 3452 events. 1148/3452 cut-off events. For 23726/24038 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 30076 event pairs, 96 based on Foata normal form. 169/3560 useless extension candidates. Maximal degree in co-relation 13386. Up to 1104 conditions per place. [2021-12-06 21:49:59,597 INFO L132 encePairwiseOnDemand]: 102/136 looper letters, 174 selfloop transitions, 193 changer transitions 0/422 dead transitions. [2021-12-06 21:49:59,597 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 422 transitions, 4052 flow [2021-12-06 21:49:59,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-12-06 21:49:59,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2021-12-06 21:49:59,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 2620 transitions. [2021-12-06 21:49:59,600 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5069659442724458 [2021-12-06 21:49:59,600 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 2620 transitions. [2021-12-06 21:49:59,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 2620 transitions. [2021-12-06 21:49:59,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:49:59,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 2620 transitions. [2021-12-06 21:49:59,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 68.94736842105263) internal successors, (2620), 38 states have internal predecessors, (2620), 0 states have call successors, (0), 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-12-06 21:49:59,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 136.0) internal successors, (5304), 39 states have internal predecessors, (5304), 0 states have call successors, (0), 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-12-06 21:49:59,612 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 136.0) internal successors, (5304), 39 states have internal predecessors, (5304), 0 states have call successors, (0), 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-12-06 21:49:59,612 INFO L186 Difference]: Start difference. First operand has 227 places, 288 transitions, 2168 flow. Second operand 38 states and 2620 transitions. [2021-12-06 21:49:59,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 422 transitions, 4052 flow [2021-12-06 21:49:59,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 422 transitions, 3979 flow, removed 17 selfloop flow, removed 18 redundant places. [2021-12-06 21:49:59,678 INFO L242 Difference]: Finished difference. Result has 256 places, 366 transitions, 3649 flow [2021-12-06 21:49:59,678 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=2119, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=3649, PETRI_PLACES=256, PETRI_TRANSITIONS=366} [2021-12-06 21:49:59,679 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 135 predicate places. [2021-12-06 21:49:59,679 INFO L470 AbstractCegarLoop]: Abstraction has has 256 places, 366 transitions, 3649 flow [2021-12-06 21:49:59,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 67.5909090909091) internal successors, (2974), 44 states have internal predecessors, (2974), 0 states have call successors, (0), 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-12-06 21:49:59,680 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:49:59,680 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-06 21:49:59,711 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-06 21:49:59,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-12-06 21:49:59,881 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-06 21:49:59,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:49:59,882 INFO L85 PathProgramCache]: Analyzing trace with hash -2014497668, now seen corresponding path program 5 times [2021-12-06 21:49:59,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:49:59,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710281927] [2021-12-06 21:49:59,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:49:59,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:49:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:00,380 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:50:00,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:50:00,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710281927] [2021-12-06 21:50:00,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710281927] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:50:00,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011193489] [2021-12-06 21:50:00,381 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-06 21:50:00,381 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:50:00,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:50:00,382 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:50:00,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-06 21:50:00,434 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-12-06 21:50:00,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 21:50:00,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-06 21:50:00,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:50:01,028 INFO L354 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2021-12-06 21:50:01,029 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2021-12-06 21:50:01,052 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:50:01,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:50:01,137 INFO L354 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2021-12-06 21:50:01,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2021-12-06 21:50:01,620 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:50:01,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011193489] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:50:01,620 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:50:01,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14, 14] total 44 [2021-12-06 21:50:01,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288302273] [2021-12-06 21:50:01,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:50:01,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-12-06 21:50:01,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:50:01,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-12-06 21:50:01,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=1609, Unknown=0, NotChecked=0, Total=1892 [2021-12-06 21:50:01,624 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 136 [2021-12-06 21:50:01,625 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 366 transitions, 3649 flow. Second operand has 44 states, 44 states have (on average 67.5909090909091) internal successors, (2974), 44 states have internal predecessors, (2974), 0 states have call successors, (0), 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-12-06 21:50:01,625 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:50:01,626 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 136 [2021-12-06 21:50:01,626 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:50:03,354 INFO L129 PetriNetUnfolder]: 1418/4126 cut-off events. [2021-12-06 21:50:03,354 INFO L130 PetriNetUnfolder]: For 50610/51173 co-relation queries the response was YES. [2021-12-06 21:50:03,389 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19815 conditions, 4126 events. 1418/4126 cut-off events. For 50610/51173 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 37312 event pairs, 130 based on Foata normal form. 256/4312 useless extension candidates. Maximal degree in co-relation 19758. Up to 1349 conditions per place. [2021-12-06 21:50:03,421 INFO L132 encePairwiseOnDemand]: 102/136 looper letters, 219 selfloop transitions, 272 changer transitions 0/546 dead transitions. [2021-12-06 21:50:03,421 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 546 transitions, 6755 flow [2021-12-06 21:50:03,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-12-06 21:50:03,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2021-12-06 21:50:03,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 2621 transitions. [2021-12-06 21:50:03,424 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5071594427244582 [2021-12-06 21:50:03,424 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 2621 transitions. [2021-12-06 21:50:03,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 2621 transitions. [2021-12-06 21:50:03,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:50:03,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 2621 transitions. [2021-12-06 21:50:03,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 68.97368421052632) internal successors, (2621), 38 states have internal predecessors, (2621), 0 states have call successors, (0), 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-12-06 21:50:03,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 136.0) internal successors, (5304), 39 states have internal predecessors, (5304), 0 states have call successors, (0), 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-12-06 21:50:03,434 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 136.0) internal successors, (5304), 39 states have internal predecessors, (5304), 0 states have call successors, (0), 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-12-06 21:50:03,434 INFO L186 Difference]: Start difference. First operand has 256 places, 366 transitions, 3649 flow. Second operand 38 states and 2621 transitions. [2021-12-06 21:50:03,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 546 transitions, 6755 flow [2021-12-06 21:50:03,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 546 transitions, 6507 flow, removed 93 selfloop flow, removed 22 redundant places. [2021-12-06 21:50:03,566 INFO L242 Difference]: Finished difference. Result has 280 places, 487 transitions, 6173 flow [2021-12-06 21:50:03,566 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=3446, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=166, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=6173, PETRI_PLACES=280, PETRI_TRANSITIONS=487} [2021-12-06 21:50:03,567 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 159 predicate places. [2021-12-06 21:50:03,567 INFO L470 AbstractCegarLoop]: Abstraction has has 280 places, 487 transitions, 6173 flow [2021-12-06 21:50:03,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 67.5909090909091) internal successors, (2974), 44 states have internal predecessors, (2974), 0 states have call successors, (0), 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-12-06 21:50:03,568 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:50:03,568 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-06 21:50:03,588 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-06 21:50:03,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-06 21:50:03,770 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-06 21:50:03,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:50:03,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1651867450, now seen corresponding path program 6 times [2021-12-06 21:50:03,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:50:03,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994200830] [2021-12-06 21:50:03,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:50:03,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:50:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:04,309 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:50:04,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:50:04,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994200830] [2021-12-06 21:50:04,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994200830] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:50:04,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046696877] [2021-12-06 21:50:04,310 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-06 21:50:04,310 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:50:04,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:50:04,311 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:50:04,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-06 21:50:04,368 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-12-06 21:50:04,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 21:50:04,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-06 21:50:04,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:50:04,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2021-12-06 21:50:04,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:50:04,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:50:04,899 INFO L354 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2021-12-06 21:50:04,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2021-12-06 21:50:05,398 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:50:05,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046696877] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:50:05,399 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:50:05,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 14, 14] total 50 [2021-12-06 21:50:05,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098034162] [2021-12-06 21:50:05,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:50:05,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-06 21:50:05,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:50:05,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-06 21:50:05,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=2109, Unknown=0, NotChecked=0, Total=2450 [2021-12-06 21:50:05,403 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 136 [2021-12-06 21:50:05,404 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 487 transitions, 6173 flow. Second operand has 50 states, 50 states have (on average 59.8) internal successors, (2990), 50 states have internal predecessors, (2990), 0 states have call successors, (0), 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-12-06 21:50:05,405 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:50:05,405 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 136 [2021-12-06 21:50:05,405 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:50:13,340 INFO L129 PetriNetUnfolder]: 6124/13128 cut-off events. [2021-12-06 21:50:13,340 INFO L130 PetriNetUnfolder]: For 245021/245151 co-relation queries the response was YES. [2021-12-06 21:50:13,433 INFO L84 FinitePrefix]: Finished finitePrefix Result has 77824 conditions, 13128 events. 6124/13128 cut-off events. For 245021/245151 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 120660 event pairs, 573 based on Foata normal form. 134/13204 useless extension candidates. Maximal degree in co-relation 77758. Up to 2050 conditions per place. [2021-12-06 21:50:13,499 INFO L132 encePairwiseOnDemand]: 104/136 looper letters, 982 selfloop transitions, 775 changer transitions 2/1805 dead transitions. [2021-12-06 21:50:13,499 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 1805 transitions, 27256 flow [2021-12-06 21:50:13,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2021-12-06 21:50:13,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2021-12-06 21:50:13,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 6507 transitions. [2021-12-06 21:50:13,506 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.46907439446366783 [2021-12-06 21:50:13,506 INFO L72 ComplementDD]: Start complementDD. Operand 102 states and 6507 transitions. [2021-12-06 21:50:13,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 6507 transitions. [2021-12-06 21:50:13,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:50:13,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 102 states and 6507 transitions. [2021-12-06 21:50:13,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 103 states, 102 states have (on average 63.794117647058826) internal successors, (6507), 102 states have internal predecessors, (6507), 0 states have call successors, (0), 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-12-06 21:50:13,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 103 states, 103 states have (on average 136.0) internal successors, (14008), 103 states have internal predecessors, (14008), 0 states have call successors, (0), 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-12-06 21:50:13,528 INFO L81 ComplementDD]: Finished complementDD. Result has 103 states, 103 states have (on average 136.0) internal successors, (14008), 103 states have internal predecessors, (14008), 0 states have call successors, (0), 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-12-06 21:50:13,528 INFO L186 Difference]: Start difference. First operand has 280 places, 487 transitions, 6173 flow. Second operand 102 states and 6507 transitions. [2021-12-06 21:50:13,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 1805 transitions, 27256 flow [2021-12-06 21:50:14,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 1805 transitions, 26574 flow, removed 298 selfloop flow, removed 26 redundant places. [2021-12-06 21:50:14,342 INFO L242 Difference]: Finished difference. Result has 396 places, 1059 transitions, 17938 flow [2021-12-06 21:50:14,343 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=6013, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=487, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=251, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=102, PETRI_FLOW=17938, PETRI_PLACES=396, PETRI_TRANSITIONS=1059} [2021-12-06 21:50:14,344 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 275 predicate places. [2021-12-06 21:50:14,344 INFO L470 AbstractCegarLoop]: Abstraction has has 396 places, 1059 transitions, 17938 flow [2021-12-06 21:50:14,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 59.8) internal successors, (2990), 50 states have internal predecessors, (2990), 0 states have call successors, (0), 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-12-06 21:50:14,344 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:50:14,345 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-06 21:50:14,364 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-06 21:50:14,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-06 21:50:14,546 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-06 21:50:14,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:50:14,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1909282104, now seen corresponding path program 7 times [2021-12-06 21:50:14,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:50:14,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363318740] [2021-12-06 21:50:14,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:50:14,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:50:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:14,916 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:50:14,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:50:14,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363318740] [2021-12-06 21:50:14,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363318740] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:50:14,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236781621] [2021-12-06 21:50:14,917 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-06 21:50:14,917 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:50:14,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:50:14,918 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:50:14,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-06 21:50:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:14,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-06 21:50:14,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:50:15,537 INFO L354 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2021-12-06 21:50:15,537 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2021-12-06 21:50:15,558 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:50:15,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:50:15,644 INFO L354 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2021-12-06 21:50:15,644 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2021-12-06 21:50:16,030 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:50:16,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236781621] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:50:16,031 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:50:16,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 14] total 39 [2021-12-06 21:50:16,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949014881] [2021-12-06 21:50:16,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:50:16,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-12-06 21:50:16,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:50:16,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-12-06 21:50:16,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=1150, Unknown=0, NotChecked=0, Total=1482 [2021-12-06 21:50:16,038 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 136 [2021-12-06 21:50:16,040 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 1059 transitions, 17938 flow. Second operand has 39 states, 39 states have (on average 85.0) internal successors, (3315), 39 states have internal predecessors, (3315), 0 states have call successors, (0), 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-12-06 21:50:16,040 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:50:16,040 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 136 [2021-12-06 21:50:16,040 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:50:19,434 INFO L129 PetriNetUnfolder]: 2994/8457 cut-off events. [2021-12-06 21:50:19,434 INFO L130 PetriNetUnfolder]: For 269222/271923 co-relation queries the response was YES. [2021-12-06 21:50:19,521 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60646 conditions, 8457 events. 2994/8457 cut-off events. For 269222/271923 co-relation queries the response was YES. Maximal size of possible extension queue 498. Compared 85461 event pairs, 248 based on Foata normal form. 711/8997 useless extension candidates. Maximal degree in co-relation 60538. Up to 3327 conditions per place. [2021-12-06 21:50:19,576 INFO L132 encePairwiseOnDemand]: 109/136 looper letters, 616 selfloop transitions, 597 changer transitions 0/1304 dead transitions. [2021-12-06 21:50:19,576 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 1304 transitions, 24594 flow [2021-12-06 21:50:19,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-12-06 21:50:19,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2021-12-06 21:50:19,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 2859 transitions. [2021-12-06 21:50:19,580 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6370320855614974 [2021-12-06 21:50:19,580 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 2859 transitions. [2021-12-06 21:50:19,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 2859 transitions. [2021-12-06 21:50:19,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:50:19,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 2859 transitions. [2021-12-06 21:50:19,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 86.63636363636364) internal successors, (2859), 33 states have internal predecessors, (2859), 0 states have call successors, (0), 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-12-06 21:50:19,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 136.0) internal successors, (4624), 34 states have internal predecessors, (4624), 0 states have call successors, (0), 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-12-06 21:50:19,589 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 136.0) internal successors, (4624), 34 states have internal predecessors, (4624), 0 states have call successors, (0), 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-12-06 21:50:19,589 INFO L186 Difference]: Start difference. First operand has 396 places, 1059 transitions, 17938 flow. Second operand 33 states and 2859 transitions. [2021-12-06 21:50:19,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 1304 transitions, 24594 flow [2021-12-06 21:50:20,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 1304 transitions, 22111 flow, removed 1061 selfloop flow, removed 27 redundant places. [2021-12-06 21:50:20,742 INFO L242 Difference]: Finished difference. Result has 406 places, 1197 transitions, 20701 flow [2021-12-06 21:50:20,743 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=15795, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1059, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=461, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=20701, PETRI_PLACES=406, PETRI_TRANSITIONS=1197} [2021-12-06 21:50:20,743 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 285 predicate places. [2021-12-06 21:50:20,743 INFO L470 AbstractCegarLoop]: Abstraction has has 406 places, 1197 transitions, 20701 flow [2021-12-06 21:50:20,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 85.0) internal successors, (3315), 39 states have internal predecessors, (3315), 0 states have call successors, (0), 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-12-06 21:50:20,744 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:50:20,744 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-06 21:50:20,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-06 21:50:20,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-06 21:50:20,946 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-06 21:50:20,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:50:20,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1257502778, now seen corresponding path program 8 times [2021-12-06 21:50:20,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:50:20,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944346797] [2021-12-06 21:50:20,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:50:20,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:50:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:21,491 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:50:21,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:50:21,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944346797] [2021-12-06 21:50:21,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944346797] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:50:21,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382320874] [2021-12-06 21:50:21,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 21:50:21,492 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:50:21,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:50:21,492 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:50:21,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-06 21:50:21,548 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 21:50:21,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 21:50:21,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-06 21:50:21,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:50:21,979 INFO L354 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2021-12-06 21:50:21,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2021-12-06 21:50:21,999 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:50:21,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:50:22,139 INFO L354 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2021-12-06 21:50:22,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2021-12-06 21:50:22,775 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:50:22,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382320874] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:50:22,776 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:50:22,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 14, 14] total 48 [2021-12-06 21:50:22,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833775395] [2021-12-06 21:50:22,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:50:22,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-12-06 21:50:22,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:50:22,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-06 21:50:22,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2039, Unknown=0, NotChecked=0, Total=2256 [2021-12-06 21:50:22,779 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 136 [2021-12-06 21:50:22,781 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 1197 transitions, 20701 flow. Second operand has 48 states, 48 states have (on average 59.916666666666664) internal successors, (2876), 48 states have internal predecessors, (2876), 0 states have call successors, (0), 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-12-06 21:50:22,781 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:50:22,781 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 136 [2021-12-06 21:50:22,781 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:50:30,413 INFO L129 PetriNetUnfolder]: 8121/17419 cut-off events. [2021-12-06 21:50:30,413 INFO L130 PetriNetUnfolder]: For 498851/499184 co-relation queries the response was YES. [2021-12-06 21:50:30,651 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125695 conditions, 17419 events. 8121/17419 cut-off events. For 498851/499184 co-relation queries the response was YES. Maximal size of possible extension queue 880. Compared 169902 event pairs, 1066 based on Foata normal form. 174/17458 useless extension candidates. Maximal degree in co-relation 125587. Up to 9978 conditions per place. [2021-12-06 21:50:30,742 INFO L132 encePairwiseOnDemand]: 104/136 looper letters, 907 selfloop transitions, 953 changer transitions 0/1906 dead transitions. [2021-12-06 21:50:30,742 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 1906 transitions, 37730 flow [2021-12-06 21:50:30,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-12-06 21:50:30,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2021-12-06 21:50:30,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 2411 transitions. [2021-12-06 21:50:30,746 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4545625942684766 [2021-12-06 21:50:30,746 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 2411 transitions. [2021-12-06 21:50:30,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 2411 transitions. [2021-12-06 21:50:30,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:50:30,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 2411 transitions. [2021-12-06 21:50:30,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 61.82051282051282) internal successors, (2411), 39 states have internal predecessors, (2411), 0 states have call successors, (0), 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-12-06 21:50:30,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 136.0) internal successors, (5440), 40 states have internal predecessors, (5440), 0 states have call successors, (0), 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-12-06 21:50:30,757 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 136.0) internal successors, (5440), 40 states have internal predecessors, (5440), 0 states have call successors, (0), 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-12-06 21:50:30,757 INFO L186 Difference]: Start difference. First operand has 406 places, 1197 transitions, 20701 flow. Second operand 39 states and 2411 transitions. [2021-12-06 21:50:30,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 1906 transitions, 37730 flow [2021-12-06 21:50:33,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 1906 transitions, 37362 flow, removed 78 selfloop flow, removed 27 redundant places. [2021-12-06 21:50:33,834 INFO L242 Difference]: Finished difference. Result has 428 places, 1761 transitions, 36443 flow [2021-12-06 21:50:33,835 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=20461, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=506, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=36443, PETRI_PLACES=428, PETRI_TRANSITIONS=1761} [2021-12-06 21:50:33,835 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 307 predicate places. [2021-12-06 21:50:33,835 INFO L470 AbstractCegarLoop]: Abstraction has has 428 places, 1761 transitions, 36443 flow [2021-12-06 21:50:33,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 59.916666666666664) internal successors, (2876), 48 states have internal predecessors, (2876), 0 states have call successors, (0), 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-12-06 21:50:33,836 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:50:33,836 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-06 21:50:33,855 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-06 21:50:34,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-06 21:50:34,038 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-06 21:50:34,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:50:34,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1376020756, now seen corresponding path program 9 times [2021-12-06 21:50:34,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:50:34,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685618504] [2021-12-06 21:50:34,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:50:34,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:50:34,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:34,656 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:50:34,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:50:34,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685618504] [2021-12-06 21:50:34,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685618504] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:50:34,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397978748] [2021-12-06 21:50:34,657 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-06 21:50:34,657 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:50:34,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:50:34,657 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:50:34,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-06 21:50:34,806 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-06 21:50:34,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 21:50:34,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-06 21:50:34,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:50:35,071 INFO L354 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2021-12-06 21:50:35,071 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2021-12-06 21:50:35,094 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 21:50:35,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:50:35,142 INFO L354 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2021-12-06 21:50:35,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2021-12-06 21:50:35,281 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 21:50:35,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397978748] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:50:35,281 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:50:35,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 5, 5] total 25 [2021-12-06 21:50:35,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284576115] [2021-12-06 21:50:35,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:50:35,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-06 21:50:35,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:50:35,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-06 21:50:35,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2021-12-06 21:50:35,284 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 136 [2021-12-06 21:50:35,285 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 1761 transitions, 36443 flow. Second operand has 25 states, 25 states have (on average 68.52) internal successors, (1713), 25 states have internal predecessors, (1713), 0 states have call successors, (0), 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-12-06 21:50:35,285 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:50:35,286 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 136 [2021-12-06 21:50:35,286 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:50:42,991 INFO L129 PetriNetUnfolder]: 5851/14834 cut-off events. [2021-12-06 21:50:42,991 INFO L130 PetriNetUnfolder]: For 554261/556757 co-relation queries the response was YES. [2021-12-06 21:50:43,225 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121034 conditions, 14834 events. 5851/14834 cut-off events. For 554261/556757 co-relation queries the response was YES. Maximal size of possible extension queue 775. Compared 156671 event pairs, 452 based on Foata normal form. 752/15217 useless extension candidates. Maximal degree in co-relation 120918. Up to 5545 conditions per place. [2021-12-06 21:50:43,308 INFO L132 encePairwiseOnDemand]: 106/136 looper letters, 1226 selfloop transitions, 939 changer transitions 0/2255 dead transitions. [2021-12-06 21:50:43,308 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 465 places, 2255 transitions, 51697 flow [2021-12-06 21:50:43,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-12-06 21:50:43,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2021-12-06 21:50:43,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 2600 transitions. [2021-12-06 21:50:43,311 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5030959752321982 [2021-12-06 21:50:43,311 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 2600 transitions. [2021-12-06 21:50:43,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 2600 transitions. [2021-12-06 21:50:43,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:50:43,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 2600 transitions. [2021-12-06 21:50:43,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 68.42105263157895) internal successors, (2600), 38 states have internal predecessors, (2600), 0 states have call successors, (0), 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-12-06 21:50:43,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 136.0) internal successors, (5304), 39 states have internal predecessors, (5304), 0 states have call successors, (0), 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-12-06 21:50:43,319 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 136.0) internal successors, (5304), 39 states have internal predecessors, (5304), 0 states have call successors, (0), 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-12-06 21:50:43,319 INFO L186 Difference]: Start difference. First operand has 428 places, 1761 transitions, 36443 flow. Second operand 38 states and 2600 transitions. [2021-12-06 21:50:43,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 465 places, 2255 transitions, 51697 flow [2021-12-06 21:50:47,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 2255 transitions, 50984 flow, removed 332 selfloop flow, removed 22 redundant places. [2021-12-06 21:50:47,107 INFO L242 Difference]: Finished difference. Result has 451 places, 2062 transitions, 46743 flow [2021-12-06 21:50:47,108 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=35818, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1761, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=661, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1010, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=46743, PETRI_PLACES=451, PETRI_TRANSITIONS=2062} [2021-12-06 21:50:47,109 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 330 predicate places. [2021-12-06 21:50:47,109 INFO L470 AbstractCegarLoop]: Abstraction has has 451 places, 2062 transitions, 46743 flow [2021-12-06 21:50:47,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 68.52) internal successors, (1713), 25 states have internal predecessors, (1713), 0 states have call successors, (0), 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-12-06 21:50:47,109 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:50:47,109 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-06 21:50:47,129 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-12-06 21:50:47,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-06 21:50:47,311 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-06 21:50:47,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:50:47,312 INFO L85 PathProgramCache]: Analyzing trace with hash 338919546, now seen corresponding path program 10 times [2021-12-06 21:50:47,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:50:47,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031710451] [2021-12-06 21:50:47,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:50:47,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:50:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:50:47,709 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:50:47,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:50:47,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031710451] [2021-12-06 21:50:47,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031710451] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:50:47,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459095641] [2021-12-06 21:50:47,710 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-06 21:50:47,710 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:50:47,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:50:47,711 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:50:47,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-06 21:50:47,765 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-06 21:50:47,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 21:50:47,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-06 21:50:47,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:50:48,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2021-12-06 21:50:48,173 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:50:48,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:50:48,261 INFO L354 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2021-12-06 21:50:48,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2021-12-06 21:50:48,752 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:50:48,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459095641] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:50:48,752 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:50:48,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 14] total 42 [2021-12-06 21:50:48,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788021626] [2021-12-06 21:50:48,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:50:48,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-12-06 21:50:48,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:50:48,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-12-06 21:50:48,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=1436, Unknown=0, NotChecked=0, Total=1722 [2021-12-06 21:50:48,756 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 136 [2021-12-06 21:50:48,758 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 2062 transitions, 46743 flow. Second operand has 42 states, 42 states have (on average 84.92857142857143) internal successors, (3567), 42 states have internal predecessors, (3567), 0 states have call successors, (0), 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-12-06 21:50:48,758 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:50:48,758 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 136 [2021-12-06 21:50:48,758 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:50:58,411 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([463] L72-->L65-2: Formula: (not (= |v_thread2Thread1of1ForFork0_~j~0#1_9| 0)) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_9|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_9|} AuxVars[] AssignedVars[][2179], [7147#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 448#(<= ~q_back~0 (+ ~q_front~0 1)), Black: 285#(<= ~q_back~0 ~q_front~0), Black: 1898#(or (< (+ ~q_back~0 1) 0) (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)), Black: 2020#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_back~0 ~q_front~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~q_front~0 ~q_back~0) (= ~q~0.offset 0) (= |ULTIMATE.start_main_#t~ret11#1.offset| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2014#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_back~0 ~q_front~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~q_front~0 ~q_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2048#(and (or (< (+ ~q_back~0 1) 0) (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)) (or (< (+ ~q_back~0 1) 0) (<= ~n~0 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0)) (or (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset))) (and (or (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0)) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)))) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0))), 2115#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 2028#(and (<= ~q_front~0 0) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (or (< (+ ~q_back~0 1) 0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 2018#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_back~0 ~q_front~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~q_front~0 ~q_back~0) (= |ULTIMATE.start_main_#t~ret11#1.offset| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2016#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_back~0 ~q_front~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~q_front~0 ~q_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2050#(and (or (< (+ ~q_back~0 1) 0) (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)) (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 6323#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 2057#(and (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= ~q_front~0 0) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (or (< (+ ~q_back~0 1) 0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 2032#(and (or (< (+ ~q_back~0 1) 0) (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)) (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))) (= ~q~0.offset 0)), Black: 2066#(and (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= ~q_front~0 0) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (or (< (+ ~q_back~0 1) 0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 83#L65-2true, Black: 2026#(and (or (< (+ ~q_back~0 1) 0) (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)) (or (< (+ ~q_back~0 1) 0) (<= ~n~0 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0)) (or (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset))) (and (or (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0)) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0))), Black: 2012#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_back~0 ~q_front~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~q_front~0 ~q_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2040#(and (<= ~q_front~0 0) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (or (< (+ ~q_back~0 1) 0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 3715#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 2006#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_back~0 ~q_front~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~q_front~0 ~q_back~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2042#(and (or (< (+ ~q_back~0 1) 0) (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)) (or (< (+ ~q_back~0 1) 0) (<= ~n~0 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0)) (or (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset))) (and (or (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0)) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 2054#(and (or (< (+ ~q_back~0 1) 0) (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)) (or (< (+ ~q_back~0 1) 0) (<= ~n~0 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< 2 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (or (< (+ ~q_back~0 1) 0) (<= ~n~0 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (< 2 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 2010#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_back~0 ~q_front~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~q_front~0 ~q_back~0) (<= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2038#(and (or (< (+ ~q_back~0 1) 0) (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)) (or (< (+ ~q_back~0 1) 0) (<= ~n~0 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< 2 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (or (< (+ ~q_back~0 1) 0) (<= ~n~0 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (< 2 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0))), Black: 1240#true, Black: 2398#(exists ((v_~q_back~0_88 Int)) (and (<= v_~q_back~0_88 ~q_front~0) (<= ~q_front~0 v_~q_back~0_88) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* v_~q_back~0_88 4))) 1))), Black: 2113#(and (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))) (= ~q~0.offset 0)), Black: 2864#(and (<= ~q_front~0 0) (exists ((v_~q_back~0_88 Int)) (and (<= v_~q_back~0_88 ~q_front~0) (<= ~q_front~0 v_~q_back~0_88) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* v_~q_back~0_88 4))) 1))) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1))), Black: 2114#(and (<= ~q_front~0 0) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 2096#true, 135#true, Black: 2862#(and (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)))) (or (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset))) (and (or (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0)) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)))) (exists ((v_~q_back~0_88 Int)) (and (<= v_~q_back~0_88 ~q_front~0) (<= ~q_front~0 v_~q_back~0_88) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* v_~q_back~0_88 4))) 1))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0))), Black: 2429#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 1218#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 5462#(and (or (and (<= 1 ~N~0) (= ~s~0 0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 5408#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0) (< 2 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (< 2 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0)) (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0))), Black: 5324#(and (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (= ~s~0 0) (or (and (<= 1 ~N~0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)))), 5523#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 5178#(or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)), Black: 5360#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (= ~s~0 0)), Black: 5400#(and (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0)) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (= ~s~0 0)))), Black: 5378#(and (<= ~n~0 2) (< ~q_back~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= 1 ~q_back~0) (= ~q~0.offset 0) (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (= ~s~0 0)))), Black: 5322#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (= ~s~0 0)), Black: 5428#(and (or (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)) (= ~s~0 0)), Black: 5348#(and (or (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset)))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (= ~s~0 0)), Black: 5384#(and (or (and (or (not (= ~s~0 ~N~0)) (<= (+ ~s~0 1) (+ |thread2Thread1of1ForFork0_~j~0#1| ~N~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0)), Black: 5444#(and (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)) (= ~s~0 0) (or (<= 1 ~N~0) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)))), Black: 3676#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0) (< 2 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (< 2 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0)) (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0))), Black: 5420#(and (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~s~0 0)) (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset)))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0))), Black: 5382#(and (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0))), Black: 2875#true, Black: 2895#(and (<= ~q_front~0 0) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 5366#(and (<= ~n~0 2) (or (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (< ~q_back~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= 1 ~q_back~0) (= ~q~0.offset 0) (= ~s~0 0)), Black: 5438#(and (or (not (= ~s~0 ~N~0)) (<= (+ ~s~0 1) (+ |thread2Thread1of1ForFork0_~j~0#1| ~N~0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 3536#(or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)), Black: 5380#(and (or (<= ~n~0 ~q_back~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (<= ~n~0 2) (< ~q_back~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= 1 ~q_back~0) (= ~q~0.offset 0)), Black: 3672#(and (exists ((v_~q_back~0_92 Int)) (and (= (select (select |#memory_int| ~q~0.base) (+ (* v_~q_back~0_92 4) ~q~0.offset)) 1) (< v_~q_back~0_92 1) (<= ~q_front~0 v_~q_back~0_92) (<= 0 v_~q_back~0_92) (<= v_~q_back~0_92 ~q_front~0))) (= ~q~0.offset 0)), Black: 3644#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_back~0 ~q_front~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~q_front~0 ~q_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 5304#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (= ~q~0.offset 0) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5398#(and (or (not (= ~s~0 ~N~0)) (<= (+ ~s~0 1) (+ |thread2Thread1of1ForFork0_~j~0#1| ~N~0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 3304#(not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)), Black: 5344#(and (or (not (= ~s~0 ~N~0)) (<= (+ ~s~0 1) (+ |thread2Thread1of1ForFork0_~j~0#1| ~N~0))) (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)) (= ~s~0 0) (or (<= 1 ~N~0) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)))), Black: 5342#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0)) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0))), Black: 3679#(and (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0))), Black: 5364#(and (<= ~n~0 2) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (= (+ ~q_front~0 1) ~q_back~0) (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset (- 4))) 1) (< ~q_back~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= 1 ~q_back~0) (= ~q~0.offset 0) (= ~s~0 0)), Black: 5424#(and (or (not (= ~s~0 ~N~0)) (<= (+ ~s~0 1) (+ |thread2Thread1of1ForFork0_~j~0#1| ~N~0))) (or (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)) (= ~s~0 0)), Black: 5316#(and (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (or (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset)))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (= ~s~0 0)), Black: 5416#(and (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~s~0 0)) (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset)))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)) (= ~s~0 0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0))), Black: 5374#(and (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~s~0 0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (<= ~n~0 2) (= (+ ~q_front~0 1) ~q_back~0) (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset (- 4))) 1) (< ~q_back~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= 1 ~q_back~0) (= ~q~0.offset 0)), Black: 5306#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (= ~q~0.offset 0) (or (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5450#(and (or (<= ~n~0 ~q_back~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (<= ~n~0 2) (or (and (<= 1 ~N~0) (= ~s~0 0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (< ~q_back~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= 1 ~q_back~0) (= ~q~0.offset 0)), Black: 5370#(and (or (and (or (not (= ~s~0 ~N~0)) (<= (+ ~s~0 1) (+ |thread2Thread1of1ForFork0_~j~0#1| ~N~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0)) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0)), Black: 5406#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0) (< 2 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (< 2 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0)) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0))), Black: 5326#(and (<= ~n~0 2) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (< ~q_back~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= 1 ~q_back~0) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), Black: 5386#(and (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0))), Black: 5442#(and (or (<= ~n~0 ~q_back~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (<= ~n~0 2) (< ~q_back~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= 1 ~q_back~0) (= ~q~0.offset 0) (= ~s~0 0) (or (<= 1 ~N~0) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)))), Black: 5318#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset)))) (= ~q~0.offset 0) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (= ~s~0 0)), Black: 5346#(and (or (not (= ~s~0 ~N~0)) (<= (+ ~s~0 1) (+ |thread2Thread1of1ForFork0_~j~0#1| ~N~0))) (or (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset)))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)) (= ~s~0 0)), Black: 5314#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset)))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (= ~s~0 0)), Black: 5334#(and (or (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (= ~s~0 0)), Black: 5458#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (= ~s~0 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 5410#(and (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~s~0 0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (<= ~n~0 2) (< ~q_back~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= 1 ~q_back~0) (= ~q~0.offset 0) (= ~q_front~0 ~q_back~0)), Black: 5414#(and (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0)) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0))), 2896#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 5310#(and (<= ~n~0 2) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (= (+ ~q_front~0 1) ~q_back~0) (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset (- 4))) 1) (< ~q_back~0 (+ ~n~0 1)) (<= 1 ~q_back~0) (= ~q~0.offset 0) (= ~s~0 0)), Black: 4044#(= |thread2Thread1of1ForFork0_~j~0#1| 1), Black: 3714#(and (<= ~q_front~0 0) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 147#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 4355#(or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)), Black: 5844#(= |thread2Thread1of1ForFork0_~j~0#1| 1), Black: 5505#true, Black: 4123#(not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)), Black: 5935#(not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)), Black: 3694#true, Black: 5951#(or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 155#(<= ~q_back~0 ~q_front~0), Black: 4491#(and (exists ((v_~q_back~0_97 Int)) (and (< v_~q_back~0_97 1) (<= ~q_front~0 v_~q_back~0_97) (<= v_~q_back~0_97 ~q_front~0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* v_~q_back~0_97 4))) 1) (<= 0 v_~q_back~0_97))) (= ~q~0.offset 0)), 117#L47-5true, Black: 164#(and (<= 0 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~s~0 0)), 8724#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= ~q_front~0 ~q_back~0) (or (<= ~q_back~0 ~q_front~0) (< 0 (+ ~q_front~0 1))) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 184#true, 5402#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 6771#(or (<= ~n~0 ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 6532#(and (<= ~n~0 2) (<= ~q_front~0 ~q_back~0)), Black: 6966#(or (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)), Black: 6301#true, 158#true, Black: 7100#(and (<= ~n~0 2) (exists ((v_~q_back~0_112 Int)) (and (= (select (select |#memory_int| ~q~0.base) (+ (* v_~q_back~0_112 4) ~q~0.offset)) 1) (<= ~q_front~0 v_~q_back~0_112) (<= (+ v_~q_back~0_112 1) ~q_back~0))) (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= 1 ~N~0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (= ~s~0 0))) (= ~q~0.offset 0)), Black: 6317#(and (or (and (or (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0)) (or (not (= (+ ~q~0.offset (* 4 ~q_front~0)) 0)) (= ~s~0 0)) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1))) (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset)))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0))), Black: 6618#(and (<= ~n~0 2) (exists ((v_~q_back~0_112 Int)) (and (< (+ v_~q_back~0_112 1) ~n~0) (= (select (select |#memory_int| ~q~0.base) (+ (* v_~q_back~0_112 4) ~q~0.offset)) 1) (<= ~q_front~0 v_~q_back~0_112))) (< 0 ~n~0)), Black: 6602#(and (<= ~n~0 2) (exists ((v_~q_back~0_112 Int)) (and (= (select (select |#memory_int| ~q~0.base) (+ (* v_~q_back~0_112 4) ~q~0.offset)) 1) (<= ~q_front~0 v_~q_back~0_112) (<= (+ v_~q_back~0_112 1) ~q_back~0)))), Black: 1224#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 0)), Black: 6655#(= |thread2Thread1of1ForFork0_~j~0#1| 1), Black: 6734#(or (<= ~n~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 1220#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1226#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), 2052#(and (or (< (+ ~q_back~0 1) 0) (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 110#L93-4true, Black: 7912#(and (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)))) (exists ((v_~q_back~0_117 Int)) (and (<= v_~q_back~0_117 ~q_front~0) (<= ~q_front~0 v_~q_back~0_117) (= (select (select |#memory_int| ~q~0.base) (+ (* v_~q_back~0_117 4) ~q~0.offset)) 1))) (= ~q~0.offset 0)), Black: 7461#(= |thread2Thread1of1ForFork0_~j~0#1| 1), Black: 7915#(and (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)))) (= ~q~0.offset 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 7126#true, Black: 7908#(and (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)))) (exists ((v_~q_back~0_117 Int)) (and (<= v_~q_back~0_117 ~q_front~0) (<= ~q_front~0 v_~q_back~0_117) (= (select (select |#memory_int| ~q~0.base) (+ (* v_~q_back~0_117 4) ~q~0.offset)) 1))) (or (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset))) (and (or (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0)) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0))), Black: 7145#(and (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))) (= ~q~0.offset 0)), Black: 7146#(and (<= ~q_front~0 0) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))]) [2021-12-06 21:50:58,413 INFO L384 tUnfolder$Statistics]: this new event has 119 ancestors and is cut-off event [2021-12-06 21:50:58,414 INFO L387 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2021-12-06 21:50:58,414 INFO L387 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2021-12-06 21:50:58,414 INFO L387 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2021-12-06 21:50:58,414 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([447] L47-5-->L58: Formula: (and (= (ite (= (select (select |v_#memory_int_44| v_~q~0.base_36) (+ v_~q~0.offset_36 (* v_~q_back~0_75 4))) 0) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= v_~q_back~0_74 (+ v_~q_back~0_75 1)) (not (= (ite (and (< v_~q_back~0_75 v_~n~0_37) (<= 0 v_~q_back~0_75)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0))) InVars {#memory_int=|v_#memory_int_44|, ~q_back~0=v_~q_back~0_75, ~q~0.base=v_~q~0.base_36, ~n~0=v_~n~0_37, ~q~0.offset=v_~q~0.offset_36} OutVars{thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_1|, ~q_back~0=v_~q_back~0_74, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_1|, #memory_int=|v_#memory_int_44|, ~q~0.base=v_~q~0.base_36, ~n~0=v_~n~0_37, ~q~0.offset=v_~q~0.offset_36, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, ~q_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][2445], [1898#(or (< (+ ~q_back~0 1) 0) (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)), 2875#true, Black: 448#(<= ~q_back~0 (+ ~q_front~0 1)), Black: 285#(<= ~q_back~0 ~q_front~0), Black: 2020#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_back~0 ~q_front~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~q_front~0 ~q_back~0) (= ~q~0.offset 0) (= |ULTIMATE.start_main_#t~ret11#1.offset| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2014#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_back~0 ~q_front~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~q_front~0 ~q_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2048#(and (or (< (+ ~q_back~0 1) 0) (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)) (or (< (+ ~q_back~0 1) 0) (<= ~n~0 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0)) (or (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset))) (and (or (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0)) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)))) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0))), Black: 2028#(and (<= ~q_front~0 0) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (or (< (+ ~q_back~0 1) 0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 2018#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_back~0 ~q_front~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~q_front~0 ~q_back~0) (= |ULTIMATE.start_main_#t~ret11#1.offset| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2016#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_back~0 ~q_front~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~q_front~0 ~q_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2050#(and (or (< (+ ~q_back~0 1) 0) (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)) (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 2057#(and (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= ~q_front~0 0) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (or (< (+ ~q_back~0 1) 0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 2032#(and (or (< (+ ~q_back~0 1) 0) (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)) (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))) (= ~q~0.offset 0)), Black: 2066#(and (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= ~q_front~0 0) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (or (< (+ ~q_back~0 1) 0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 2052#(and (or (< (+ ~q_back~0 1) 0) (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 2026#(and (or (< (+ ~q_back~0 1) 0) (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)) (or (< (+ ~q_back~0 1) 0) (<= ~n~0 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0)) (or (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset))) (and (or (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0)) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0))), Black: 2012#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_back~0 ~q_front~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~q_front~0 ~q_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2040#(and (<= ~q_front~0 0) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (or (< (+ ~q_back~0 1) 0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 2006#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_back~0 ~q_front~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~q_front~0 ~q_back~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2042#(and (or (< (+ ~q_back~0 1) 0) (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)) (or (< (+ ~q_back~0 1) 0) (<= ~n~0 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0)) (or (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset))) (and (or (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0)) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 2054#(and (or (< (+ ~q_back~0 1) 0) (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)) (or (< (+ ~q_back~0 1) 0) (<= ~n~0 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< 2 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (or (< (+ ~q_back~0 1) 0) (<= ~n~0 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (< 2 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 2010#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_back~0 ~q_front~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~q_front~0 ~q_back~0) (<= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2038#(and (or (< (+ ~q_back~0 1) 0) (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)) (or (< (+ ~q_back~0 1) 0) (<= ~n~0 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< 2 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (or (< (+ ~q_back~0 1) 0) (<= ~n~0 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (< 2 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0))), Black: 1240#true, Black: 2398#(exists ((v_~q_back~0_88 Int)) (and (<= v_~q_back~0_88 ~q_front~0) (<= ~q_front~0 v_~q_back~0_88) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* v_~q_back~0_88 4))) 1))), Black: 2113#(and (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))) (= ~q~0.offset 0)), Black: 2864#(and (<= ~q_front~0 0) (exists ((v_~q_back~0_88 Int)) (and (<= v_~q_back~0_88 ~q_front~0) (<= ~q_front~0 v_~q_back~0_88) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* v_~q_back~0_88 4))) 1))) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1))), Black: 2114#(and (<= ~q_front~0 0) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 2115#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), 135#true, Black: 2862#(and (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)))) (or (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset))) (and (or (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0)) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)))) (exists ((v_~q_back~0_88 Int)) (and (<= v_~q_back~0_88 ~q_front~0) (<= ~q_front~0 v_~q_back~0_88) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* v_~q_back~0_88 4))) 1))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0))), Black: 2429#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 1218#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 7126#true, Black: 5462#(and (or (and (<= 1 ~N~0) (= ~s~0 0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 5408#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0) (< 2 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (< 2 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0)) (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0))), Black: 5324#(and (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (= ~s~0 0) (or (and (<= 1 ~N~0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)))), Black: 5360#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (= ~s~0 0)), Black: 5400#(and (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0)) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (= ~s~0 0)))), Black: 5378#(and (<= ~n~0 2) (< ~q_back~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= 1 ~q_back~0) (= ~q~0.offset 0) (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (= ~s~0 0)))), Black: 5322#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (= ~s~0 0)), Black: 5428#(and (or (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)) (= ~s~0 0)), Black: 5348#(and (or (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset)))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (= ~s~0 0)), Black: 5384#(and (or (and (or (not (= ~s~0 ~N~0)) (<= (+ ~s~0 1) (+ |thread2Thread1of1ForFork0_~j~0#1| ~N~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0)), Black: 5444#(and (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)) (= ~s~0 0) (or (<= 1 ~N~0) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)))), Black: 3676#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0) (< 2 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (< 2 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0)) (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0))), Black: 5420#(and (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~s~0 0)) (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset)))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0))), Black: 5382#(and (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0))), Black: 2895#(and (<= ~q_front~0 0) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 5366#(and (<= ~n~0 2) (or (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (< ~q_back~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= 1 ~q_back~0) (= ~q~0.offset 0) (= ~s~0 0)), Black: 5438#(and (or (not (= ~s~0 ~N~0)) (<= (+ ~s~0 1) (+ |thread2Thread1of1ForFork0_~j~0#1| ~N~0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 3536#(or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)), Black: 5380#(and (or (<= ~n~0 ~q_back~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (<= ~n~0 2) (< ~q_back~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= 1 ~q_back~0) (= ~q~0.offset 0)), Black: 3672#(and (exists ((v_~q_back~0_92 Int)) (and (= (select (select |#memory_int| ~q~0.base) (+ (* v_~q_back~0_92 4) ~q~0.offset)) 1) (< v_~q_back~0_92 1) (<= ~q_front~0 v_~q_back~0_92) (<= 0 v_~q_back~0_92) (<= v_~q_back~0_92 ~q_front~0))) (= ~q~0.offset 0)), Black: 3644#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_back~0 ~q_front~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~q_front~0 ~q_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 5304#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (= ~q~0.offset 0) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5398#(and (or (not (= ~s~0 ~N~0)) (<= (+ ~s~0 1) (+ |thread2Thread1of1ForFork0_~j~0#1| ~N~0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 5505#true, Black: 3304#(not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)), Black: 5344#(and (or (not (= ~s~0 ~N~0)) (<= (+ ~s~0 1) (+ |thread2Thread1of1ForFork0_~j~0#1| ~N~0))) (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)) (= ~s~0 0) (or (<= 1 ~N~0) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)))), 36#L58true, Black: 5342#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0)) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0))), Black: 3679#(and (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0))), Black: 2896#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 5364#(and (<= ~n~0 2) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (= (+ ~q_front~0 1) ~q_back~0) (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset (- 4))) 1) (< ~q_back~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= 1 ~q_back~0) (= ~q~0.offset 0) (= ~s~0 0)), Black: 5424#(and (or (not (= ~s~0 ~N~0)) (<= (+ ~s~0 1) (+ |thread2Thread1of1ForFork0_~j~0#1| ~N~0))) (or (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)) (= ~s~0 0)), Black: 5316#(and (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (or (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset)))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (= ~s~0 0)), Black: 5416#(and (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~s~0 0)) (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset)))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)) (= ~s~0 0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0))), Black: 5374#(and (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~s~0 0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (<= ~n~0 2) (= (+ ~q_front~0 1) ~q_back~0) (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset (- 4))) 1) (< ~q_back~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= 1 ~q_back~0) (= ~q~0.offset 0)), Black: 5306#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (= ~q~0.offset 0) (or (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5450#(and (or (<= ~n~0 ~q_back~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (<= ~n~0 2) (or (and (<= 1 ~N~0) (= ~s~0 0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (< ~q_back~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= 1 ~q_back~0) (= ~q~0.offset 0)), Black: 5370#(and (or (and (or (not (= ~s~0 ~N~0)) (<= (+ ~s~0 1) (+ |thread2Thread1of1ForFork0_~j~0#1| ~N~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0)) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0)), Black: 5406#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0) (< 2 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (< 2 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0)) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0))), Black: 5326#(and (<= ~n~0 2) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (< ~q_back~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= 1 ~q_back~0) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), Black: 5386#(and (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0))), Black: 5442#(and (or (<= ~n~0 ~q_back~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (<= ~n~0 2) (< ~q_back~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= 1 ~q_back~0) (= ~q~0.offset 0) (= ~s~0 0) (or (<= 1 ~N~0) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)))), Black: 5318#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset)))) (= ~q~0.offset 0) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (= ~s~0 0)), Black: 5346#(and (or (not (= ~s~0 ~N~0)) (<= (+ ~s~0 1) (+ |thread2Thread1of1ForFork0_~j~0#1| ~N~0))) (or (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset)))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)) (= ~s~0 0)), Black: 5314#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset)))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (= ~s~0 0)), Black: 5334#(and (or (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (= ~s~0 0)), Black: 5458#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (= ~s~0 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 5410#(and (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~s~0 0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (<= ~n~0 2) (< ~q_back~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= 1 ~q_back~0) (= ~q~0.offset 0) (= ~q_front~0 ~q_back~0)), Black: 5414#(and (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0)) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0))), Black: 5310#(and (<= ~n~0 2) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (= (+ ~q_front~0 1) ~q_back~0) (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset (- 4))) 1) (< ~q_back~0 (+ ~n~0 1)) (<= 1 ~q_back~0) (= ~q~0.offset 0) (= ~s~0 0)), 5178#(or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)), Black: 4044#(= |thread2Thread1of1ForFork0_~j~0#1| 1), Black: 3714#(and (<= ~q_front~0 0) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 147#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 4355#(or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)), Black: 5844#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 67#L72true, Black: 3715#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 5523#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 4123#(not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)), Black: 5935#(not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)), 2096#true, Black: 5951#(or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 155#(<= ~q_back~0 ~q_front~0), Black: 4491#(and (exists ((v_~q_back~0_97 Int)) (and (< v_~q_back~0_97 1) (<= ~q_front~0 v_~q_back~0_97) (<= v_~q_back~0_97 ~q_front~0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* v_~q_back~0_97 4))) 1) (<= 0 v_~q_back~0_97))) (= ~q~0.offset 0)), Black: 164#(and (<= 0 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~s~0 0)), 8724#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= ~q_front~0 ~q_back~0) (or (<= ~q_back~0 ~q_front~0) (< 0 (+ ~q_front~0 1))) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 184#true, Black: 6771#(or (<= ~n~0 ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 6323#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 6532#(and (<= ~n~0 2) (<= ~q_front~0 ~q_back~0)), Black: 6966#(or (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)), 158#true, Black: 7100#(and (<= ~n~0 2) (exists ((v_~q_back~0_112 Int)) (and (= (select (select |#memory_int| ~q~0.base) (+ (* v_~q_back~0_112 4) ~q~0.offset)) 1) (<= ~q_front~0 v_~q_back~0_112) (<= (+ v_~q_back~0_112 1) ~q_back~0))) (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= 1 ~N~0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (= ~s~0 0))) (= ~q~0.offset 0)), Black: 6317#(and (or (and (or (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0)) (or (not (= (+ ~q~0.offset (* 4 ~q_front~0)) 0)) (= ~s~0 0)) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1))) (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset)))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0))), Black: 6618#(and (<= ~n~0 2) (exists ((v_~q_back~0_112 Int)) (and (< (+ v_~q_back~0_112 1) ~n~0) (= (select (select |#memory_int| ~q~0.base) (+ (* v_~q_back~0_112 4) ~q~0.offset)) 1) (<= ~q_front~0 v_~q_back~0_112))) (< 0 ~n~0)), Black: 6602#(and (<= ~n~0 2) (exists ((v_~q_back~0_112 Int)) (and (= (select (select |#memory_int| ~q~0.base) (+ (* v_~q_back~0_112 4) ~q~0.offset)) 1) (<= ~q_front~0 v_~q_back~0_112) (<= (+ v_~q_back~0_112 1) ~q_back~0)))), Black: 1224#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 0)), Black: 6655#(= |thread2Thread1of1ForFork0_~j~0#1| 1), Black: 6734#(or (<= ~n~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 1220#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1226#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), 6301#true, 110#L93-4true, Black: 7912#(and (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)))) (exists ((v_~q_back~0_117 Int)) (and (<= v_~q_back~0_117 ~q_front~0) (<= ~q_front~0 v_~q_back~0_117) (= (select (select |#memory_int| ~q~0.base) (+ (* v_~q_back~0_117 4) ~q~0.offset)) 1))) (= ~q~0.offset 0)), Black: 7461#(= |thread2Thread1of1ForFork0_~j~0#1| 1), Black: 7915#(and (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)))) (= ~q~0.offset 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 7147#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 7908#(and (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)))) (exists ((v_~q_back~0_117 Int)) (and (<= v_~q_back~0_117 ~q_front~0) (<= ~q_front~0 v_~q_back~0_117) (= (select (select |#memory_int| ~q~0.base) (+ (* v_~q_back~0_117 4) ~q~0.offset)) 1))) (or (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset))) (and (or (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0)) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0))), Black: 7145#(and (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))) (= ~q~0.offset 0)), Black: 7146#(and (<= ~q_front~0 0) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 3694#true]) [2021-12-06 21:50:58,415 INFO L384 tUnfolder$Statistics]: this new event has 119 ancestors and is cut-off event [2021-12-06 21:50:58,415 INFO L387 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2021-12-06 21:50:58,415 INFO L387 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2021-12-06 21:50:58,416 INFO L387 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2021-12-06 21:51:00,197 INFO L129 PetriNetUnfolder]: 7946/20210 cut-off events. [2021-12-06 21:51:00,197 INFO L130 PetriNetUnfolder]: For 936084/940071 co-relation queries the response was YES. [2021-12-06 21:51:00,478 INFO L84 FinitePrefix]: Finished finitePrefix Result has 179400 conditions, 20210 events. 7946/20210 cut-off events. For 936084/940071 co-relation queries the response was YES. Maximal size of possible extension queue 926. Compared 222181 event pairs, 679 based on Foata normal form. 1135/20905 useless extension candidates. Maximal degree in co-relation 179276. Up to 3895 conditions per place. [2021-12-06 21:51:00,603 INFO L132 encePairwiseOnDemand]: 111/136 looper letters, 1210 selfloop transitions, 1815 changer transitions 4/3135 dead transitions. [2021-12-06 21:51:00,603 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 486 places, 3135 transitions, 79330 flow [2021-12-06 21:51:00,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-12-06 21:51:00,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2021-12-06 21:51:00,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 3142 transitions. [2021-12-06 21:51:00,607 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.641748366013072 [2021-12-06 21:51:00,607 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 3142 transitions. [2021-12-06 21:51:00,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 3142 transitions. [2021-12-06 21:51:00,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:51:00,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 3142 transitions. [2021-12-06 21:51:00,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 87.27777777777777) internal successors, (3142), 36 states have internal predecessors, (3142), 0 states have call successors, (0), 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-12-06 21:51:00,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 136.0) internal successors, (5032), 37 states have internal predecessors, (5032), 0 states have call successors, (0), 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-12-06 21:51:00,614 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 136.0) internal successors, (5032), 37 states have internal predecessors, (5032), 0 states have call successors, (0), 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-12-06 21:51:00,615 INFO L186 Difference]: Start difference. First operand has 451 places, 2062 transitions, 46743 flow. Second operand 36 states and 3142 transitions. [2021-12-06 21:51:00,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 486 places, 3135 transitions, 79330 flow [2021-12-06 21:51:06,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 3135 transitions, 78985 flow, removed 114 selfloop flow, removed 24 redundant places. [2021-12-06 21:51:06,471 INFO L242 Difference]: Finished difference. Result has 471 places, 2684 transitions, 69944 flow [2021-12-06 21:51:06,473 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=46427, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2061, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1218, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=743, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=69944, PETRI_PLACES=471, PETRI_TRANSITIONS=2684} [2021-12-06 21:51:06,473 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 350 predicate places. [2021-12-06 21:51:06,473 INFO L470 AbstractCegarLoop]: Abstraction has has 471 places, 2684 transitions, 69944 flow [2021-12-06 21:51:06,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 84.92857142857143) internal successors, (3567), 42 states have internal predecessors, (3567), 0 states have call successors, (0), 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-12-06 21:51:06,474 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:51:06,474 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-06 21:51:06,493 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-06 21:51:06,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:51:06,676 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-06 21:51:06,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:51:06,677 INFO L85 PathProgramCache]: Analyzing trace with hash -234540282, now seen corresponding path program 11 times [2021-12-06 21:51:06,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:51:06,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230676514] [2021-12-06 21:51:06,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:51:06,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:51:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:07,220 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:51:07,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:51:07,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230676514] [2021-12-06 21:51:07,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230676514] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:51:07,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781486285] [2021-12-06 21:51:07,220 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-06 21:51:07,221 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:51:07,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:51:07,221 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:51:07,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-06 21:51:07,276 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-12-06 21:51:07,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 21:51:07,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-06 21:51:07,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:51:07,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-06 21:51:07,451 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 21:51:07,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 21:51:08,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-06 21:51:08,234 INFO L354 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2021-12-06 21:51:08,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2021-12-06 21:51:08,265 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:51:08,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:51:08,431 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:51:08,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2021-12-06 21:51:08,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2021-12-06 21:51:09,613 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:51:09,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781486285] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:51:09,613 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:51:09,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21, 21] total 59 [2021-12-06 21:51:09,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907706760] [2021-12-06 21:51:09,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:51:09,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2021-12-06 21:51:09,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:51:09,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2021-12-06 21:51:09,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=3126, Unknown=0, NotChecked=0, Total=3422 [2021-12-06 21:51:09,618 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 136 [2021-12-06 21:51:09,619 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 2684 transitions, 69944 flow. Second operand has 59 states, 59 states have (on average 58.779661016949156) internal successors, (3468), 59 states have internal predecessors, (3468), 0 states have call successors, (0), 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-12-06 21:51:09,620 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:51:09,620 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 136 [2021-12-06 21:51:09,620 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:51:21,553 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([463] L72-->L65-2: Formula: (not (= |v_thread2Thread1of1ForFork0_~j~0#1_9| 0)) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_9|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_9|} AuxVars[] AssignedVars[][2130], [7147#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 448#(<= ~q_back~0 (+ ~q_front~0 1)), Black: 285#(<= ~q_back~0 ~q_front~0), Black: 1898#(or (< (+ ~q_back~0 1) 0) (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)), Black: 2020#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_back~0 ~q_front~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~q_front~0 ~q_back~0) (= ~q~0.offset 0) (= |ULTIMATE.start_main_#t~ret11#1.offset| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2014#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_back~0 ~q_front~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~q_front~0 ~q_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2048#(and (or (< (+ ~q_back~0 1) 0) (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)) (or (< (+ ~q_back~0 1) 0) (<= ~n~0 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0)) (or (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset))) (and (or (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0)) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)))) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0))), 2115#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 2028#(and (<= ~q_front~0 0) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (or (< (+ ~q_back~0 1) 0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 2018#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_back~0 ~q_front~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~q_front~0 ~q_back~0) (= |ULTIMATE.start_main_#t~ret11#1.offset| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2016#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_back~0 ~q_front~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~q_front~0 ~q_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2050#(and (or (< (+ ~q_back~0 1) 0) (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)) (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 6323#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 2057#(and (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= ~q_front~0 0) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (or (< (+ ~q_back~0 1) 0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 8732#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= ~q_front~0 ~q_back~0) (<= ~q_front~0 0) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 8712#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= ~q_front~0 ~q_back~0) (or (<= ~q_back~0 ~q_front~0) (< 0 (+ ~q_front~0 1))) (= ~q~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2032#(and (or (< (+ ~q_back~0 1) 0) (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)) (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))) (= ~q~0.offset 0)), Black: 2066#(and (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= ~q_front~0 0) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (or (< (+ ~q_back~0 1) 0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 8728#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= ~q_front~0 ~q_back~0) (or (<= ~q_back~0 ~q_front~0) (< 0 (+ ~q_front~0 1))) (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 83#L65-2true, Black: 8718#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= ~q_front~0 ~q_back~0) (or (<= ~q_back~0 ~q_front~0) (< 0 (+ ~q_front~0 1))) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (= ~q~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 8736#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= ~q_front~0 ~q_back~0) (<= ~q_front~0 0) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2026#(and (or (< (+ ~q_back~0 1) 0) (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)) (or (< (+ ~q_back~0 1) 0) (<= ~n~0 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0)) (or (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset))) (and (or (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0)) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0))), Black: 8726#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= ~q_front~0 ~q_back~0) (or (<= ~q_back~0 ~q_front~0) (< 0 (+ ~q_front~0 1))) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))) (= ~q~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2012#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_back~0 ~q_front~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~q_front~0 ~q_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2040#(and (<= ~q_front~0 0) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (or (< (+ ~q_back~0 1) 0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 8722#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= ~q_front~0 ~q_back~0) (or (<= ~q_back~0 ~q_front~0) (< 0 (+ ~q_front~0 1))) (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))) (= ~q~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 3715#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 8730#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~q_front~0 ~q_back~0) (or (<= ~q_back~0 ~q_front~0) (< 0 (+ ~q_front~0 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2006#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_back~0 ~q_front~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~q_front~0 ~q_back~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2042#(and (or (< (+ ~q_back~0 1) 0) (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)) (or (< (+ ~q_back~0 1) 0) (<= ~n~0 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0)) (or (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset))) (and (or (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0)) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 2010#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_back~0 ~q_front~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~q_front~0 ~q_back~0) (<= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2038#(and (or (< (+ ~q_back~0 1) 0) (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)) (or (< (+ ~q_back~0 1) 0) (<= ~n~0 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< 2 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (or (< (+ ~q_back~0 1) 0) (<= ~n~0 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (< 2 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0))), Black: 1240#true, Black: 2398#(exists ((v_~q_back~0_88 Int)) (and (<= v_~q_back~0_88 ~q_front~0) (<= ~q_front~0 v_~q_back~0_88) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* v_~q_back~0_88 4))) 1))), Black: 2113#(and (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))) (= ~q~0.offset 0)), Black: 2864#(and (<= ~q_front~0 0) (exists ((v_~q_back~0_88 Int)) (and (<= v_~q_back~0_88 ~q_front~0) (<= ~q_front~0 v_~q_back~0_88) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* v_~q_back~0_88 4))) 1))) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1))), Black: 2114#(and (<= ~q_front~0 0) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 2096#true, 135#true, Black: 2862#(and (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)))) (or (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset))) (and (or (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0)) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)))) (exists ((v_~q_back~0_88 Int)) (and (<= v_~q_back~0_88 ~q_front~0) (<= ~q_front~0 v_~q_back~0_88) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* v_~q_back~0_88 4))) 1))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0))), Black: 2429#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 1218#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 5462#(and (or (and (<= 1 ~N~0) (= ~s~0 0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 5408#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0) (< 2 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (< 2 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0)) (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0))), Black: 5324#(and (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (= ~s~0 0) (or (and (<= 1 ~N~0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)))), 5523#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 5178#(or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)), Black: 5360#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (= ~s~0 0)), Black: 5400#(and (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0)) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (= ~s~0 0)))), Black: 5378#(and (<= ~n~0 2) (< ~q_back~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= 1 ~q_back~0) (= ~q~0.offset 0) (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (= ~s~0 0)))), Black: 5322#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (= ~s~0 0)), Black: 5428#(and (or (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)) (= ~s~0 0)), Black: 5348#(and (or (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset)))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (= ~s~0 0)), Black: 5384#(and (or (and (or (not (= ~s~0 ~N~0)) (<= (+ ~s~0 1) (+ |thread2Thread1of1ForFork0_~j~0#1| ~N~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0)), Black: 5444#(and (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)) (= ~s~0 0) (or (<= 1 ~N~0) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)))), Black: 3676#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0) (< 2 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (< 2 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0)) (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0))), Black: 5420#(and (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~s~0 0)) (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset)))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0))), Black: 5382#(and (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0))), Black: 2875#true, Black: 2895#(and (<= ~q_front~0 0) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 5366#(and (<= ~n~0 2) (or (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (< ~q_back~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= 1 ~q_back~0) (= ~q~0.offset 0) (= ~s~0 0)), Black: 3536#(or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)), Black: 5438#(and (or (not (= ~s~0 ~N~0)) (<= (+ ~s~0 1) (+ |thread2Thread1of1ForFork0_~j~0#1| ~N~0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 5380#(and (or (<= ~n~0 ~q_back~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (<= ~n~0 2) (< ~q_back~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= 1 ~q_back~0) (= ~q~0.offset 0)), Black: 3672#(and (exists ((v_~q_back~0_92 Int)) (and (= (select (select |#memory_int| ~q~0.base) (+ (* v_~q_back~0_92 4) ~q~0.offset)) 1) (< v_~q_back~0_92 1) (<= ~q_front~0 v_~q_back~0_92) (<= 0 v_~q_back~0_92) (<= v_~q_back~0_92 ~q_front~0))) (= ~q~0.offset 0)), Black: 3644#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_back~0 ~q_front~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~q_front~0 ~q_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 5304#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (= ~q~0.offset 0) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5398#(and (or (not (= ~s~0 ~N~0)) (<= (+ ~s~0 1) (+ |thread2Thread1of1ForFork0_~j~0#1| ~N~0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 3304#(not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)), Black: 5344#(and (or (not (= ~s~0 ~N~0)) (<= (+ ~s~0 1) (+ |thread2Thread1of1ForFork0_~j~0#1| ~N~0))) (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)) (= ~s~0 0) (or (<= 1 ~N~0) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)))), Black: 5342#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0)) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0))), Black: 3679#(and (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0))), Black: 5364#(and (<= ~n~0 2) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (= (+ ~q_front~0 1) ~q_back~0) (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset (- 4))) 1) (< ~q_back~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= 1 ~q_back~0) (= ~q~0.offset 0) (= ~s~0 0)), Black: 5424#(and (or (not (= ~s~0 ~N~0)) (<= (+ ~s~0 1) (+ |thread2Thread1of1ForFork0_~j~0#1| ~N~0))) (or (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)) (= ~s~0 0)), Black: 5316#(and (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (or (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset)))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (= ~s~0 0)), Black: 5416#(and (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~s~0 0)) (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset)))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)) (= ~s~0 0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0))), Black: 5374#(and (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~s~0 0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (<= ~n~0 2) (= (+ ~q_front~0 1) ~q_back~0) (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset (- 4))) 1) (< ~q_back~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= 1 ~q_back~0) (= ~q~0.offset 0)), Black: 5306#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (= ~q~0.offset 0) (or (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5450#(and (or (<= ~n~0 ~q_back~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (<= ~n~0 2) (or (and (<= 1 ~N~0) (= ~s~0 0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (< ~q_back~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= 1 ~q_back~0) (= ~q~0.offset 0)), Black: 5370#(and (or (and (or (not (= ~s~0 ~N~0)) (<= (+ ~s~0 1) (+ |thread2Thread1of1ForFork0_~j~0#1| ~N~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0)) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0)), Black: 5406#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0) (< 2 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (< 2 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0)) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0))), Black: 5326#(and (<= ~n~0 2) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (< ~q_back~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= 1 ~q_back~0) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), Black: 5386#(and (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0))), Black: 5442#(and (or (<= ~n~0 ~q_back~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (<= ~n~0 2) (< ~q_back~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= 1 ~q_back~0) (= ~q~0.offset 0) (= ~s~0 0) (or (<= 1 ~N~0) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)))), Black: 5318#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset)))) (= ~q~0.offset 0) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (= ~s~0 0)), Black: 5346#(and (or (not (= ~s~0 ~N~0)) (<= (+ ~s~0 1) (+ |thread2Thread1of1ForFork0_~j~0#1| ~N~0))) (or (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset)))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)) (= ~s~0 0)), Black: 5314#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset)))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (= ~s~0 0)), Black: 5334#(and (or (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (= ~s~0 0)), Black: 5458#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (= ~s~0 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 5410#(and (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~s~0 0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (<= ~n~0 2) (< ~q_back~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= 1 ~q_back~0) (= ~q~0.offset 0) (= ~q_front~0 ~q_back~0)), Black: 5414#(and (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0)) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0))), 2896#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 5310#(and (<= ~n~0 2) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (= (+ ~q_front~0 1) ~q_back~0) (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset (- 4))) 1) (< ~q_back~0 (+ ~n~0 1)) (<= 1 ~q_back~0) (= ~q~0.offset 0) (= ~s~0 0)), Black: 4044#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 8770#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 3714#(and (<= ~q_front~0 0) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 147#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 5844#(= |thread2Thread1of1ForFork0_~j~0#1| 1), Black: 4355#(or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)), Black: 5505#true, Black: 4123#(not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)), Black: 5935#(not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)), Black: 3694#true, Black: 5951#(or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 155#(<= ~q_back~0 ~q_front~0), 117#L47-5true, Black: 164#(and (<= 0 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~s~0 0)), 8724#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= ~q_front~0 ~q_back~0) (or (<= ~q_back~0 ~q_front~0) (< 0 (+ ~q_front~0 1))) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 184#true, 5402#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 6771#(or (<= ~n~0 ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 6532#(and (<= ~n~0 2) (<= ~q_front~0 ~q_back~0)), Black: 6966#(or (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)), 158#true, Black: 6301#true, Black: 7100#(and (<= ~n~0 2) (exists ((v_~q_back~0_112 Int)) (and (= (select (select |#memory_int| ~q~0.base) (+ (* v_~q_back~0_112 4) ~q~0.offset)) 1) (<= ~q_front~0 v_~q_back~0_112) (<= (+ v_~q_back~0_112 1) ~q_back~0))) (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= 1 ~N~0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (= ~s~0 0))) (= ~q~0.offset 0)), Black: 6317#(and (or (and (or (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0)) (or (not (= (+ ~q~0.offset (* 4 ~q_front~0)) 0)) (= ~s~0 0)) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1))) (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset)))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0))), Black: 6618#(and (<= ~n~0 2) (exists ((v_~q_back~0_112 Int)) (and (< (+ v_~q_back~0_112 1) ~n~0) (= (select (select |#memory_int| ~q~0.base) (+ (* v_~q_back~0_112 4) ~q~0.offset)) 1) (<= ~q_front~0 v_~q_back~0_112))) (< 0 ~n~0)), Black: 6602#(and (<= ~n~0 2) (exists ((v_~q_back~0_112 Int)) (and (= (select (select |#memory_int| ~q~0.base) (+ (* v_~q_back~0_112 4) ~q~0.offset)) 1) (<= ~q_front~0 v_~q_back~0_112) (<= (+ v_~q_back~0_112 1) ~q_back~0)))), Black: 1224#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 0)), Black: 6655#(= |thread2Thread1of1ForFork0_~j~0#1| 1), Black: 6734#(or (<= ~n~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 1220#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 1226#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), 2052#(and (or (< (+ ~q_back~0 1) 0) (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 110#L93-4true, Black: 7912#(and (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)))) (exists ((v_~q_back~0_117 Int)) (and (<= v_~q_back~0_117 ~q_front~0) (<= ~q_front~0 v_~q_back~0_117) (= (select (select |#memory_int| ~q~0.base) (+ (* v_~q_back~0_117 4) ~q~0.offset)) 1))) (= ~q~0.offset 0)), Black: 7461#(= |thread2Thread1of1ForFork0_~j~0#1| 1), Black: 7915#(and (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)))) (= ~q~0.offset 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 7126#true, Black: 7908#(and (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)))) (exists ((v_~q_back~0_117 Int)) (and (<= v_~q_back~0_117 ~q_front~0) (<= ~q_front~0 v_~q_back~0_117) (= (select (select |#memory_int| ~q~0.base) (+ (* v_~q_back~0_117 4) ~q~0.offset)) 1))) (or (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset))) (and (or (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0)) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0))), Black: 7145#(and (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))) (= ~q~0.offset 0)), Black: 7146#(and (<= ~q_front~0 0) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))]) [2021-12-06 21:51:21,554 INFO L384 tUnfolder$Statistics]: this new event has 119 ancestors and is cut-off event [2021-12-06 21:51:21,554 INFO L387 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2021-12-06 21:51:21,554 INFO L387 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2021-12-06 21:51:21,554 INFO L387 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2021-12-06 21:51:21,554 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([447] L47-5-->L58: Formula: (and (= (ite (= (select (select |v_#memory_int_44| v_~q~0.base_36) (+ v_~q~0.offset_36 (* v_~q_back~0_75 4))) 0) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= v_~q_back~0_74 (+ v_~q_back~0_75 1)) (not (= (ite (and (< v_~q_back~0_75 v_~n~0_37) (<= 0 v_~q_back~0_75)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0))) InVars {#memory_int=|v_#memory_int_44|, ~q_back~0=v_~q_back~0_75, ~q~0.base=v_~q~0.base_36, ~n~0=v_~n~0_37, ~q~0.offset=v_~q~0.offset_36} OutVars{thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_1|, ~q_back~0=v_~q_back~0_74, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_1|, #memory_int=|v_#memory_int_44|, ~q~0.base=v_~q~0.base_36, ~n~0=v_~n~0_37, ~q~0.offset=v_~q~0.offset_36, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem4#1, ~q_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][1166], [1898#(or (< (+ ~q_back~0 1) 0) (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)), 2875#true, Black: 448#(<= ~q_back~0 (+ ~q_front~0 1)), Black: 285#(<= ~q_back~0 ~q_front~0), Black: 2020#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_back~0 ~q_front~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~q_front~0 ~q_back~0) (= ~q~0.offset 0) (= |ULTIMATE.start_main_#t~ret11#1.offset| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2014#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_back~0 ~q_front~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~q_front~0 ~q_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2048#(and (or (< (+ ~q_back~0 1) 0) (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)) (or (< (+ ~q_back~0 1) 0) (<= ~n~0 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0)) (or (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset))) (and (or (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0)) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)))) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0))), Black: 2028#(and (<= ~q_front~0 0) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (or (< (+ ~q_back~0 1) 0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 2018#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_back~0 ~q_front~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~q_front~0 ~q_back~0) (= |ULTIMATE.start_main_#t~ret11#1.offset| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2016#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_back~0 ~q_front~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~q_front~0 ~q_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2050#(and (or (< (+ ~q_back~0 1) 0) (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)) (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 2057#(and (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= ~q_front~0 0) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (or (< (+ ~q_back~0 1) 0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 8732#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= ~q_front~0 ~q_back~0) (<= ~q_front~0 0) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 8712#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= ~q_front~0 ~q_back~0) (or (<= ~q_back~0 ~q_front~0) (< 0 (+ ~q_front~0 1))) (= ~q~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2032#(and (or (< (+ ~q_back~0 1) 0) (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)) (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))) (= ~q~0.offset 0)), Black: 2066#(and (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= ~q_front~0 0) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (or (< (+ ~q_back~0 1) 0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 8728#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= ~q_front~0 ~q_back~0) (or (<= ~q_back~0 ~q_front~0) (< 0 (+ ~q_front~0 1))) (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2052#(and (or (< (+ ~q_back~0 1) 0) (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 8718#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= ~q_front~0 ~q_back~0) (or (<= ~q_back~0 ~q_front~0) (< 0 (+ ~q_front~0 1))) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (= ~q~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 8736#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= ~q_front~0 ~q_back~0) (<= ~q_front~0 0) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2026#(and (or (< (+ ~q_back~0 1) 0) (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)) (or (< (+ ~q_back~0 1) 0) (<= ~n~0 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0)) (or (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset))) (and (or (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0)) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0))), Black: 8726#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= ~q_front~0 ~q_back~0) (or (<= ~q_back~0 ~q_front~0) (< 0 (+ ~q_front~0 1))) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))) (= ~q~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2012#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_back~0 ~q_front~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~q_front~0 ~q_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2040#(and (<= ~q_front~0 0) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (or (< (+ ~q_back~0 1) 0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 8722#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= ~q_front~0 ~q_back~0) (or (<= ~q_back~0 ~q_front~0) (< 0 (+ ~q_front~0 1))) (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))) (= ~q~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 8730#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~q_front~0 ~q_back~0) (or (<= ~q_back~0 ~q_front~0) (< 0 (+ ~q_front~0 1))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2006#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_back~0 ~q_front~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~q_front~0 ~q_back~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2042#(and (or (< (+ ~q_back~0 1) 0) (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)) (or (< (+ ~q_back~0 1) 0) (<= ~n~0 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0)) (or (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset))) (and (or (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0)) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 2010#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_back~0 ~q_front~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~q_front~0 ~q_back~0) (<= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2038#(and (or (< (+ ~q_back~0 1) 0) (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)) (or (< (+ ~q_back~0 1) 0) (<= ~n~0 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< 2 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (or (< (+ ~q_back~0 1) 0) (<= ~n~0 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (< 2 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0))), Black: 1240#true, Black: 2398#(exists ((v_~q_back~0_88 Int)) (and (<= v_~q_back~0_88 ~q_front~0) (<= ~q_front~0 v_~q_back~0_88) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* v_~q_back~0_88 4))) 1))), Black: 2113#(and (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))) (= ~q~0.offset 0)), Black: 2864#(and (<= ~q_front~0 0) (exists ((v_~q_back~0_88 Int)) (and (<= v_~q_back~0_88 ~q_front~0) (<= ~q_front~0 v_~q_back~0_88) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* v_~q_back~0_88 4))) 1))) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1))), Black: 2114#(and (<= ~q_front~0 0) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 2115#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), 135#true, Black: 2862#(and (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)))) (or (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset))) (and (or (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0)) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)))) (exists ((v_~q_back~0_88 Int)) (and (<= v_~q_back~0_88 ~q_front~0) (<= ~q_front~0 v_~q_back~0_88) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* v_~q_back~0_88 4))) 1))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0))), Black: 2429#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 1218#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 7126#true, Black: 5462#(and (or (and (<= 1 ~N~0) (= ~s~0 0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 5408#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0) (< 2 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (< 2 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0)) (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0))), Black: 5324#(and (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (= ~s~0 0) (or (and (<= 1 ~N~0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)))), Black: 5360#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (= ~s~0 0)), Black: 5400#(and (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0)) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (= ~s~0 0)))), Black: 5378#(and (<= ~n~0 2) (< ~q_back~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= 1 ~q_back~0) (= ~q~0.offset 0) (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (= ~s~0 0)))), Black: 5322#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (= ~s~0 0)), Black: 5428#(and (or (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)) (= ~s~0 0)), Black: 5348#(and (or (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset)))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (= ~s~0 0)), Black: 5384#(and (or (and (or (not (= ~s~0 ~N~0)) (<= (+ ~s~0 1) (+ |thread2Thread1of1ForFork0_~j~0#1| ~N~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0)), Black: 5444#(and (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)) (= ~s~0 0) (or (<= 1 ~N~0) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)))), Black: 3676#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0) (< 2 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (< 2 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0)) (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0))), Black: 5420#(and (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~s~0 0)) (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset)))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0))), Black: 5382#(and (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0))), Black: 2895#(and (<= ~q_front~0 0) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 5366#(and (<= ~n~0 2) (or (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (< ~q_back~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= 1 ~q_back~0) (= ~q~0.offset 0) (= ~s~0 0)), Black: 3536#(or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)), Black: 5438#(and (or (not (= ~s~0 ~N~0)) (<= (+ ~s~0 1) (+ |thread2Thread1of1ForFork0_~j~0#1| ~N~0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 5380#(and (or (<= ~n~0 ~q_back~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (<= ~n~0 2) (< ~q_back~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= 1 ~q_back~0) (= ~q~0.offset 0)), Black: 3672#(and (exists ((v_~q_back~0_92 Int)) (and (= (select (select |#memory_int| ~q~0.base) (+ (* v_~q_back~0_92 4) ~q~0.offset)) 1) (< v_~q_back~0_92 1) (<= ~q_front~0 v_~q_back~0_92) (<= 0 v_~q_back~0_92) (<= v_~q_back~0_92 ~q_front~0))) (= ~q~0.offset 0)), Black: 3644#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~q_back~0 ~q_front~0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~q_front~0 ~q_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 5304#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (= ~q~0.offset 0) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5398#(and (or (not (= ~s~0 ~N~0)) (<= (+ ~s~0 1) (+ |thread2Thread1of1ForFork0_~j~0#1| ~N~0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 5505#true, Black: 3304#(not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)), Black: 5344#(and (or (not (= ~s~0 ~N~0)) (<= (+ ~s~0 1) (+ |thread2Thread1of1ForFork0_~j~0#1| ~N~0))) (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)) (= ~s~0 0) (or (<= 1 ~N~0) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)))), 36#L58true, Black: 5342#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0)) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0))), Black: 3679#(and (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0))), Black: 2896#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 5364#(and (<= ~n~0 2) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (= (+ ~q_front~0 1) ~q_back~0) (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset (- 4))) 1) (< ~q_back~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= 1 ~q_back~0) (= ~q~0.offset 0) (= ~s~0 0)), Black: 5424#(and (or (not (= ~s~0 ~N~0)) (<= (+ ~s~0 1) (+ |thread2Thread1of1ForFork0_~j~0#1| ~N~0))) (or (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)) (= ~s~0 0)), Black: 5316#(and (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (or (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset)))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (= ~s~0 0)), Black: 5416#(and (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~s~0 0)) (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset)))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)) (= ~s~0 0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0))), Black: 5374#(and (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~s~0 0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (<= ~n~0 2) (= (+ ~q_front~0 1) ~q_back~0) (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset (- 4))) 1) (< ~q_back~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= 1 ~q_back~0) (= ~q~0.offset 0)), Black: 5306#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= (+ ~n~0 ~q_front~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~q_back~0)) (= ~q~0.offset 0) (or (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~q_front~0 ~q_back~0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5450#(and (or (<= ~n~0 ~q_back~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (<= ~n~0 2) (or (and (<= 1 ~N~0) (= ~s~0 0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (< ~q_back~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= 1 ~q_back~0) (= ~q~0.offset 0)), Black: 5370#(and (or (and (or (not (= ~s~0 ~N~0)) (<= (+ ~s~0 1) (+ |thread2Thread1of1ForFork0_~j~0#1| ~N~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0)) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0)), Black: 5406#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0) (< 2 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (< 2 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0)) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0))), Black: 5326#(and (<= ~n~0 2) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (< ~q_back~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= 1 ~q_back~0) (= ~q~0.offset 0) (= ~s~0 0) (= ~q_front~0 ~q_back~0)), Black: 5386#(and (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0))), Black: 5442#(and (or (<= ~n~0 ~q_back~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (<= ~n~0 2) (< ~q_back~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= 1 ~q_back~0) (= ~q~0.offset 0) (= ~s~0 0) (or (<= 1 ~N~0) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)))), Black: 5318#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset)))) (= ~q~0.offset 0) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (= ~s~0 0)), Black: 5346#(and (or (not (= ~s~0 ~N~0)) (<= (+ ~s~0 1) (+ |thread2Thread1of1ForFork0_~j~0#1| ~N~0))) (or (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset)))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)) (= ~s~0 0)), Black: 5314#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset)))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0)) (= ~s~0 0)), Black: 5334#(and (or (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1))) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (= ~s~0 0)), Black: 5458#(and (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)) (= ~q~0.offset 0) (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 1) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (= ~s~0 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 5410#(and (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~s~0 0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (<= ~n~0 2) (< ~q_back~0 (+ ~n~0 1)) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (<= 1 ~q_back~0) (= ~q~0.offset 0) (= ~q_front~0 ~q_back~0)), Black: 5414#(and (or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0)) (or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0))), Black: 5310#(and (<= ~n~0 2) (or (and (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)) (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3))) (= (+ ~q_front~0 1) ~q_back~0) (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset (- 4))) 1) (< ~q_back~0 (+ ~n~0 1)) (<= 1 ~q_back~0) (= ~q~0.offset 0) (= ~s~0 0)), 5178#(or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)), Black: 4044#(= |thread2Thread1of1ForFork0_~j~0#1| 1), Black: 3714#(and (<= ~q_front~0 0) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 147#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 67#L72true, Black: 5844#(= |thread2Thread1of1ForFork0_~j~0#1| 1), Black: 4355#(or (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_back~0 0)), Black: 3715#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 5523#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 4123#(not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)), Black: 5935#(not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)), 2096#true, Black: 5951#(or (<= ~n~0 ~q_back~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 155#(<= ~q_back~0 ~q_front~0), 8747#true, Black: 164#(and (<= 0 ~N~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~s~0 0)), 8724#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 2) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (<= ~q_front~0 ~q_back~0) (or (<= ~q_back~0 ~q_front~0) (< 0 (+ ~q_front~0 1))) (= ~q~0.offset 0) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 184#true, Black: 6771#(or (<= ~n~0 ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 6323#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 6532#(and (<= ~n~0 2) (<= ~q_front~0 ~q_back~0)), Black: 6966#(or (<= 2 ~q_front~0) (= (* 4 ~q_back~0) (* 4 ~q_front~0)) (<= 1 ~q_back~0) (< ~q_front~0 0)), 158#true, Black: 7100#(and (<= ~n~0 2) (exists ((v_~q_back~0_112 Int)) (and (= (select (select |#memory_int| ~q~0.base) (+ (* v_~q_back~0_112 4) ~q~0.offset)) 1) (<= ~q_front~0 v_~q_back~0_112) (<= (+ v_~q_back~0_112 1) ~q_back~0))) (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= 1 ~N~0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (= ~s~0 0))) (= ~q~0.offset 0)), Black: 6317#(and (or (and (or (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0)) (or (not (= (+ ~q~0.offset (* 4 ~q_front~0)) 0)) (= ~s~0 0)) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1))) (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset)))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0))), Black: 6618#(and (<= ~n~0 2) (exists ((v_~q_back~0_112 Int)) (and (< (+ v_~q_back~0_112 1) ~n~0) (= (select (select |#memory_int| ~q~0.base) (+ (* v_~q_back~0_112 4) ~q~0.offset)) 1) (<= ~q_front~0 v_~q_back~0_112))) (< 0 ~n~0)), Black: 6602#(and (<= ~n~0 2) (exists ((v_~q_back~0_112 Int)) (and (= (select (select |#memory_int| ~q~0.base) (+ (* v_~q_back~0_112 4) ~q~0.offset)) 1) (<= ~q_front~0 v_~q_back~0_112) (<= (+ v_~q_back~0_112 1) ~q_back~0)))), Black: 1224#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post19#1| 0)), Black: 6655#(= |thread2Thread1of1ForFork0_~j~0#1| 1), Black: 6734#(or (<= ~n~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 1220#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 6301#true, Black: 1226#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)), 110#L93-4true, Black: 7912#(and (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)))) (exists ((v_~q_back~0_117 Int)) (and (<= v_~q_back~0_117 ~q_front~0) (<= ~q_front~0 v_~q_back~0_117) (= (select (select |#memory_int| ~q~0.base) (+ (* v_~q_back~0_117 4) ~q~0.offset)) 1))) (= ~q~0.offset 0)), Black: 7461#(= |thread2Thread1of1ForFork0_~j~0#1| 1), Black: 7915#(and (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)))) (= ~q~0.offset 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), Black: 7147#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 7908#(and (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)))) (exists ((v_~q_back~0_117 Int)) (and (<= v_~q_back~0_117 ~q_front~0) (<= ~q_front~0 v_~q_back~0_117) (= (select (select |#memory_int| ~q~0.base) (+ (* v_~q_back~0_117 4) ~q~0.offset)) 1))) (or (not (= 0 (+ (* 4 ~q_back~0) ~q~0.offset))) (and (or (<= (+ ~n~0 ~q_front~0) (+ 2 ~q_back~0)) (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0)) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)))) (= ~q~0.offset 0) (or (<= ~n~0 2) (<= (+ (* 4 ~q_back~0) ~q~0.offset) 0))), Black: 7145#(and (or (<= (* 4 ~n~0) (+ (* 4 ~q_back~0) ~q~0.offset 3)) (and (<= (+ ~q~0.offset (* 4 ~q_front~0)) 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))) (= ~q~0.offset 0)), Black: 7146#(and (<= ~q_front~0 0) (= ~q~0.offset 0) (< 0 (+ ~q~0.offset (* 4 ~q_front~0) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 3694#true]) [2021-12-06 21:51:21,554 INFO L384 tUnfolder$Statistics]: this new event has 119 ancestors and is cut-off event [2021-12-06 21:51:21,554 INFO L387 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2021-12-06 21:51:21,554 INFO L387 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2021-12-06 21:51:21,554 INFO L387 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2021-12-06 21:51:23,727 INFO L129 PetriNetUnfolder]: 8051/20381 cut-off events. [2021-12-06 21:51:23,727 INFO L130 PetriNetUnfolder]: For 1112335/1116524 co-relation queries the response was YES. [2021-12-06 21:51:24,083 INFO L84 FinitePrefix]: Finished finitePrefix Result has 191609 conditions, 20381 events. 8051/20381 cut-off events. For 1112335/1116524 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 224075 event pairs, 628 based on Foata normal form. 1501/21371 useless extension candidates. Maximal degree in co-relation 191477. Up to 7689 conditions per place. [2021-12-06 21:51:24,219 INFO L132 encePairwiseOnDemand]: 102/136 looper letters, 1348 selfloop transitions, 1467 changer transitions 0/2900 dead transitions. [2021-12-06 21:51:24,219 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 513 places, 2900 transitions, 79869 flow [2021-12-06 21:51:24,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-12-06 21:51:24,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2021-12-06 21:51:24,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 2591 transitions. [2021-12-06 21:51:24,222 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4430574555403557 [2021-12-06 21:51:24,222 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 2591 transitions. [2021-12-06 21:51:24,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 2591 transitions. [2021-12-06 21:51:24,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:51:24,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 2591 transitions. [2021-12-06 21:51:24,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 60.25581395348837) internal successors, (2591), 43 states have internal predecessors, (2591), 0 states have call successors, (0), 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-12-06 21:51:24,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 136.0) internal successors, (5984), 44 states have internal predecessors, (5984), 0 states have call successors, (0), 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-12-06 21:51:24,229 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 136.0) internal successors, (5984), 44 states have internal predecessors, (5984), 0 states have call successors, (0), 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-12-06 21:51:24,229 INFO L186 Difference]: Start difference. First operand has 471 places, 2684 transitions, 69944 flow. Second operand 43 states and 2591 transitions. [2021-12-06 21:51:24,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 513 places, 2900 transitions, 79869 flow [2021-12-06 21:51:31,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 490 places, 2900 transitions, 78804 flow, removed 481 selfloop flow, removed 23 redundant places. [2021-12-06 21:51:31,397 INFO L242 Difference]: Finished difference. Result has 498 places, 2792 transitions, 77178 flow [2021-12-06 21:51:31,399 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=68923, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1367, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=77178, PETRI_PLACES=498, PETRI_TRANSITIONS=2792} [2021-12-06 21:51:31,399 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 377 predicate places. [2021-12-06 21:51:31,399 INFO L470 AbstractCegarLoop]: Abstraction has has 498 places, 2792 transitions, 77178 flow [2021-12-06 21:51:31,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 58.779661016949156) internal successors, (3468), 59 states have internal predecessors, (3468), 0 states have call successors, (0), 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-12-06 21:51:31,400 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:51:31,400 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-06 21:51:31,427 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-12-06 21:51:31,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-06 21:51:31,602 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-06 21:51:31,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:51:31,603 INFO L85 PathProgramCache]: Analyzing trace with hash 2010138052, now seen corresponding path program 12 times [2021-12-06 21:51:31,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:51:31,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028745574] [2021-12-06 21:51:31,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:51:31,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:51:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:51:32,601 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:51:32,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:51:32,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028745574] [2021-12-06 21:51:32,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028745574] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:51:32,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681525984] [2021-12-06 21:51:32,601 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-06 21:51:32,601 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:51:32,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:51:32,602 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:51:32,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-06 21:51:32,660 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-12-06 21:51:32,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 21:51:32,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 39 conjunts are in the unsatisfiable core [2021-12-06 21:51:32,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:51:33,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:51:33,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-06 21:51:33,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2021-12-06 21:51:33,546 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:51:33,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:51:33,855 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:51:33,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2021-12-06 21:51:33,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2021-12-06 21:51:34,921 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:51:34,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681525984] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:51:34,921 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:51:34,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 21, 21] total 68 [2021-12-06 21:51:34,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139101320] [2021-12-06 21:51:34,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:51:34,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2021-12-06 21:51:34,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:51:34,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2021-12-06 21:51:34,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=4252, Unknown=0, NotChecked=0, Total=4556 [2021-12-06 21:51:34,926 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 136 [2021-12-06 21:51:34,928 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 498 places, 2792 transitions, 77178 flow. Second operand has 68 states, 68 states have (on average 49.970588235294116) internal successors, (3398), 68 states have internal predecessors, (3398), 0 states have call successors, (0), 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-12-06 21:51:34,928 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:51:34,928 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 136 [2021-12-06 21:51:34,928 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:52:28,073 INFO L129 PetriNetUnfolder]: 26470/55014 cut-off events. [2021-12-06 21:52:28,073 INFO L130 PetriNetUnfolder]: For 3719645/3720604 co-relation queries the response was YES. [2021-12-06 21:52:29,253 INFO L84 FinitePrefix]: Finished finitePrefix Result has 591809 conditions, 55014 events. 26470/55014 cut-off events. For 3719645/3720604 co-relation queries the response was YES. Maximal size of possible extension queue 2070. Compared 598905 event pairs, 3336 based on Foata normal form. 926/55753 useless extension candidates. Maximal degree in co-relation 591671. Up to 11672 conditions per place. [2021-12-06 21:52:29,676 INFO L132 encePairwiseOnDemand]: 105/136 looper letters, 2586 selfloop transitions, 3811 changer transitions 0/6437 dead transitions. [2021-12-06 21:52:29,677 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 6437 transitions, 193713 flow [2021-12-06 21:52:29,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2021-12-06 21:52:29,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2021-12-06 21:52:29,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 3762 transitions. [2021-12-06 21:52:29,681 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4008951406649616 [2021-12-06 21:52:29,681 INFO L72 ComplementDD]: Start complementDD. Operand 69 states and 3762 transitions. [2021-12-06 21:52:29,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 3762 transitions. [2021-12-06 21:52:29,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:52:29,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 69 states and 3762 transitions. [2021-12-06 21:52:29,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 70 states, 69 states have (on average 54.52173913043478) internal successors, (3762), 69 states have internal predecessors, (3762), 0 states have call successors, (0), 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-12-06 21:52:29,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 70 states, 70 states have (on average 136.0) internal successors, (9520), 70 states have internal predecessors, (9520), 0 states have call successors, (0), 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-12-06 21:52:29,692 INFO L81 ComplementDD]: Finished complementDD. Result has 70 states, 70 states have (on average 136.0) internal successors, (9520), 70 states have internal predecessors, (9520), 0 states have call successors, (0), 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-12-06 21:52:29,692 INFO L186 Difference]: Start difference. First operand has 498 places, 2792 transitions, 77178 flow. Second operand 69 states and 3762 transitions. [2021-12-06 21:52:29,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 6437 transitions, 193713 flow [2021-12-06 21:52:59,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 527 places, 6437 transitions, 193005 flow, removed 223 selfloop flow, removed 37 redundant places. [2021-12-06 21:52:59,456 INFO L242 Difference]: Finished difference. Result has 554 places, 4970 transitions, 162185 flow [2021-12-06 21:52:59,458 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=76635, PETRI_DIFFERENCE_MINUEND_PLACES=459, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2786, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1761, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=659, PETRI_DIFFERENCE_SUBTRAHEND_STATES=69, PETRI_FLOW=162185, PETRI_PLACES=554, PETRI_TRANSITIONS=4970} [2021-12-06 21:52:59,459 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 433 predicate places. [2021-12-06 21:52:59,459 INFO L470 AbstractCegarLoop]: Abstraction has has 554 places, 4970 transitions, 162185 flow [2021-12-06 21:52:59,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 49.970588235294116) internal successors, (3398), 68 states have internal predecessors, (3398), 0 states have call successors, (0), 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-12-06 21:52:59,459 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:52:59,459 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:52:59,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-06 21:52:59,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-06 21:52:59,660 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-06 21:52:59,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:52:59,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1608812230, now seen corresponding path program 1 times [2021-12-06 21:52:59,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:52:59,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699717632] [2021-12-06 21:52:59,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:52:59,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:52:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:53:00,351 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:53:00,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:53:00,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699717632] [2021-12-06 21:53:00,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699717632] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:53:00,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929730363] [2021-12-06 21:53:00,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:53:00,352 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:53:00,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:53:00,352 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:53:00,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-06 21:53:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:53:00,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 46 conjunts are in the unsatisfiable core [2021-12-06 21:53:00,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:53:01,418 INFO L354 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2021-12-06 21:53:01,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2021-12-06 21:53:01,564 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:53:01,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:53:01,922 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:53:01,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 35 [2021-12-06 21:53:02,833 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:53:02,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929730363] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:53:02,834 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:53:02,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 25, 25] total 69 [2021-12-06 21:53:02,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878060173] [2021-12-06 21:53:02,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:53:02,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2021-12-06 21:53:02,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:53:02,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2021-12-06 21:53:02,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=510, Invalid=4182, Unknown=0, NotChecked=0, Total=4692 [2021-12-06 21:53:02,839 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 136 [2021-12-06 21:53:02,841 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 4970 transitions, 162185 flow. Second operand has 69 states, 69 states have (on average 57.768115942028984) internal successors, (3986), 69 states have internal predecessors, (3986), 0 states have call successors, (0), 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-12-06 21:53:02,841 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:53:02,841 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 136 [2021-12-06 21:53:02,841 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:55:06,896 INFO L129 PetriNetUnfolder]: 37362/74915 cut-off events. [2021-12-06 21:55:06,896 INFO L130 PetriNetUnfolder]: For 6076240/6077294 co-relation queries the response was YES. [2021-12-06 21:55:08,950 INFO L84 FinitePrefix]: Finished finitePrefix Result has 869551 conditions, 74915 events. 37362/74915 cut-off events. For 6076240/6077294 co-relation queries the response was YES. Maximal size of possible extension queue 2672. Compared 820762 event pairs, 3360 based on Foata normal form. 753/75435 useless extension candidates. Maximal degree in co-relation 869391. Up to 41397 conditions per place. [2021-12-06 21:55:09,556 INFO L132 encePairwiseOnDemand]: 99/136 looper letters, 2544 selfloop transitions, 5891 changer transitions 20/8500 dead transitions. [2021-12-06 21:55:09,556 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 621 places, 8500 transitions, 300221 flow [2021-12-06 21:55:09,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2021-12-06 21:55:09,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2021-12-06 21:55:09,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 4084 transitions. [2021-12-06 21:55:09,560 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4416089965397924 [2021-12-06 21:55:09,560 INFO L72 ComplementDD]: Start complementDD. Operand 68 states and 4084 transitions. [2021-12-06 21:55:09,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 4084 transitions. [2021-12-06 21:55:09,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:55:09,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 68 states and 4084 transitions. [2021-12-06 21:55:09,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 69 states, 68 states have (on average 60.05882352941177) internal successors, (4084), 68 states have internal predecessors, (4084), 0 states have call successors, (0), 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-12-06 21:55:09,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 69 states, 69 states have (on average 136.0) internal successors, (9384), 69 states have internal predecessors, (9384), 0 states have call successors, (0), 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-12-06 21:55:09,573 INFO L81 ComplementDD]: Finished complementDD. Result has 69 states, 69 states have (on average 136.0) internal successors, (9384), 69 states have internal predecessors, (9384), 0 states have call successors, (0), 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-12-06 21:55:09,573 INFO L186 Difference]: Start difference. First operand has 554 places, 4970 transitions, 162185 flow. Second operand 68 states and 4084 transitions. [2021-12-06 21:55:09,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 621 places, 8500 transitions, 300221 flow [2021-12-06 21:56:37,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 591 places, 8500 transitions, 297066 flow, removed 1546 selfloop flow, removed 30 redundant places. [2021-12-06 21:56:38,169 INFO L242 Difference]: Finished difference. Result has 615 places, 8174 transitions, 298528 flow [2021-12-06 21:56:38,173 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=159897, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4970, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=68, PETRI_FLOW=298528, PETRI_PLACES=615, PETRI_TRANSITIONS=8174} [2021-12-06 21:56:38,173 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 494 predicate places. [2021-12-06 21:56:38,173 INFO L470 AbstractCegarLoop]: Abstraction has has 615 places, 8174 transitions, 298528 flow [2021-12-06 21:56:38,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 57.768115942028984) internal successors, (3986), 69 states have internal predecessors, (3986), 0 states have call successors, (0), 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-12-06 21:56:38,174 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:56:38,174 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:56:38,194 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-06 21:56:38,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-06 21:56:38,376 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-06 21:56:38,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:56:38,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1703218942, now seen corresponding path program 2 times [2021-12-06 21:56:38,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:56:38,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870453917] [2021-12-06 21:56:38,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:56:38,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:56:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:56:39,072 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:56:39,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:56:39,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870453917] [2021-12-06 21:56:39,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870453917] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:56:39,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110435782] [2021-12-06 21:56:39,072 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 21:56:39,072 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:56:39,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:56:39,073 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:56:39,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-06 21:56:39,134 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 21:56:39,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 21:56:39,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-06 21:56:39,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:56:39,941 INFO L354 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2021-12-06 21:56:39,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2021-12-06 21:56:40,125 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:56:40,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:56:40,440 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 21:56:40,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 32 [2021-12-06 21:56:41,459 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:56:41,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110435782] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 21:56:41,459 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 21:56:41,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 24, 24] total 67 [2021-12-06 21:56:41,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318151397] [2021-12-06 21:56:41,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 21:56:41,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2021-12-06 21:56:41,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:56:41,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2021-12-06 21:56:41,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=3982, Unknown=0, NotChecked=0, Total=4422 [2021-12-06 21:56:41,466 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 136 [2021-12-06 21:56:41,469 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 615 places, 8174 transitions, 298528 flow. Second operand has 67 states, 67 states have (on average 57.83582089552239) internal successors, (3875), 67 states have internal predecessors, (3875), 0 states have call successors, (0), 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-12-06 21:56:41,469 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:56:41,469 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 136 [2021-12-06 21:56:41,469 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:00:27,768 INFO L129 PetriNetUnfolder]: 39590/79754 cut-off events. [2021-12-06 22:00:27,768 INFO L130 PetriNetUnfolder]: For 7180067/7181259 co-relation queries the response was YES. [2021-12-06 22:00:30,334 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1008244 conditions, 79754 events. 39590/79754 cut-off events. For 7180067/7181259 co-relation queries the response was YES. Maximal size of possible extension queue 2766. Compared 873369 event pairs, 5320 based on Foata normal form. 706/80162 useless extension candidates. Maximal degree in co-relation 1008061. Up to 50856 conditions per place. [2021-12-06 22:00:31,003 INFO L132 encePairwiseOnDemand]: 99/136 looper letters, 5208 selfloop transitions, 4936 changer transitions 93/10282 dead transitions. [2021-12-06 22:00:31,003 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 664 places, 10282 transitions, 396541 flow [2021-12-06 22:00:31,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-12-06 22:00:31,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2021-12-06 22:00:31,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 3350 transitions. [2021-12-06 22:00:31,006 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.43986344537815125 [2021-12-06 22:00:31,006 INFO L72 ComplementDD]: Start complementDD. Operand 56 states and 3350 transitions. [2021-12-06 22:00:31,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 3350 transitions. [2021-12-06 22:00:31,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:00:31,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 56 states and 3350 transitions. [2021-12-06 22:00:31,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 57 states, 56 states have (on average 59.82142857142857) internal successors, (3350), 56 states have internal predecessors, (3350), 0 states have call successors, (0), 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-12-06 22:00:31,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 57 states, 57 states have (on average 136.0) internal successors, (7752), 57 states have internal predecessors, (7752), 0 states have call successors, (0), 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-12-06 22:00:31,015 INFO L81 ComplementDD]: Finished complementDD. Result has 57 states, 57 states have (on average 136.0) internal successors, (7752), 57 states have internal predecessors, (7752), 0 states have call successors, (0), 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-12-06 22:00:31,015 INFO L186 Difference]: Start difference. First operand has 615 places, 8174 transitions, 298528 flow. Second operand 56 states and 3350 transitions. [2021-12-06 22:00:31,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 664 places, 10282 transitions, 396541 flow [2021-12-06 22:02:53,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 632 places, 10282 transitions, 394575 flow, removed 955 selfloop flow, removed 32 redundant places. [2021-12-06 22:02:54,029 INFO L242 Difference]: Finished difference. Result has 652 places, 9558 transitions, 371477 flow [2021-12-06 22:02:54,035 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=297064, PETRI_DIFFERENCE_MINUEND_PLACES=577, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3550, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3754, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=371477, PETRI_PLACES=652, PETRI_TRANSITIONS=9558} [2021-12-06 22:02:54,036 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 531 predicate places. [2021-12-06 22:02:54,036 INFO L470 AbstractCegarLoop]: Abstraction has has 652 places, 9558 transitions, 371477 flow [2021-12-06 22:02:54,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 57.83582089552239) internal successors, (3875), 67 states have internal predecessors, (3875), 0 states have call successors, (0), 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-12-06 22:02:54,036 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:02:54,036 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:02:54,056 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-06 22:02:54,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:02:54,238 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-06 22:02:54,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:02:54,239 INFO L85 PathProgramCache]: Analyzing trace with hash 551178574, now seen corresponding path program 3 times [2021-12-06 22:02:54,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:02:54,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931123194] [2021-12-06 22:02:54,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:02:54,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:02:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:02:54,883 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:02:54,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:02:54,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931123194] [2021-12-06 22:02:54,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931123194] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:02:54,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784401214] [2021-12-06 22:02:54,883 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-06 22:02:54,883 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:02:54,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:02:54,884 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:02:54,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_097e4876-bbd3-4a1a-b7a7-2f94c4932841/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-06 22:02:54,947 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-06 22:02:54,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 22:02:54,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-06 22:02:54,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:02:55,427 INFO L354 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2021-12-06 22:02:55,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2021-12-06 22:02:55,543 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 22:02:55,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:02:55,742 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 22:02:55,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 32 [2021-12-06 22:02:56,046 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 22:02:56,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784401214] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:02:56,046 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 22:02:56,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 15, 15] total 48 [2021-12-06 22:02:56,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923861555] [2021-12-06 22:02:56,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 22:02:56,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-12-06 22:02:56,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:02:56,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-06 22:02:56,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2077, Unknown=0, NotChecked=0, Total=2256 [2021-12-06 22:02:56,051 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 136 [2021-12-06 22:02:56,053 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 652 places, 9558 transitions, 371477 flow. Second operand has 48 states, 48 states have (on average 58.0625) internal successors, (2787), 48 states have internal predecessors, (2787), 0 states have call successors, (0), 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-12-06 22:02:56,053 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:02:56,053 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 136 [2021-12-06 22:02:56,053 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand