./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2150e0b957073117139b89f4d79d7a8523050efb20e53a1bf0b405c120dd6a7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 21:30:56,850 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 21:30:56,852 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 21:30:56,877 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 21:30:56,878 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 21:30:56,879 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 21:30:56,880 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 21:30:56,882 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 21:30:56,883 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 21:30:56,884 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 21:30:56,885 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 21:30:56,886 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 21:30:56,886 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 21:30:56,887 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 21:30:56,888 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 21:30:56,889 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 21:30:56,890 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 21:30:56,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 21:30:56,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 21:30:56,894 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 21:30:56,895 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 21:30:56,899 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 21:30:56,900 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 21:30:56,901 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 21:30:56,902 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 21:30:56,905 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 21:30:56,906 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 21:30:56,909 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 21:30:56,911 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 21:30:56,912 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 21:30:56,913 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 21:30:56,914 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 21:30:56,915 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 21:30:56,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 21:30:56,916 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 21:30:56,917 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 21:30:56,917 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 21:30:56,918 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 21:30:56,918 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 21:30:56,918 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 21:30:56,919 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 21:30:56,920 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 21:30:56,921 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 21:30:56,939 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 21:30:56,939 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 21:30:56,939 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 21:30:56,940 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 21:30:56,940 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 21:30:56,941 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 21:30:56,941 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 21:30:56,941 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 21:30:56,941 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 21:30:56,942 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 21:30:56,942 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 21:30:56,942 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 21:30:56,942 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 21:30:56,943 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 21:30:56,943 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 21:30:56,943 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 21:30:56,943 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 21:30:56,943 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 21:30:56,944 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 21:30:56,944 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 21:30:56,944 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 21:30:56,944 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 21:30:56,944 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 21:30:56,945 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 21:30:56,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:30:56,945 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 21:30:56,945 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 21:30:56,945 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 21:30:56,946 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 21:30:56,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 21:30:56,946 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 21:30:56,946 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 21:30:56,946 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 21:30:56,947 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> c2150e0b957073117139b89f4d79d7a8523050efb20e53a1bf0b405c120dd6a7 [2022-07-19 21:30:57,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 21:30:57,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 21:30:57,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 21:30:57,192 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 21:30:57,193 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 21:30:57,194 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2022-07-19 21:30:57,241 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12364708d/e1816a9dfb7b4738be41156bf1debc6b/FLAGa20ab178b [2022-07-19 21:30:57,635 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 21:30:57,637 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2022-07-19 21:30:57,644 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12364708d/e1816a9dfb7b4738be41156bf1debc6b/FLAGa20ab178b [2022-07-19 21:30:58,036 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12364708d/e1816a9dfb7b4738be41156bf1debc6b [2022-07-19 21:30:58,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 21:30:58,039 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 21:30:58,045 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 21:30:58,045 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 21:30:58,047 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 21:30:58,048 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:30:58" (1/1) ... [2022-07-19 21:30:58,049 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e53b1e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:30:58, skipping insertion in model container [2022-07-19 21:30:58,049 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:30:58" (1/1) ... [2022-07-19 21:30:58,054 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 21:30:58,071 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 21:30:58,259 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c[4174,4187] [2022-07-19 21:30:58,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:30:58,273 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 21:30:58,298 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c[4174,4187] [2022-07-19 21:30:58,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:30:58,314 INFO L208 MainTranslator]: Completed translation [2022-07-19 21:30:58,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:30:58 WrapperNode [2022-07-19 21:30:58,315 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 21:30:58,316 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 21:30:58,316 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 21:30:58,317 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 21:30:58,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:30:58" (1/1) ... [2022-07-19 21:30:58,328 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:30:58" (1/1) ... [2022-07-19 21:30:58,359 INFO L137 Inliner]: procedures = 26, calls = 75, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 315 [2022-07-19 21:30:58,360 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 21:30:58,362 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 21:30:58,362 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 21:30:58,362 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 21:30:58,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:30:58" (1/1) ... [2022-07-19 21:30:58,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:30:58" (1/1) ... [2022-07-19 21:30:58,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:30:58" (1/1) ... [2022-07-19 21:30:58,374 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:30:58" (1/1) ... [2022-07-19 21:30:58,383 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:30:58" (1/1) ... [2022-07-19 21:30:58,387 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:30:58" (1/1) ... [2022-07-19 21:30:58,390 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:30:58" (1/1) ... [2022-07-19 21:30:58,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 21:30:58,394 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 21:30:58,394 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 21:30:58,395 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 21:30:58,395 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:30:58" (1/1) ... [2022-07-19 21:30:58,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:30:58,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:30:58,445 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 21:30:58,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 21:30:58,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 21:30:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 21:30:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 21:30:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 21:30:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-19 21:30:58,494 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-19 21:30:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-19 21:30:58,495 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-19 21:30:58,495 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-19 21:30:58,495 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-19 21:30:58,495 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-07-19 21:30:58,495 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-07-19 21:30:58,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 21:30:58,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-19 21:30:58,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-19 21:30:58,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 21:30:58,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 21:30:58,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 21:30:58,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 21:30:58,498 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-19 21:30:58,623 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 21:30:58,624 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 21:30:59,041 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 21:30:59,199 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 21:30:59,199 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-19 21:30:59,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:30:59 BoogieIcfgContainer [2022-07-19 21:30:59,202 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 21:30:59,203 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 21:30:59,204 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 21:30:59,207 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 21:30:59,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 09:30:58" (1/3) ... [2022-07-19 21:30:59,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ea0617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:30:59, skipping insertion in model container [2022-07-19 21:30:59,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:30:58" (2/3) ... [2022-07-19 21:30:59,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ea0617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:30:59, skipping insertion in model container [2022-07-19 21:30:59,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:30:59" (3/3) ... [2022-07-19 21:30:59,210 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt2.wvr.c [2022-07-19 21:30:59,215 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-19 21:30:59,223 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 21:30:59,224 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 21:30:59,224 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-19 21:30:59,286 INFO L135 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-07-19 21:30:59,319 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 239 places, 245 transitions, 522 flow [2022-07-19 21:30:59,409 INFO L129 PetriNetUnfolder]: 19/241 cut-off events. [2022-07-19 21:30:59,410 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-07-19 21:30:59,415 INFO L84 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 241 events. 19/241 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 113 event pairs, 0 based on Foata normal form. 0/221 useless extension candidates. Maximal degree in co-relation 202. Up to 2 conditions per place. [2022-07-19 21:30:59,415 INFO L82 GeneralOperation]: Start removeDead. Operand has 239 places, 245 transitions, 522 flow [2022-07-19 21:30:59,421 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 222 places, 228 transitions, 480 flow [2022-07-19 21:30:59,431 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 21:30:59,438 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@84d8c3d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@15db479c [2022-07-19 21:30:59,440 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-07-19 21:30:59,482 INFO L129 PetriNetUnfolder]: 19/227 cut-off events. [2022-07-19 21:30:59,483 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-07-19 21:30:59,483 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:30:59,484 INFO L200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:30:59,484 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-19 21:30:59,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:30:59,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1169175300, now seen corresponding path program 1 times [2022-07-19 21:30:59,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:30:59,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704303705] [2022-07-19 21:30:59,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:30:59,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:30:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:30:59,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:30:59,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:30:59,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704303705] [2022-07-19 21:30:59,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704303705] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:30:59,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:30:59,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 21:30:59,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146656389] [2022-07-19 21:30:59,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:30:59,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 21:30:59,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:30:59,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 21:30:59,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 21:30:59,836 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 245 [2022-07-19 21:30:59,847 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 228 transitions, 480 flow. Second operand has 2 states, 2 states have (on average 224.5) internal successors, (449), 2 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:30:59,847 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:30:59,847 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 245 [2022-07-19 21:30:59,849 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:00,026 INFO L129 PetriNetUnfolder]: 123/530 cut-off events. [2022-07-19 21:31:00,026 INFO L130 PetriNetUnfolder]: For 105/106 co-relation queries the response was YES. [2022-07-19 21:31:00,031 INFO L84 FinitePrefix]: Finished finitePrefix Result has 758 conditions, 530 events. 123/530 cut-off events. For 105/106 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1703 event pairs, 51 based on Foata normal form. 126/594 useless extension candidates. Maximal degree in co-relation 504. Up to 163 conditions per place. [2022-07-19 21:31:00,035 INFO L132 encePairwiseOnDemand]: 232/245 looper letters, 12 selfloop transitions, 0 changer transitions 7/215 dead transitions. [2022-07-19 21:31:00,035 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 215 transitions, 478 flow [2022-07-19 21:31:00,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 21:31:00,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-19 21:31:00,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 463 transitions. [2022-07-19 21:31:00,053 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9448979591836735 [2022-07-19 21:31:00,053 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 463 transitions. [2022-07-19 21:31:00,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 463 transitions. [2022-07-19 21:31:00,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:00,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 463 transitions. [2022-07-19 21:31:00,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 231.5) internal successors, (463), 2 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:00,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:00,071 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:00,073 INFO L186 Difference]: Start difference. First operand has 222 places, 228 transitions, 480 flow. Second operand 2 states and 463 transitions. [2022-07-19 21:31:00,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 215 transitions, 478 flow [2022-07-19 21:31:00,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 215 transitions, 462 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-07-19 21:31:00,083 INFO L242 Difference]: Finished difference. Result has 215 places, 208 transitions, 424 flow [2022-07-19 21:31:00,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=424, PETRI_PLACES=215, PETRI_TRANSITIONS=208} [2022-07-19 21:31:00,090 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, -7 predicate places. [2022-07-19 21:31:00,090 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 208 transitions, 424 flow [2022-07-19 21:31:00,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 224.5) internal successors, (449), 2 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:00,092 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:00,092 INFO L200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:31:00,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 21:31:00,093 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-19 21:31:00,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:00,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1761120381, now seen corresponding path program 1 times [2022-07-19 21:31:00,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:00,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30564218] [2022-07-19 21:31:00,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:00,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:00,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:31:00,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:00,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30564218] [2022-07-19 21:31:00,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30564218] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:31:00,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:31:00,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 21:31:00,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083607821] [2022-07-19 21:31:00,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:31:00,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 21:31:00,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:00,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 21:31:00,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-19 21:31:00,667 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 245 [2022-07-19 21:31:00,669 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 208 transitions, 424 flow. Second operand has 8 states, 8 states have (on average 180.25) internal successors, (1442), 8 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:00,669 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:00,669 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 245 [2022-07-19 21:31:00,669 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:00,987 INFO L129 PetriNetUnfolder]: 417/981 cut-off events. [2022-07-19 21:31:00,987 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-07-19 21:31:00,991 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1658 conditions, 981 events. 417/981 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4295 event pairs, 71 based on Foata normal form. 0/875 useless extension candidates. Maximal degree in co-relation 1655. Up to 385 conditions per place. [2022-07-19 21:31:00,998 INFO L132 encePairwiseOnDemand]: 238/245 looper letters, 61 selfloop transitions, 6 changer transitions 0/226 dead transitions. [2022-07-19 21:31:00,998 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 226 transitions, 600 flow [2022-07-19 21:31:00,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 21:31:00,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-19 21:31:01,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1293 transitions. [2022-07-19 21:31:01,003 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.753935860058309 [2022-07-19 21:31:01,003 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1293 transitions. [2022-07-19 21:31:01,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1293 transitions. [2022-07-19 21:31:01,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:01,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1293 transitions. [2022-07-19 21:31:01,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 184.71428571428572) internal successors, (1293), 7 states have internal predecessors, (1293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:01,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:01,012 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:01,013 INFO L186 Difference]: Start difference. First operand has 215 places, 208 transitions, 424 flow. Second operand 7 states and 1293 transitions. [2022-07-19 21:31:01,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 226 transitions, 600 flow [2022-07-19 21:31:01,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 226 transitions, 600 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-19 21:31:01,024 INFO L242 Difference]: Finished difference. Result has 215 places, 209 transitions, 444 flow [2022-07-19 21:31:01,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=444, PETRI_PLACES=215, PETRI_TRANSITIONS=209} [2022-07-19 21:31:01,025 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, -7 predicate places. [2022-07-19 21:31:01,025 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 209 transitions, 444 flow [2022-07-19 21:31:01,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 180.25) internal successors, (1442), 8 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:01,027 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:01,027 INFO L200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:31:01,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 21:31:01,027 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-19 21:31:01,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:01,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1942679056, now seen corresponding path program 1 times [2022-07-19 21:31:01,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:01,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003262955] [2022-07-19 21:31:01,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:01,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:01,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:31:01,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:01,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003262955] [2022-07-19 21:31:01,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003262955] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:31:01,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:31:01,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 21:31:01,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742800000] [2022-07-19 21:31:01,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:31:01,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 21:31:01,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:01,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 21:31:01,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 21:31:01,282 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 245 [2022-07-19 21:31:01,283 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 209 transitions, 444 flow. Second operand has 5 states, 5 states have (on average 207.6) internal successors, (1038), 5 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:01,283 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:01,284 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 245 [2022-07-19 21:31:01,284 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:01,753 INFO L129 PetriNetUnfolder]: 1105/2053 cut-off events. [2022-07-19 21:31:01,754 INFO L130 PetriNetUnfolder]: For 250/250 co-relation queries the response was YES. [2022-07-19 21:31:01,760 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4049 conditions, 2053 events. 1105/2053 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 10814 event pairs, 123 based on Foata normal form. 0/1878 useless extension candidates. Maximal degree in co-relation 4044. Up to 632 conditions per place. [2022-07-19 21:31:01,772 INFO L132 encePairwiseOnDemand]: 237/245 looper letters, 59 selfloop transitions, 19 changer transitions 0/258 dead transitions. [2022-07-19 21:31:01,772 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 258 transitions, 726 flow [2022-07-19 21:31:01,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 21:31:01,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-19 21:31:01,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1498 transitions. [2022-07-19 21:31:01,778 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8734693877551021 [2022-07-19 21:31:01,778 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1498 transitions. [2022-07-19 21:31:01,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1498 transitions. [2022-07-19 21:31:01,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:01,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1498 transitions. [2022-07-19 21:31:01,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:01,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:01,786 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:01,786 INFO L186 Difference]: Start difference. First operand has 215 places, 209 transitions, 444 flow. Second operand 7 states and 1498 transitions. [2022-07-19 21:31:01,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 258 transitions, 726 flow [2022-07-19 21:31:01,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 258 transitions, 713 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-07-19 21:31:01,792 INFO L242 Difference]: Finished difference. Result has 220 places, 223 transitions, 554 flow [2022-07-19 21:31:01,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=554, PETRI_PLACES=220, PETRI_TRANSITIONS=223} [2022-07-19 21:31:01,795 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, -2 predicate places. [2022-07-19 21:31:01,795 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 223 transitions, 554 flow [2022-07-19 21:31:01,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 207.6) internal successors, (1038), 5 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:01,796 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:01,796 INFO L200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:31:01,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 21:31:01,796 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-19 21:31:01,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:01,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1928043760, now seen corresponding path program 2 times [2022-07-19 21:31:01,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:01,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247123583] [2022-07-19 21:31:01,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:01,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:01,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:31:01,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:01,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247123583] [2022-07-19 21:31:01,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247123583] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:31:01,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:31:01,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 21:31:01,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587802275] [2022-07-19 21:31:01,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:31:01,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:31:01,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:01,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:31:01,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:31:01,978 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 245 [2022-07-19 21:31:01,979 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 223 transitions, 554 flow. Second operand has 7 states, 7 states have (on average 177.85714285714286) internal successors, (1245), 7 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:01,979 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:01,979 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 245 [2022-07-19 21:31:01,979 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:02,666 INFO L129 PetriNetUnfolder]: 1644/3478 cut-off events. [2022-07-19 21:31:02,667 INFO L130 PetriNetUnfolder]: For 2556/2723 co-relation queries the response was YES. [2022-07-19 21:31:02,681 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8170 conditions, 3478 events. 1644/3478 cut-off events. For 2556/2723 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 23771 event pairs, 303 based on Foata normal form. 84/3327 useless extension candidates. Maximal degree in co-relation 8161. Up to 925 conditions per place. [2022-07-19 21:31:02,706 INFO L132 encePairwiseOnDemand]: 237/245 looper letters, 96 selfloop transitions, 31 changer transitions 0/283 dead transitions. [2022-07-19 21:31:02,706 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 283 transitions, 1084 flow [2022-07-19 21:31:02,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 21:31:02,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-19 21:31:02,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1460 transitions. [2022-07-19 21:31:02,714 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7448979591836735 [2022-07-19 21:31:02,714 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1460 transitions. [2022-07-19 21:31:02,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1460 transitions. [2022-07-19 21:31:02,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:02,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1460 transitions. [2022-07-19 21:31:02,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 182.5) internal successors, (1460), 8 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:02,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 245.0) internal successors, (2205), 9 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:02,722 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 245.0) internal successors, (2205), 9 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:02,723 INFO L186 Difference]: Start difference. First operand has 220 places, 223 transitions, 554 flow. Second operand 8 states and 1460 transitions. [2022-07-19 21:31:02,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 283 transitions, 1084 flow [2022-07-19 21:31:02,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 283 transitions, 1084 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-19 21:31:02,739 INFO L242 Difference]: Finished difference. Result has 231 places, 245 transitions, 845 flow [2022-07-19 21:31:02,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=845, PETRI_PLACES=231, PETRI_TRANSITIONS=245} [2022-07-19 21:31:02,741 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 9 predicate places. [2022-07-19 21:31:02,741 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 245 transitions, 845 flow [2022-07-19 21:31:02,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 177.85714285714286) internal successors, (1245), 7 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:02,742 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:02,742 INFO L200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:31:02,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 21:31:02,743 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-19 21:31:02,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:02,743 INFO L85 PathProgramCache]: Analyzing trace with hash 924192328, now seen corresponding path program 3 times [2022-07-19 21:31:02,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:02,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87025537] [2022-07-19 21:31:02,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:02,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:02,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:31:02,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:02,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87025537] [2022-07-19 21:31:02,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87025537] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:31:02,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:31:02,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 21:31:02,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528919675] [2022-07-19 21:31:02,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:31:02,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 21:31:02,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:02,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 21:31:02,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 21:31:02,961 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 245 [2022-07-19 21:31:02,962 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 245 transitions, 845 flow. Second operand has 5 states, 5 states have (on average 210.8) internal successors, (1054), 5 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:02,962 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:02,962 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 245 [2022-07-19 21:31:02,962 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:04,065 INFO L129 PetriNetUnfolder]: 3510/6037 cut-off events. [2022-07-19 21:31:04,065 INFO L130 PetriNetUnfolder]: For 9890/9890 co-relation queries the response was YES. [2022-07-19 21:31:04,097 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18197 conditions, 6037 events. 3510/6037 cut-off events. For 9890/9890 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 41243 event pairs, 224 based on Foata normal form. 42/5929 useless extension candidates. Maximal degree in co-relation 18183. Up to 1900 conditions per place. [2022-07-19 21:31:04,140 INFO L132 encePairwiseOnDemand]: 238/245 looper letters, 84 selfloop transitions, 54 changer transitions 0/322 dead transitions. [2022-07-19 21:31:04,141 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 322 transitions, 1686 flow [2022-07-19 21:31:04,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 21:31:04,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-07-19 21:31:04,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1312 transitions. [2022-07-19 21:31:04,182 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8925170068027211 [2022-07-19 21:31:04,182 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1312 transitions. [2022-07-19 21:31:04,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1312 transitions. [2022-07-19 21:31:04,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:04,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1312 transitions. [2022-07-19 21:31:04,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 218.66666666666666) internal successors, (1312), 6 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:04,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:04,188 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:04,188 INFO L186 Difference]: Start difference. First operand has 231 places, 245 transitions, 845 flow. Second operand 6 states and 1312 transitions. [2022-07-19 21:31:04,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 322 transitions, 1686 flow [2022-07-19 21:31:04,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 322 transitions, 1681 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-19 21:31:04,221 INFO L242 Difference]: Finished difference. Result has 237 places, 278 transitions, 1399 flow [2022-07-19 21:31:04,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1399, PETRI_PLACES=237, PETRI_TRANSITIONS=278} [2022-07-19 21:31:04,223 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 15 predicate places. [2022-07-19 21:31:04,223 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 278 transitions, 1399 flow [2022-07-19 21:31:04,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 210.8) internal successors, (1054), 5 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:04,224 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:04,224 INFO L200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:31:04,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 21:31:04,224 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-19 21:31:04,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:04,225 INFO L85 PathProgramCache]: Analyzing trace with hash -317948234, now seen corresponding path program 4 times [2022-07-19 21:31:04,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:04,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472439616] [2022-07-19 21:31:04,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:04,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:04,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:31:04,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:04,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472439616] [2022-07-19 21:31:04,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472439616] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:31:04,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:31:04,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 21:31:04,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241281063] [2022-07-19 21:31:04,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:31:04,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 21:31:04,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:04,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 21:31:04,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-19 21:31:04,355 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 245 [2022-07-19 21:31:04,356 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 278 transitions, 1399 flow. Second operand has 5 states, 5 states have (on average 210.8) internal successors, (1054), 5 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:04,356 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:04,356 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 245 [2022-07-19 21:31:04,356 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:06,190 INFO L129 PetriNetUnfolder]: 5382/10455 cut-off events. [2022-07-19 21:31:06,190 INFO L130 PetriNetUnfolder]: For 24939/24939 co-relation queries the response was YES. [2022-07-19 21:31:06,259 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31123 conditions, 10455 events. 5382/10455 cut-off events. For 24939/24939 co-relation queries the response was YES. Maximal size of possible extension queue 617. Compared 87327 event pairs, 789 based on Foata normal form. 42/9925 useless extension candidates. Maximal degree in co-relation 31105. Up to 2862 conditions per place. [2022-07-19 21:31:06,331 INFO L132 encePairwiseOnDemand]: 239/245 looper letters, 119 selfloop transitions, 45 changer transitions 0/348 dead transitions. [2022-07-19 21:31:06,332 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 348 transitions, 2352 flow [2022-07-19 21:31:06,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 21:31:06,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-19 21:31:06,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1097 transitions. [2022-07-19 21:31:06,335 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8955102040816326 [2022-07-19 21:31:06,335 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1097 transitions. [2022-07-19 21:31:06,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1097 transitions. [2022-07-19 21:31:06,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:06,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1097 transitions. [2022-07-19 21:31:06,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 219.4) internal successors, (1097), 5 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:06,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:06,340 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:06,340 INFO L186 Difference]: Start difference. First operand has 237 places, 278 transitions, 1399 flow. Second operand 5 states and 1097 transitions. [2022-07-19 21:31:06,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 348 transitions, 2352 flow [2022-07-19 21:31:06,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 348 transitions, 2296 flow, removed 28 selfloop flow, removed 0 redundant places. [2022-07-19 21:31:06,422 INFO L242 Difference]: Finished difference. Result has 244 places, 306 transitions, 1912 flow [2022-07-19 21:31:06,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=1375, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1912, PETRI_PLACES=244, PETRI_TRANSITIONS=306} [2022-07-19 21:31:06,423 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 22 predicate places. [2022-07-19 21:31:06,423 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 306 transitions, 1912 flow [2022-07-19 21:31:06,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 210.8) internal successors, (1054), 5 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:06,424 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:06,424 INFO L200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:31:06,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 21:31:06,425 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-19 21:31:06,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:06,425 INFO L85 PathProgramCache]: Analyzing trace with hash 9020230, now seen corresponding path program 5 times [2022-07-19 21:31:06,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:06,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631424477] [2022-07-19 21:31:06,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:06,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:06,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:31:06,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:06,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631424477] [2022-07-19 21:31:06,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631424477] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:31:06,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:31:06,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 21:31:06,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399919411] [2022-07-19 21:31:06,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:31:06,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 21:31:06,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:06,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 21:31:06,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-19 21:31:06,557 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 245 [2022-07-19 21:31:06,558 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 306 transitions, 1912 flow. Second operand has 5 states, 5 states have (on average 210.8) internal successors, (1054), 5 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:06,558 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:06,558 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 245 [2022-07-19 21:31:06,559 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:08,347 INFO L129 PetriNetUnfolder]: 5517/9983 cut-off events. [2022-07-19 21:31:08,347 INFO L130 PetriNetUnfolder]: For 33294/33364 co-relation queries the response was YES. [2022-07-19 21:31:08,409 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32741 conditions, 9983 events. 5517/9983 cut-off events. For 33294/33364 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 77143 event pairs, 570 based on Foata normal form. 43/9646 useless extension candidates. Maximal degree in co-relation 32719. Up to 2929 conditions per place. [2022-07-19 21:31:08,531 INFO L132 encePairwiseOnDemand]: 237/245 looper letters, 112 selfloop transitions, 71 changer transitions 0/367 dead transitions. [2022-07-19 21:31:08,531 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 367 transitions, 2944 flow [2022-07-19 21:31:08,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 21:31:08,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-19 21:31:08,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1093 transitions. [2022-07-19 21:31:08,534 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8922448979591837 [2022-07-19 21:31:08,535 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1093 transitions. [2022-07-19 21:31:08,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1093 transitions. [2022-07-19 21:31:08,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:08,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1093 transitions. [2022-07-19 21:31:08,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 218.6) internal successors, (1093), 5 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:08,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:08,540 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:08,541 INFO L186 Difference]: Start difference. First operand has 244 places, 306 transitions, 1912 flow. Second operand 5 states and 1093 transitions. [2022-07-19 21:31:08,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 367 transitions, 2944 flow [2022-07-19 21:31:08,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 367 transitions, 2935 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-07-19 21:31:08,596 INFO L242 Difference]: Finished difference. Result has 251 places, 336 transitions, 2706 flow [2022-07-19 21:31:08,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=1904, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2706, PETRI_PLACES=251, PETRI_TRANSITIONS=336} [2022-07-19 21:31:08,598 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 29 predicate places. [2022-07-19 21:31:08,598 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 336 transitions, 2706 flow [2022-07-19 21:31:08,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 210.8) internal successors, (1054), 5 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:08,599 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:08,599 INFO L200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:31:08,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 21:31:08,600 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-19 21:31:08,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:08,600 INFO L85 PathProgramCache]: Analyzing trace with hash -842712950, now seen corresponding path program 6 times [2022-07-19 21:31:08,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:08,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230517899] [2022-07-19 21:31:08,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:08,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:08,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:08,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:31:08,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:08,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230517899] [2022-07-19 21:31:08,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230517899] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:31:08,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:31:08,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 21:31:08,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081756608] [2022-07-19 21:31:08,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:31:08,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 21:31:08,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:08,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 21:31:08,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-19 21:31:08,727 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 245 [2022-07-19 21:31:08,728 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 336 transitions, 2706 flow. Second operand has 5 states, 5 states have (on average 210.8) internal successors, (1054), 5 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:08,728 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:08,728 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 245 [2022-07-19 21:31:08,729 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:10,274 INFO L129 PetriNetUnfolder]: 5138/9387 cut-off events. [2022-07-19 21:31:10,274 INFO L130 PetriNetUnfolder]: For 43500/43512 co-relation queries the response was YES. [2022-07-19 21:31:10,346 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35147 conditions, 9387 events. 5138/9387 cut-off events. For 43500/43512 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 73085 event pairs, 1783 based on Foata normal form. 24/9110 useless extension candidates. Maximal degree in co-relation 35122. Up to 6306 conditions per place. [2022-07-19 21:31:10,419 INFO L132 encePairwiseOnDemand]: 240/245 looper letters, 171 selfloop transitions, 13 changer transitions 0/368 dead transitions. [2022-07-19 21:31:10,419 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 368 transitions, 3317 flow [2022-07-19 21:31:10,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 21:31:10,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-19 21:31:10,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1088 transitions. [2022-07-19 21:31:10,422 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8881632653061224 [2022-07-19 21:31:10,422 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1088 transitions. [2022-07-19 21:31:10,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1088 transitions. [2022-07-19 21:31:10,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:10,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1088 transitions. [2022-07-19 21:31:10,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 217.6) internal successors, (1088), 5 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) [2022-07-19 21:31:10,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:10,429 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:10,429 INFO L186 Difference]: Start difference. First operand has 251 places, 336 transitions, 2706 flow. Second operand 5 states and 1088 transitions. [2022-07-19 21:31:10,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 368 transitions, 3317 flow [2022-07-19 21:31:10,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 368 transitions, 3315 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-07-19 21:31:10,678 INFO L242 Difference]: Finished difference. Result has 257 places, 339 transitions, 2795 flow [2022-07-19 21:31:10,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=2704, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2795, PETRI_PLACES=257, PETRI_TRANSITIONS=339} [2022-07-19 21:31:10,681 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 35 predicate places. [2022-07-19 21:31:10,682 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 339 transitions, 2795 flow [2022-07-19 21:31:10,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 210.8) internal successors, (1054), 5 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:10,682 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:10,683 INFO L200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:31:10,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 21:31:10,683 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-19 21:31:10,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:10,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1004322472, now seen corresponding path program 7 times [2022-07-19 21:31:10,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:10,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823489631] [2022-07-19 21:31:10,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:10,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:10,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:10,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:31:10,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:10,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823489631] [2022-07-19 21:31:10,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823489631] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:31:10,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:31:10,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 21:31:10,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274060558] [2022-07-19 21:31:10,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:31:10,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 21:31:10,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:10,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 21:31:10,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-19 21:31:10,845 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 245 [2022-07-19 21:31:10,846 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 339 transitions, 2795 flow. Second operand has 5 states, 5 states have (on average 210.8) internal successors, (1054), 5 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:10,846 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:10,847 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 245 [2022-07-19 21:31:10,847 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:12,352 INFO L129 PetriNetUnfolder]: 5845/10091 cut-off events. [2022-07-19 21:31:12,353 INFO L130 PetriNetUnfolder]: For 50752/50752 co-relation queries the response was YES. [2022-07-19 21:31:12,431 INFO L84 FinitePrefix]: Finished finitePrefix Result has 40391 conditions, 10091 events. 5845/10091 cut-off events. For 50752/50752 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 75821 event pairs, 194 based on Foata normal form. 18/9992 useless extension candidates. Maximal degree in co-relation 40363. Up to 2738 conditions per place. [2022-07-19 21:31:12,487 INFO L132 encePairwiseOnDemand]: 238/245 looper letters, 168 selfloop transitions, 54 changer transitions 0/406 dead transitions. [2022-07-19 21:31:12,487 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 406 transitions, 3990 flow [2022-07-19 21:31:12,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 21:31:12,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-19 21:31:12,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1094 transitions. [2022-07-19 21:31:12,491 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.893061224489796 [2022-07-19 21:31:12,491 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1094 transitions. [2022-07-19 21:31:12,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1094 transitions. [2022-07-19 21:31:12,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:12,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1094 transitions. [2022-07-19 21:31:12,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 218.8) internal successors, (1094), 5 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:12,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:12,497 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:12,497 INFO L186 Difference]: Start difference. First operand has 257 places, 339 transitions, 2795 flow. Second operand 5 states and 1094 transitions. [2022-07-19 21:31:12,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 406 transitions, 3990 flow [2022-07-19 21:31:12,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 406 transitions, 3967 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-07-19 21:31:12,605 INFO L242 Difference]: Finished difference. Result has 262 places, 362 transitions, 3427 flow [2022-07-19 21:31:12,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=2760, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3427, PETRI_PLACES=262, PETRI_TRANSITIONS=362} [2022-07-19 21:31:12,607 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 40 predicate places. [2022-07-19 21:31:12,607 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 362 transitions, 3427 flow [2022-07-19 21:31:12,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 210.8) internal successors, (1054), 5 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:12,608 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:12,608 INFO L200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:31:12,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 21:31:12,608 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-19 21:31:12,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:12,609 INFO L85 PathProgramCache]: Analyzing trace with hash -2123012021, now seen corresponding path program 1 times [2022-07-19 21:31:12,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:12,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774727103] [2022-07-19 21:31:12,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:12,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:12,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 21:31:12,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:12,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774727103] [2022-07-19 21:31:12,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774727103] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:31:12,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:31:12,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 21:31:12,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478594206] [2022-07-19 21:31:12,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:31:12,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 21:31:12,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:12,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 21:31:12,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:31:12,704 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 245 [2022-07-19 21:31:12,705 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 362 transitions, 3427 flow. Second operand has 6 states, 6 states have (on average 197.66666666666666) internal successors, (1186), 6 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:12,706 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:12,706 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 245 [2022-07-19 21:31:12,706 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:13,711 INFO L129 PetriNetUnfolder]: 2348/5677 cut-off events. [2022-07-19 21:31:13,711 INFO L130 PetriNetUnfolder]: For 55376/60946 co-relation queries the response was YES. [2022-07-19 21:31:13,750 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24797 conditions, 5677 events. 2348/5677 cut-off events. For 55376/60946 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 46904 event pairs, 834 based on Foata normal form. 634/5977 useless extension candidates. Maximal degree in co-relation 24766. Up to 2361 conditions per place. [2022-07-19 21:31:13,779 INFO L132 encePairwiseOnDemand]: 234/245 looper letters, 92 selfloop transitions, 8 changer transitions 19/385 dead transitions. [2022-07-19 21:31:13,779 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 385 transitions, 3715 flow [2022-07-19 21:31:13,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:31:13,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-19 21:31:13,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1800 transitions. [2022-07-19 21:31:13,783 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8163265306122449 [2022-07-19 21:31:13,783 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1800 transitions. [2022-07-19 21:31:13,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1800 transitions. [2022-07-19 21:31:13,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:13,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1800 transitions. [2022-07-19 21:31:13,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 200.0) internal successors, (1800), 9 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:13,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 245.0) internal successors, (2450), 10 states have internal predecessors, (2450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:13,794 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 245.0) internal successors, (2450), 10 states have internal predecessors, (2450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:13,794 INFO L186 Difference]: Start difference. First operand has 262 places, 362 transitions, 3427 flow. Second operand 9 states and 1800 transitions. [2022-07-19 21:31:13,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 385 transitions, 3715 flow [2022-07-19 21:31:13,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 385 transitions, 3706 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-07-19 21:31:13,874 INFO L242 Difference]: Finished difference. Result has 271 places, 363 transitions, 3458 flow [2022-07-19 21:31:13,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=3418, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3458, PETRI_PLACES=271, PETRI_TRANSITIONS=363} [2022-07-19 21:31:13,876 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 49 predicate places. [2022-07-19 21:31:13,876 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 363 transitions, 3458 flow [2022-07-19 21:31:13,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 197.66666666666666) internal successors, (1186), 6 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:13,877 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:13,877 INFO L200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:31:13,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 21:31:13,878 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-19 21:31:13,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:13,878 INFO L85 PathProgramCache]: Analyzing trace with hash 930183216, now seen corresponding path program 1 times [2022-07-19 21:31:13,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:13,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155027802] [2022-07-19 21:31:13,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:13,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:14,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:31:14,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:14,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155027802] [2022-07-19 21:31:14,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155027802] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:31:14,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687032507] [2022-07-19 21:31:14,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:14,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:14,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:31:14,615 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:31:14,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 21:31:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:14,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-19 21:31:14,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:31:14,912 INFO L390 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 [2022-07-19 21:31:14,969 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 21:31:14,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-19 21:31:15,026 INFO L356 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-07-19 21:31:15,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 30 [2022-07-19 21:31:15,808 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-07-19 21:31:15,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 34 [2022-07-19 21:31:16,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-19 21:31:17,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 [2022-07-19 21:31:17,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2022-07-19 21:31:17,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2022-07-19 21:31:17,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 [2022-07-19 21:31:17,816 INFO L390 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 [2022-07-19 21:31:17,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:31:17,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:31:20,401 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 21:31:20,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 61 [2022-07-19 21:31:20,413 INFO L390 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 1267 treesize of output 1235 [2022-07-19 21:31:20,434 INFO L390 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 629 treesize of output 605 [2022-07-19 21:31:20,447 INFO L390 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 1211 treesize of output 1019 [2022-07-19 21:31:20,461 INFO L390 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 1019 treesize of output 923 [2022-07-19 21:31:20,475 INFO L390 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 923 treesize of output 875 [2022-07-19 21:31:22,665 INFO L390 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 10 treesize of output 8 [2022-07-19 21:31:22,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:31:22,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687032507] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:31:22,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:31:22,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 29, 26] total 66 [2022-07-19 21:31:22,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613235899] [2022-07-19 21:31:22,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:31:22,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-07-19 21:31:22,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:22,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-07-19 21:31:22,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=706, Invalid=3512, Unknown=72, NotChecked=0, Total=4290 [2022-07-19 21:31:22,699 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 245 [2022-07-19 21:31:22,706 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 363 transitions, 3458 flow. Second operand has 66 states, 66 states have (on average 114.78787878787878) internal successors, (7576), 66 states have internal predecessors, (7576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:22,706 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:22,706 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 245 [2022-07-19 21:31:22,706 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:34,383 INFO L129 PetriNetUnfolder]: 16249/31797 cut-off events. [2022-07-19 21:31:34,384 INFO L130 PetriNetUnfolder]: For 314882/320916 co-relation queries the response was YES. [2022-07-19 21:31:34,634 INFO L84 FinitePrefix]: Finished finitePrefix Result has 147514 conditions, 31797 events. 16249/31797 cut-off events. For 314882/320916 co-relation queries the response was YES. Maximal size of possible extension queue 1573. Compared 309087 event pairs, 1087 based on Foata normal form. 2446/33283 useless extension candidates. Maximal degree in co-relation 147481. Up to 10304 conditions per place. [2022-07-19 21:31:34,844 INFO L132 encePairwiseOnDemand]: 202/245 looper letters, 662 selfloop transitions, 161 changer transitions 16/965 dead transitions. [2022-07-19 21:31:34,844 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 965 transitions, 13687 flow [2022-07-19 21:31:34,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-07-19 21:31:34,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2022-07-19 21:31:34,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 6404 transitions. [2022-07-19 21:31:34,862 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.4752504638218924 [2022-07-19 21:31:34,862 INFO L72 ComplementDD]: Start complementDD. Operand 55 states and 6404 transitions. [2022-07-19 21:31:34,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 6404 transitions. [2022-07-19 21:31:34,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:34,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 55 states and 6404 transitions. [2022-07-19 21:31:34,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 56 states, 55 states have (on average 116.43636363636364) internal successors, (6404), 55 states have internal predecessors, (6404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:34,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 56 states, 56 states have (on average 245.0) internal successors, (13720), 56 states have internal predecessors, (13720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:34,904 INFO L81 ComplementDD]: Finished complementDD. Result has 56 states, 56 states have (on average 245.0) internal successors, (13720), 56 states have internal predecessors, (13720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:34,904 INFO L186 Difference]: Start difference. First operand has 271 places, 363 transitions, 3458 flow. Second operand 55 states and 6404 transitions. [2022-07-19 21:31:34,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 965 transitions, 13687 flow [2022-07-19 21:31:35,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 965 transitions, 13575 flow, removed 46 selfloop flow, removed 6 redundant places. [2022-07-19 21:31:35,372 INFO L242 Difference]: Finished difference. Result has 345 places, 515 transitions, 6160 flow [2022-07-19 21:31:35,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=3428, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=6160, PETRI_PLACES=345, PETRI_TRANSITIONS=515} [2022-07-19 21:31:35,373 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 123 predicate places. [2022-07-19 21:31:35,373 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 515 transitions, 6160 flow [2022-07-19 21:31:35,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 114.78787878787878) internal successors, (7576), 66 states have internal predecessors, (7576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:35,376 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:35,376 INFO L200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:31:35,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 21:31:35,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-19 21:31:35,602 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-19 21:31:35,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:35,602 INFO L85 PathProgramCache]: Analyzing trace with hash -285812815, now seen corresponding path program 1 times [2022-07-19 21:31:35,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:35,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803671958] [2022-07-19 21:31:35,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:35,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:35,700 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 21:31:35,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:35,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803671958] [2022-07-19 21:31:35,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803671958] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:31:35,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:31:35,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 21:31:35,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775836867] [2022-07-19 21:31:35,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:31:35,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 21:31:35,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:35,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 21:31:35,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:31:35,704 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 245 [2022-07-19 21:31:35,705 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 515 transitions, 6160 flow. Second operand has 6 states, 6 states have (on average 198.5) internal successors, (1191), 6 states have internal predecessors, (1191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:35,705 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:35,705 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 245 [2022-07-19 21:31:35,705 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:38,707 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([871] L88-->L92: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|))) (and (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_1| |v_thread3Thread1of1ForFork1_plus_~a#1_1|) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_1| (select (select |v_#memory_int_67| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_front~0_43)))) (= v_~total~0_61 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (and (<= 0 v_~q1_front~0_43) (< v_~q1_front~0_43 v_~q1_back~0_51) (< v_~q1_front~0_43 v_~n1~0_18)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|) (not (= (ite (or (<= 0 (+ 2147483648 |v_thread3Thread1of1ForFork1_plus_~a#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|)) (<= 0 |v_thread3Thread1of1ForFork1_plus_~b#1_1|)) 1 0) 0)) (<= 0 (+ v_~total~0_61 2147483648)) (= v_~total~0_62 |v_thread3Thread1of1ForFork1_plus_#in~a#1_1|) (<= v_~total~0_61 2147483647) (= .cse0 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= (+ v_~q1_front~0_43 1) v_~q1_front~0_42) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (or (<= |v_thread3Thread1of1ForFork1_plus_~b#1_1| 0) (<= .cse0 2147483647)) 1 0)))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_43, ~q1_back~0=v_~q1_back~0_51, ~n1~0=v_~n1~0_18, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_67|, ~total~0=v_~total~0_62} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_42, ~n1~0=v_~n1~0_18, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, ~total~0=v_~total~0_61, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_51, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_23, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, #memory_int=|v_#memory_int_67|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][511], [1730#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 260#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~i~0 0) (not (<= ~N~0 ~i~0))), Black: 271#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 269#(and (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)))), Black: 273#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 267#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 1626#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1628#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1620#(and (or (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 1)) (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 385#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 1630#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1167#(or (<= (+ ~q1_back~0 1) ~q1_front~0) (forall ((v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)))) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0)), Black: 1689#(and (<= 1 ~total~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1673#(and (<= 1 ~total~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (<= ~q1_back~0 0) (and (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= ~q1_back~0 1) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 289#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 1634#(and (= |ULTIMATE.start_main_#t~ret24#1.offset| 0) (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_main_#t~ret24#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret24#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_main_#t~ret24#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_main_#t~ret24#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1687#(and (<= 1 ~total~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= ~C~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))))) (<= ~n1~0 ~q1_back~0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 291#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 1618#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 283#(<= ~q1_front~0 ~q1_back~0), Black: 1652#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1676#(and (<= 1 ~total~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 1632#(and (= |ULTIMATE.start_main_#t~ret24#1.offset| 0) (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_main_#t~ret24#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret24#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_main_#t~ret24#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_main_#t~ret24#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1640#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 383#(<= 1 ~total~0), Black: 1650#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (= |ULTIMATE.start_create_fresh_int_array_#t~malloc38#1.offset| 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 364#true, Black: 1679#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))) (or (= |ULTIMATE.start_main_~#t4~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (or (= |ULTIMATE.start_main_~#t4~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1))), Black: 1148#(or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_252 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (not (= ~C~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))) (<= 1 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (<= ~n1~0 ~q1_back~0)), Black: 382#(and (or (and (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (or (<= ~q1_back~0 1) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (<= ~q1_back~0 0)) (= ~q1~0.offset 0)), Black: 1061#(or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))), Black: 303#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 1692#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))) (or (= |ULTIMATE.start_main_~#t4~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= ~C~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))))) (<= ~n1~0 ~q1_back~0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (or (= |ULTIMATE.start_main_~#t4~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 302#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (<= ~N~0 ~i~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)))), Black: 301#(or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))), Black: 1644#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 305#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|) (or (and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (not (<= ~N~0 ~i~0))) (and (= |thread1Thread1of1ForFork2_~cond~0#1| 0) (<= ~N~0 ~i~0)))), Black: 1648#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (= |ULTIMATE.start_create_fresh_int_array_#t~malloc38#1.offset| 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 1129#(or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_253 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= 1 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (<= ~n1~0 ~q1_back~0)), Black: 1624#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_#t~post39#1| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (= |ULTIMATE.start_create_fresh_int_array_#t~post39#1| 0) (<= ~n1~0 1)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1685#(and (<= 1 ~total~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (<= ~q1_back~0 0) (and (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= ~q1_back~0 1) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= ~C~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))))) (<= ~n1~0 ~q1_back~0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1666#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= ~C~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))))) (<= ~n1~0 ~q1_back~0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 340#(or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)), Black: 314#(or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))), Black: 315#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 163#L110true, 299#true, Black: 322#(or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))), Black: 324#(and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)), Black: 323#(and (or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)))), 263#true, Black: 334#(and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)), Black: 333#(<= ~N~0 ~i~0), 180#L74true, 242#true, Black: 341#(and (or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)))), Black: 342#(and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)), 122#L92true, 320#true, Black: 356#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 13#L56true, 176#L143-4true, 313#(or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)), 293#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|))]) [2022-07-19 21:31:38,709 INFO L384 tUnfolder$Statistics]: this new event has 177 ancestors and is cut-off event [2022-07-19 21:31:38,709 INFO L387 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-07-19 21:31:38,709 INFO L387 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-07-19 21:31:38,709 INFO L387 tUnfolder$Statistics]: existing Event has 171 ancestors and is cut-off event [2022-07-19 21:31:39,067 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([855] L52-->L56: Formula: (let ((.cse0 (not |v_thread1_#t~short2#1_43|))) (and (let ((.cse2 (<= 0 v_~q1_back~0_46)) (.cse1 (< v_~q1_back~0_46 v_~n1~0_14))) (or (and .cse0 (or (not .cse1) (not .cse2))) (and .cse2 |v_thread1_#t~short2#1_43| .cse1))) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= v_~i~0_44 (+ v_~i~0_45 1)) (not (= 0 |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (or (and (let ((.cse3 (= |v_thread1_#t~mem1#1_32| v_~C~0_13))) (or (and .cse3 |v_thread1_#t~short2#1_44|) (and (not .cse3) (not |v_thread1_#t~short2#1_44|)))) (= (select (select |v_#memory_int_59| v_~q1~0.base_19) (+ v_~q1~0.offset_19 (* 4 v_~q1_back~0_46))) |v_thread1_#t~mem1#1_32|) |v_thread1_#t~short2#1_43|) (and .cse0 (= |v_thread1_#t~mem1#1_32| |v_thread1Thread1of1ForFork2_#t~mem1#1_1|) (= |v_thread1_#t~short2#1_43| |v_thread1_#t~short2#1_44|))) (= (ite |v_thread1_#t~short2#1_44| 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ 1 v_~q1_back~0_46) v_~q1_back~0_45))) InVars {~q1~0.offset=v_~q1~0.offset_19, ~i~0=v_~i~0_45, ~q1_back~0=v_~q1_back~0_46, ~C~0=v_~C~0_13, ~n1~0=v_~n1~0_14, ~q1~0.base=v_~q1~0.base_19, #memory_int=|v_#memory_int_59|, thread1Thread1of1ForFork2_#t~mem1#1=|v_thread1Thread1of1ForFork2_#t~mem1#1_1|} OutVars{~q1~0.offset=v_~q1~0.offset_19, ~i~0=v_~i~0_44, ~C~0=v_~C~0_13, thread1Thread1of1ForFork2_#t~short2#1=|v_thread1Thread1of1ForFork2_#t~short2#1_1|, ~n1~0=v_~n1~0_14, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_1|, ~q1_back~0=v_~q1_back~0_45, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.base=v_~q1~0.base_19, #memory_int=|v_#memory_int_59|, thread1Thread1of1ForFork2_#t~post4#1=|v_thread1Thread1of1ForFork2_#t~post4#1_1|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|} AuxVars[|v_thread1_#t~short2#1_44|, |v_thread1_#t~short2#1_43|, |v_thread1_#t~mem1#1_32|] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, ~i~0, thread1Thread1of1ForFork2_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~post4#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_#t~mem1#1][399], [1730#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 260#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~i~0 0) (not (<= ~N~0 ~i~0))), Black: 271#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 269#(and (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)))), Black: 273#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 267#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 315#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 1626#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1628#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1620#(and (or (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 1)) (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 385#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 1630#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1167#(or (<= (+ ~q1_back~0 1) ~q1_front~0) (forall ((v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)))) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0)), Black: 1689#(and (<= 1 ~total~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1673#(and (<= 1 ~total~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (<= ~q1_back~0 0) (and (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= ~q1_back~0 1) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 289#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 1634#(and (= |ULTIMATE.start_main_#t~ret24#1.offset| 0) (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_main_#t~ret24#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret24#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_main_#t~ret24#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_main_#t~ret24#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1687#(and (<= 1 ~total~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= ~C~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))))) (<= ~n1~0 ~q1_back~0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 283#(<= ~q1_front~0 ~q1_back~0), Black: 1618#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1652#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 293#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 1676#(and (<= 1 ~total~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 1632#(and (= |ULTIMATE.start_main_#t~ret24#1.offset| 0) (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_main_#t~ret24#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret24#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_main_#t~ret24#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_main_#t~ret24#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1640#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 383#(<= 1 ~total~0), Black: 1650#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (= |ULTIMATE.start_create_fresh_int_array_#t~malloc38#1.offset| 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 364#true, Black: 1679#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))) (or (= |ULTIMATE.start_main_~#t4~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (or (= |ULTIMATE.start_main_~#t4~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1))), Black: 1148#(or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_252 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (not (= ~C~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))) (<= 1 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (<= ~n1~0 ~q1_back~0)), Black: 382#(and (or (and (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (or (<= ~q1_back~0 1) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (<= ~q1_back~0 0)) (= ~q1~0.offset 0)), Black: 303#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 1061#(or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))), Black: 1692#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))) (or (= |ULTIMATE.start_main_~#t4~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= ~C~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))))) (<= ~n1~0 ~q1_back~0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (or (= |ULTIMATE.start_main_~#t4~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 302#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (<= ~N~0 ~i~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)))), Black: 1644#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 291#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 301#(or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))), Black: 305#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|) (or (and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (not (<= ~N~0 ~i~0))) (and (= |thread1Thread1of1ForFork2_~cond~0#1| 0) (<= ~N~0 ~i~0)))), Black: 1648#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (= |ULTIMATE.start_create_fresh_int_array_#t~malloc38#1.offset| 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 1129#(or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_253 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= 1 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (<= ~n1~0 ~q1_back~0)), Black: 1624#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_#t~post39#1| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (= |ULTIMATE.start_create_fresh_int_array_#t~post39#1| 0) (<= ~n1~0 1)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1685#(and (<= 1 ~total~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (<= ~q1_back~0 0) (and (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= ~q1_back~0 1) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= ~C~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))))) (<= ~n1~0 ~q1_back~0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1666#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= ~C~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))))) (<= ~n1~0 ~q1_back~0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 340#(or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)), Black: 314#(or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))), 163#L110true, Black: 313#(or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)), 299#true, Black: 322#(or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))), Black: 324#(and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)), Black: 323#(and (or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)))), 263#true, 94#L95true, Black: 334#(and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)), Black: 333#(<= ~N~0 ~i~0), 180#L74true, 242#true, Black: 341#(and (or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)))), Black: 342#(and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)), 320#true, Black: 356#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 13#L56true, 176#L143-4true]) [2022-07-19 21:31:39,069 INFO L384 tUnfolder$Statistics]: this new event has 178 ancestors and is cut-off event [2022-07-19 21:31:39,069 INFO L387 tUnfolder$Statistics]: existing Event has 178 ancestors and is cut-off event [2022-07-19 21:31:39,069 INFO L387 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-07-19 21:31:39,069 INFO L387 tUnfolder$Statistics]: existing Event has 178 ancestors and is cut-off event [2022-07-19 21:31:39,070 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([871] L88-->L92: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|))) (and (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_1| |v_thread3Thread1of1ForFork1_plus_~a#1_1|) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_1| (select (select |v_#memory_int_67| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_front~0_43)))) (= v_~total~0_61 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (not (= (ite (and (<= 0 v_~q1_front~0_43) (< v_~q1_front~0_43 v_~q1_back~0_51) (< v_~q1_front~0_43 v_~n1~0_18)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|) (not (= (ite (or (<= 0 (+ 2147483648 |v_thread3Thread1of1ForFork1_plus_~a#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|)) (<= 0 |v_thread3Thread1of1ForFork1_plus_~b#1_1|)) 1 0) 0)) (<= 0 (+ v_~total~0_61 2147483648)) (= v_~total~0_62 |v_thread3Thread1of1ForFork1_plus_#in~a#1_1|) (<= v_~total~0_61 2147483647) (= .cse0 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= (+ v_~q1_front~0_43 1) v_~q1_front~0_42) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (or (<= |v_thread3Thread1of1ForFork1_plus_~b#1_1| 0) (<= .cse0 2147483647)) 1 0)))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_43, ~q1_back~0=v_~q1_back~0_51, ~n1~0=v_~n1~0_18, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_67|, ~total~0=v_~total~0_62} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_23, ~q1_front~0=v_~q1_front~0_42, ~n1~0=v_~n1~0_18, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, ~total~0=v_~total~0_61, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_51, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_23, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, #memory_int=|v_#memory_int_67|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][532], [1730#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 322#(or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))), Black: 260#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~i~0 0) (not (<= ~N~0 ~i~0))), 265#(or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))), Black: 271#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 269#(and (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)))), Black: 273#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 267#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 315#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 1626#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1628#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1620#(and (or (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 1)) (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 385#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 1630#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1167#(or (<= (+ ~q1_back~0 1) ~q1_front~0) (forall ((v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)))) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0)), Black: 1689#(and (<= 1 ~total~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1673#(and (<= 1 ~total~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (<= ~q1_back~0 0) (and (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= ~q1_back~0 1) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 289#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 1634#(and (= |ULTIMATE.start_main_#t~ret24#1.offset| 0) (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_main_#t~ret24#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret24#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_main_#t~ret24#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_main_#t~ret24#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1687#(and (<= 1 ~total~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= ~C~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))))) (<= ~n1~0 ~q1_back~0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 291#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 1618#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 283#(<= ~q1_front~0 ~q1_back~0), Black: 1652#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1676#(and (<= 1 ~total~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 1632#(and (= |ULTIMATE.start_main_#t~ret24#1.offset| 0) (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_main_#t~ret24#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret24#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_main_#t~ret24#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_main_#t~ret24#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1640#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 383#(<= 1 ~total~0), Black: 1650#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (= |ULTIMATE.start_create_fresh_int_array_#t~malloc38#1.offset| 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 364#true, Black: 1679#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))) (or (= |ULTIMATE.start_main_~#t4~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (or (= |ULTIMATE.start_main_~#t4~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1))), Black: 1148#(or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_252 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (not (= ~C~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))) (<= 1 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (<= ~n1~0 ~q1_back~0)), Black: 382#(and (or (and (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (or (<= ~q1_back~0 1) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (<= ~q1_back~0 0)) (= ~q1~0.offset 0)), Black: 303#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 1061#(or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))), Black: 1692#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))) (or (= |ULTIMATE.start_main_~#t4~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= ~C~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))))) (<= ~n1~0 ~q1_back~0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (or (= |ULTIMATE.start_main_~#t4~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 302#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (<= ~N~0 ~i~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)))), Black: 1644#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 305#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|) (or (and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (not (<= ~N~0 ~i~0))) (and (= |thread1Thread1of1ForFork2_~cond~0#1| 0) (<= ~N~0 ~i~0)))), Black: 1648#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (= |ULTIMATE.start_create_fresh_int_array_#t~malloc38#1.offset| 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 1129#(or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_253 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= 1 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (<= ~n1~0 ~q1_back~0)), 301#(or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))), Black: 1624#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_#t~post39#1| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (= |ULTIMATE.start_create_fresh_int_array_#t~post39#1| 0) (<= ~n1~0 1)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1685#(and (<= 1 ~total~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (<= ~q1_back~0 0) (and (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= ~q1_back~0 1) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= ~C~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))))) (<= ~n1~0 ~q1_back~0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1666#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= ~C~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))))) (<= ~n1~0 ~q1_back~0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 314#(or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))), 163#L110true, Black: 313#(or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)), 113#L52true, Black: 324#(and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)), Black: 323#(and (or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)))), Black: 320#true, 341#(and (or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)))), Black: 334#(and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)), Black: 333#(<= ~N~0 ~i~0), 180#L74true, Black: 340#(or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)), 242#true, Black: 342#(and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)), 122#L92true, Black: 356#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 176#L143-4true, 293#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|))]) [2022-07-19 21:31:39,070 INFO L384 tUnfolder$Statistics]: this new event has 179 ancestors and is cut-off event [2022-07-19 21:31:39,070 INFO L387 tUnfolder$Statistics]: existing Event has 179 ancestors and is cut-off event [2022-07-19 21:31:39,070 INFO L387 tUnfolder$Statistics]: existing Event has 173 ancestors and is cut-off event [2022-07-19 21:31:39,071 INFO L387 tUnfolder$Statistics]: existing Event has 179 ancestors and is cut-off event [2022-07-19 21:31:39,363 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([890] thread1EXIT-->L144-2: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem34#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_5|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_5|} AuxVars[] AssignedVars[][549], [1730#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 260#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~i~0 0) (not (<= ~N~0 ~i~0))), 265#(or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))), Black: 271#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 269#(and (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)))), Black: 273#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 267#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 1626#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1628#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1620#(and (or (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 1)) (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 385#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 1630#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1167#(or (<= (+ ~q1_back~0 1) ~q1_front~0) (forall ((v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)))) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0)), Black: 1689#(and (<= 1 ~total~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1673#(and (<= 1 ~total~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (<= ~q1_back~0 0) (and (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= ~q1_back~0 1) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 289#(and (<= ~q1_front~0 ~q1_back~0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 1634#(and (= |ULTIMATE.start_main_#t~ret24#1.offset| 0) (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_main_#t~ret24#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret24#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_main_#t~ret24#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_main_#t~ret24#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1687#(and (<= 1 ~total~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= ~C~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))))) (<= ~n1~0 ~q1_back~0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1618#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 283#(<= ~q1_front~0 ~q1_back~0), Black: 293#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 1652#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 62#L144-2true, Black: 1676#(and (<= 1 ~total~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 1632#(and (= |ULTIMATE.start_main_#t~ret24#1.offset| 0) (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_main_#t~ret24#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret24#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= |ULTIMATE.start_main_#t~ret24#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_main_#t~ret24#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1640#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 383#(<= 1 ~total~0), Black: 1650#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (= |ULTIMATE.start_create_fresh_int_array_#t~malloc38#1.offset| 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 364#true, Black: 1679#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))) (or (= |ULTIMATE.start_main_~#t4~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (or (= |ULTIMATE.start_main_~#t4~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1))), Black: 1148#(or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_252 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (not (= ~C~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))) (<= 1 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (<= ~n1~0 ~q1_back~0)), Black: 382#(and (or (and (or (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (or (<= ~q1_back~0 1) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (<= ~q1_back~0 0)) (= ~q1~0.offset 0)), Black: 303#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 1061#(or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))), 324#(and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)), Black: 1692#(and (<= 1 ~total~0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (not (< ~q1_front~0 ~q1_back~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))) (or (= |ULTIMATE.start_main_~#t4~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= ~C~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))))) (<= ~n1~0 ~q1_back~0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (or (= |ULTIMATE.start_main_~#t4~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 302#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (<= ~N~0 ~i~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)))), Black: 1644#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 291#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 305#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|) (or (and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (not (<= ~N~0 ~i~0))) (and (= |thread1Thread1of1ForFork2_~cond~0#1| 0) (<= ~N~0 ~i~0)))), Black: 1648#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (= |ULTIMATE.start_create_fresh_int_array_#t~malloc38#1.offset| 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 1129#(or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_253 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= 1 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))) (<= ~n1~0 ~q1_back~0)), 301#(or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))), Black: 1624#(and (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_#t~post39#1| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t4~0#1.base|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (or (= |ULTIMATE.start_create_fresh_int_array_#t~post39#1| 0) (<= ~n1~0 1)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1685#(and (<= 1 ~total~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (<= ~q1_back~0 0) (and (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (or (<= ~q1_back~0 1) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1~0.offset 0) (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 1) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= ~C~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))))) (<= ~n1~0 ~q1_back~0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1666#(and (= ~total~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t4~0#1.base|) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (forall ((v_ArrVal_250 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (or (<= 1 (+ ~total~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= ~C~0 (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_250) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_251) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_252) |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_253) ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)))))) (<= ~n1~0 ~q1_back~0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 315#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 163#L110true, Black: 313#(or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)), 314#(or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))), Black: 322#(or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))), Black: 323#(and (or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)))), Black: 320#true, 94#L95true, Black: 334#(and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)), Black: 333#(<= ~N~0 ~i~0), 180#L74true, Black: 340#(or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)), 242#true, Black: 341#(and (or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)) (or (and (not (<= ~N~0 ~i~0)) (= (+ 1 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) 0)) (and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0)))), Black: 356#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 342#(and (= 0 (* (- 1) |thread1Thread1of1ForFork2_~cond~0#1|)) (<= ~N~0 ~i~0))]) [2022-07-19 21:31:39,364 INFO L384 tUnfolder$Statistics]: this new event has 183 ancestors and is cut-off event [2022-07-19 21:31:39,364 INFO L387 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-07-19 21:31:39,364 INFO L387 tUnfolder$Statistics]: existing Event has 183 ancestors and is cut-off event [2022-07-19 21:31:39,364 INFO L387 tUnfolder$Statistics]: existing Event has 183 ancestors and is cut-off event [2022-07-19 21:31:40,585 INFO L129 PetriNetUnfolder]: 9168/22632 cut-off events. [2022-07-19 21:31:40,585 INFO L130 PetriNetUnfolder]: For 247910/263193 co-relation queries the response was YES. [2022-07-19 21:31:40,817 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111342 conditions, 22632 events. 9168/22632 cut-off events. For 247910/263193 co-relation queries the response was YES. Maximal size of possible extension queue 1192. Compared 246342 event pairs, 1889 based on Foata normal form. 2962/24552 useless extension candidates. Maximal degree in co-relation 111282. Up to 7456 conditions per place. [2022-07-19 21:31:40,943 INFO L132 encePairwiseOnDemand]: 236/245 looper letters, 333 selfloop transitions, 8 changer transitions 47/671 dead transitions. [2022-07-19 21:31:40,943 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 671 transitions, 9797 flow [2022-07-19 21:31:40,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 21:31:40,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-19 21:31:40,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1406 transitions. [2022-07-19 21:31:40,948 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8198250728862974 [2022-07-19 21:31:40,949 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1406 transitions. [2022-07-19 21:31:40,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1406 transitions. [2022-07-19 21:31:40,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:40,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1406 transitions. [2022-07-19 21:31:40,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 200.85714285714286) internal successors, (1406), 7 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:40,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:40,954 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:40,954 INFO L186 Difference]: Start difference. First operand has 345 places, 515 transitions, 6160 flow. Second operand 7 states and 1406 transitions. [2022-07-19 21:31:40,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 671 transitions, 9797 flow [2022-07-19 21:31:41,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 671 transitions, 9697 flow, removed 36 selfloop flow, removed 18 redundant places. [2022-07-19 21:31:41,481 INFO L242 Difference]: Finished difference. Result has 330 places, 517 transitions, 6136 flow [2022-07-19 21:31:41,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=6088, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=507, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6136, PETRI_PLACES=330, PETRI_TRANSITIONS=517} [2022-07-19 21:31:41,482 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 108 predicate places. [2022-07-19 21:31:41,482 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 517 transitions, 6136 flow [2022-07-19 21:31:41,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.5) internal successors, (1191), 6 states have internal predecessors, (1191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:41,483 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:41,483 INFO L200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:31:41,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 21:31:41,484 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-19 21:31:41,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:41,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1842698929, now seen corresponding path program 2 times [2022-07-19 21:31:41,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:41,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351040565] [2022-07-19 21:31:41,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:41,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:42,714 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:31:42,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:42,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351040565] [2022-07-19 21:31:42,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351040565] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:31:42,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155537734] [2022-07-19 21:31:42,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 21:31:42,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:42,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:31:42,718 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:31:42,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 21:31:42,901 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 21:31:42,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:31:42,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-19 21:31:42,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:31:43,015 INFO L390 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 [2022-07-19 21:31:43,524 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 21:31:43,524 INFO L390 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 [2022-07-19 21:31:43,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-19 21:31:44,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 [2022-07-19 21:31:45,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:31:45,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2022-07-19 21:31:45,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:31:45,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2022-07-19 21:31:45,418 INFO L390 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 [2022-07-19 21:31:45,549 INFO L390 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 [2022-07-19 21:31:45,591 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:31:45,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:31:47,489 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 21:31:47,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 52 [2022-07-19 21:31:47,494 INFO L390 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 695 treesize of output 671 [2022-07-19 21:31:47,501 INFO L390 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 650 treesize of output 626 [2022-07-19 21:31:47,507 INFO L390 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 626 treesize of output 530 [2022-07-19 21:31:47,514 INFO L390 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 530 treesize of output 482 [2022-07-19 21:31:47,522 INFO L390 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 260 treesize of output 242 [2022-07-19 21:31:49,784 INFO L390 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 10 treesize of output 8 [2022-07-19 21:31:49,788 INFO L390 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 10 treesize of output 8 [2022-07-19 21:31:49,792 INFO L390 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 10 treesize of output 8 [2022-07-19 21:31:49,895 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:31:49,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155537734] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:31:49,895 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:31:49,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31, 32] total 81 [2022-07-19 21:31:49,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882092289] [2022-07-19 21:31:49,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:31:49,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-07-19 21:31:49,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:49,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-07-19 21:31:49,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=5922, Unknown=60, NotChecked=0, Total=6480 [2022-07-19 21:31:49,903 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 245 [2022-07-19 21:31:49,909 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 517 transitions, 6136 flow. Second operand has 81 states, 81 states have (on average 112.41975308641975) internal successors, (9106), 81 states have internal predecessors, (9106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:49,909 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:49,909 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 245 [2022-07-19 21:31:49,909 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand