./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 791161d1 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-?-791161d [2022-07-22 21:45:41,931 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 21:45:41,933 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 21:45:41,958 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 21:45:41,959 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 21:45:41,960 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 21:45:41,962 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 21:45:41,963 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 21:45:41,965 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 21:45:41,966 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 21:45:41,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 21:45:41,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 21:45:41,969 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 21:45:41,969 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 21:45:41,971 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 21:45:41,972 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 21:45:41,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 21:45:41,973 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 21:45:41,975 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 21:45:41,977 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 21:45:41,979 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 21:45:41,980 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 21:45:41,981 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 21:45:41,982 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 21:45:41,983 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 21:45:41,986 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 21:45:41,987 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 21:45:41,987 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 21:45:41,988 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 21:45:41,989 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 21:45:42,000 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 21:45:42,000 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 21:45:42,002 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 21:45:42,003 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 21:45:42,004 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 21:45:42,007 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 21:45:42,008 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 21:45:42,009 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 21:45:42,009 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 21:45:42,009 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 21:45:42,010 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 21:45:42,013 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 21:45:42,014 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 21:45:42,050 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 21:45:42,052 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 21:45:42,053 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 21:45:42,053 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 21:45:42,053 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 21:45:42,054 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 21:45:42,054 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 21:45:42,054 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 21:45:42,054 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 21:45:42,055 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 21:45:42,056 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 21:45:42,056 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 21:45:42,056 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 21:45:42,056 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 21:45:42,056 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 21:45:42,056 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 21:45:42,057 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 21:45:42,057 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 21:45:42,057 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 21:45:42,057 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 21:45:42,057 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 21:45:42,058 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 21:45:42,058 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 21:45:42,058 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 21:45:42,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:45:42,059 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 21:45:42,059 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 21:45:42,059 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 21:45:42,059 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 21:45:42,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 21:45:42,060 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 21:45:42,060 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 21:45:42,060 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 21:45:42,060 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-22 21:45:42,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 21:45:42,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 21:45:42,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 21:45:42,321 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 21:45:42,322 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 21:45:42,323 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-22 21:45:42,378 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6564e4bbe/85f181d77a3d48aa82bc0d8a8ab665ed/FLAGb669b5934 [2022-07-22 21:45:42,812 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 21:45:42,813 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2022-07-22 21:45:42,821 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6564e4bbe/85f181d77a3d48aa82bc0d8a8ab665ed/FLAGb669b5934 [2022-07-22 21:45:43,185 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6564e4bbe/85f181d77a3d48aa82bc0d8a8ab665ed [2022-07-22 21:45:43,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 21:45:43,190 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 21:45:43,190 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 21:45:43,191 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 21:45:43,194 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 21:45:43,195 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:45:43" (1/1) ... [2022-07-22 21:45:43,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e469f8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:45:43, skipping insertion in model container [2022-07-22 21:45:43,196 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:45:43" (1/1) ... [2022-07-22 21:45:43,203 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 21:45:43,225 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 21:45:43,369 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-22 21:45:43,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:45:43,387 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 21:45:43,416 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-22 21:45:43,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:45:43,433 INFO L208 MainTranslator]: Completed translation [2022-07-22 21:45:43,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:45:43 WrapperNode [2022-07-22 21:45:43,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 21:45:43,435 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 21:45:43,436 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 21:45:43,436 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 21:45:43,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:45:43" (1/1) ... [2022-07-22 21:45:43,451 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:45:43" (1/1) ... [2022-07-22 21:45:43,483 INFO L137 Inliner]: procedures = 26, calls = 75, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 315 [2022-07-22 21:45:43,486 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 21:45:43,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 21:45:43,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 21:45:43,488 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 21:45:43,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:45:43" (1/1) ... [2022-07-22 21:45:43,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:45:43" (1/1) ... [2022-07-22 21:45:43,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:45:43" (1/1) ... [2022-07-22 21:45:43,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:45:43" (1/1) ... [2022-07-22 21:45:43,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:45:43" (1/1) ... [2022-07-22 21:45:43,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:45:43" (1/1) ... [2022-07-22 21:45:43,519 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:45:43" (1/1) ... [2022-07-22 21:45:43,523 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 21:45:43,524 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 21:45:43,524 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 21:45:43,524 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 21:45:43,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:45:43" (1/1) ... [2022-07-22 21:45:43,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:45:43,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:45:43,557 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-22 21:45:43,563 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-22 21:45:43,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 21:45:43,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 21:45:43,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 21:45:43,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 21:45:43,590 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 21:45:43,590 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 21:45:43,590 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 21:45:43,590 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 21:45:43,590 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-22 21:45:43,591 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-22 21:45:43,591 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-07-22 21:45:43,591 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-07-22 21:45:43,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 21:45:43,591 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 21:45:43,592 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 21:45:43,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 21:45:43,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 21:45:43,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 21:45:43,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 21:45:43,594 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 21:45:43,680 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 21:45:43,682 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 21:45:44,091 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 21:45:44,238 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 21:45:44,238 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-22 21:45:44,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:45:44 BoogieIcfgContainer [2022-07-22 21:45:44,243 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 21:45:44,246 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 21:45:44,246 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 21:45:44,249 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 21:45:44,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 09:45:43" (1/3) ... [2022-07-22 21:45:44,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2af9a28a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:45:44, skipping insertion in model container [2022-07-22 21:45:44,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:45:43" (2/3) ... [2022-07-22 21:45:44,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2af9a28a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:45:44, skipping insertion in model container [2022-07-22 21:45:44,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:45:44" (3/3) ... [2022-07-22 21:45:44,253 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt2.wvr.c [2022-07-22 21:45:44,258 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-22 21:45:44,264 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 21:45:44,265 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 21:45:44,265 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-22 21:45:44,331 INFO L135 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-07-22 21:45:44,385 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 239 places, 245 transitions, 522 flow [2022-07-22 21:45:44,484 INFO L129 PetriNetUnfolder]: 19/241 cut-off events. [2022-07-22 21:45:44,486 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-07-22 21:45:44,494 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-22 21:45:44,494 INFO L82 GeneralOperation]: Start removeDead. Operand has 239 places, 245 transitions, 522 flow [2022-07-22 21:45:44,503 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 222 places, 228 transitions, 480 flow [2022-07-22 21:45:44,512 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 21:45:44,521 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@520b6307, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7d79d13e [2022-07-22 21:45:44,521 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-07-22 21:45:44,570 INFO L129 PetriNetUnfolder]: 19/227 cut-off events. [2022-07-22 21:45:44,572 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-07-22 21:45:44,572 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:45:44,573 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-22 21:45:44,574 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-22 21:45:44,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:45:44,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1169175300, now seen corresponding path program 1 times [2022-07-22 21:45:44,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:45:44,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77639476] [2022-07-22 21:45:44,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:45:44,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:45:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:45:44,892 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-22 21:45:44,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:45:44,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77639476] [2022-07-22 21:45:44,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77639476] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:45:44,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:45:44,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 21:45:44,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674943686] [2022-07-22 21:45:44,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:45:44,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 21:45:44,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:45:44,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 21:45:44,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 21:45:44,942 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 245 [2022-07-22 21:45:44,951 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-22 21:45:44,951 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:45:44,951 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 245 [2022-07-22 21:45:44,952 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:45:45,126 INFO L129 PetriNetUnfolder]: 123/530 cut-off events. [2022-07-22 21:45:45,127 INFO L130 PetriNetUnfolder]: For 105/106 co-relation queries the response was YES. [2022-07-22 21:45:45,132 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-22 21:45:45,136 INFO L132 encePairwiseOnDemand]: 232/245 looper letters, 12 selfloop transitions, 0 changer transitions 7/215 dead transitions. [2022-07-22 21:45:45,137 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 215 transitions, 478 flow [2022-07-22 21:45:45,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 21:45:45,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-22 21:45:45,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 463 transitions. [2022-07-22 21:45:45,157 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9448979591836735 [2022-07-22 21:45:45,158 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 463 transitions. [2022-07-22 21:45:45,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 463 transitions. [2022-07-22 21:45:45,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:45:45,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 463 transitions. [2022-07-22 21:45:45,171 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-22 21:45:45,177 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-22 21:45:45,178 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-22 21:45:45,180 INFO L186 Difference]: Start difference. First operand has 222 places, 228 transitions, 480 flow. Second operand 2 states and 463 transitions. [2022-07-22 21:45:45,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 215 transitions, 478 flow [2022-07-22 21:45:45,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 215 transitions, 462 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-07-22 21:45:45,191 INFO L242 Difference]: Finished difference. Result has 215 places, 208 transitions, 424 flow [2022-07-22 21:45:45,193 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-22 21:45:45,199 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, -7 predicate places. [2022-07-22 21:45:45,200 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 208 transitions, 424 flow [2022-07-22 21:45:45,200 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-22 21:45:45,201 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:45:45,201 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-22 21:45:45,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 21:45:45,202 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-22 21:45:45,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:45:45,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1761120381, now seen corresponding path program 1 times [2022-07-22 21:45:45,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:45:45,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234103990] [2022-07-22 21:45:45,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:45:45,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:45:45,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:45:45,826 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-22 21:45:45,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:45:45,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234103990] [2022-07-22 21:45:45,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234103990] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:45:45,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:45:45,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 21:45:45,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787962953] [2022-07-22 21:45:45,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:45:45,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 21:45:45,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:45:45,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 21:45:45,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-22 21:45:45,842 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 245 [2022-07-22 21:45:45,844 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-22 21:45:45,844 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:45:45,844 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 245 [2022-07-22 21:45:45,844 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:45:46,182 INFO L129 PetriNetUnfolder]: 417/981 cut-off events. [2022-07-22 21:45:46,182 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-07-22 21:45:46,186 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-22 21:45:46,193 INFO L132 encePairwiseOnDemand]: 238/245 looper letters, 61 selfloop transitions, 6 changer transitions 0/226 dead transitions. [2022-07-22 21:45:46,194 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 226 transitions, 600 flow [2022-07-22 21:45:46,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 21:45:46,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-22 21:45:46,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1293 transitions. [2022-07-22 21:45:46,198 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.753935860058309 [2022-07-22 21:45:46,198 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1293 transitions. [2022-07-22 21:45:46,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1293 transitions. [2022-07-22 21:45:46,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:45:46,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1293 transitions. [2022-07-22 21:45:46,202 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-22 21:45:46,207 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-22 21:45:46,208 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-22 21:45:46,208 INFO L186 Difference]: Start difference. First operand has 215 places, 208 transitions, 424 flow. Second operand 7 states and 1293 transitions. [2022-07-22 21:45:46,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 226 transitions, 600 flow [2022-07-22 21:45:46,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 226 transitions, 600 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-22 21:45:46,219 INFO L242 Difference]: Finished difference. Result has 215 places, 209 transitions, 444 flow [2022-07-22 21:45:46,219 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-22 21:45:46,220 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, -7 predicate places. [2022-07-22 21:45:46,220 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 209 transitions, 444 flow [2022-07-22 21:45:46,221 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-22 21:45:46,221 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:45:46,222 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-22 21:45:46,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 21:45:46,222 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-22 21:45:46,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:45:46,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1942679056, now seen corresponding path program 1 times [2022-07-22 21:45:46,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:45:46,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273167121] [2022-07-22 21:45:46,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:45:46,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:45:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:45:46,411 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-22 21:45:46,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:45:46,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273167121] [2022-07-22 21:45:46,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273167121] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:45:46,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:45:46,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 21:45:46,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708968258] [2022-07-22 21:45:46,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:45:46,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 21:45:46,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:45:46,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 21:45:46,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 21:45:46,418 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 245 [2022-07-22 21:45:46,419 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-22 21:45:46,419 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:45:46,419 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 245 [2022-07-22 21:45:46,419 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:45:46,896 INFO L129 PetriNetUnfolder]: 1105/2053 cut-off events. [2022-07-22 21:45:46,897 INFO L130 PetriNetUnfolder]: For 250/250 co-relation queries the response was YES. [2022-07-22 21:45:46,904 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-22 21:45:46,919 INFO L132 encePairwiseOnDemand]: 237/245 looper letters, 59 selfloop transitions, 19 changer transitions 0/258 dead transitions. [2022-07-22 21:45:46,920 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 258 transitions, 726 flow [2022-07-22 21:45:46,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 21:45:46,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-22 21:45:46,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1498 transitions. [2022-07-22 21:45:46,926 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8734693877551021 [2022-07-22 21:45:46,926 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1498 transitions. [2022-07-22 21:45:46,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1498 transitions. [2022-07-22 21:45:46,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:45:46,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1498 transitions. [2022-07-22 21:45:46,931 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-22 21:45:46,934 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-22 21:45:46,935 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-22 21:45:46,936 INFO L186 Difference]: Start difference. First operand has 215 places, 209 transitions, 444 flow. Second operand 7 states and 1498 transitions. [2022-07-22 21:45:46,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 258 transitions, 726 flow [2022-07-22 21:45:46,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 258 transitions, 713 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-07-22 21:45:46,943 INFO L242 Difference]: Finished difference. Result has 220 places, 223 transitions, 554 flow [2022-07-22 21:45:46,944 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-22 21:45:46,946 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, -2 predicate places. [2022-07-22 21:45:46,946 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 223 transitions, 554 flow [2022-07-22 21:45:46,947 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-22 21:45:46,947 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:45:46,948 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-22 21:45:46,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 21:45:46,948 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-22 21:45:46,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:45:46,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1928043760, now seen corresponding path program 2 times [2022-07-22 21:45:46,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:45:46,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980859799] [2022-07-22 21:45:46,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:45:46,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:45:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:45:47,115 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-22 21:45:47,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:45:47,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980859799] [2022-07-22 21:45:47,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980859799] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:45:47,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:45:47,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:45:47,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706091835] [2022-07-22 21:45:47,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:45:47,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:45:47,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:45:47,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:45:47,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:45:47,119 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 245 [2022-07-22 21:45:47,121 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-22 21:45:47,121 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:45:47,121 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 245 [2022-07-22 21:45:47,121 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:45:47,837 INFO L129 PetriNetUnfolder]: 1644/3478 cut-off events. [2022-07-22 21:45:47,838 INFO L130 PetriNetUnfolder]: For 2556/2723 co-relation queries the response was YES. [2022-07-22 21:45:47,857 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-22 21:45:47,883 INFO L132 encePairwiseOnDemand]: 237/245 looper letters, 96 selfloop transitions, 31 changer transitions 0/283 dead transitions. [2022-07-22 21:45:47,884 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 283 transitions, 1084 flow [2022-07-22 21:45:47,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 21:45:47,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-22 21:45:47,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1460 transitions. [2022-07-22 21:45:47,892 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7448979591836735 [2022-07-22 21:45:47,892 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1460 transitions. [2022-07-22 21:45:47,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1460 transitions. [2022-07-22 21:45:47,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:45:47,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1460 transitions. [2022-07-22 21:45:47,897 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-22 21:45:47,901 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-22 21:45:47,902 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-22 21:45:47,903 INFO L186 Difference]: Start difference. First operand has 220 places, 223 transitions, 554 flow. Second operand 8 states and 1460 transitions. [2022-07-22 21:45:47,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 283 transitions, 1084 flow [2022-07-22 21:45:47,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 283 transitions, 1084 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-22 21:45:47,919 INFO L242 Difference]: Finished difference. Result has 231 places, 245 transitions, 845 flow [2022-07-22 21:45:47,920 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-22 21:45:47,921 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 9 predicate places. [2022-07-22 21:45:47,922 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 245 transitions, 845 flow [2022-07-22 21:45:47,922 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-22 21:45:47,923 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:45:47,923 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-22 21:45:47,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 21:45:47,923 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-22 21:45:47,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:45:47,924 INFO L85 PathProgramCache]: Analyzing trace with hash 924192328, now seen corresponding path program 3 times [2022-07-22 21:45:47,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:45:47,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907372969] [2022-07-22 21:45:47,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:45:47,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:45:48,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:45:48,133 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-22 21:45:48,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:45:48,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907372969] [2022-07-22 21:45:48,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907372969] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:45:48,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:45:48,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 21:45:48,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635760342] [2022-07-22 21:45:48,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:45:48,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 21:45:48,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:45:48,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 21:45:48,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 21:45:48,138 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 245 [2022-07-22 21:45:48,139 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-22 21:45:48,139 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:45:48,139 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 245 [2022-07-22 21:45:48,139 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:45:49,367 INFO L129 PetriNetUnfolder]: 3510/6037 cut-off events. [2022-07-22 21:45:49,367 INFO L130 PetriNetUnfolder]: For 9890/9890 co-relation queries the response was YES. [2022-07-22 21:45:49,401 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-22 21:45:49,455 INFO L132 encePairwiseOnDemand]: 238/245 looper letters, 84 selfloop transitions, 54 changer transitions 0/322 dead transitions. [2022-07-22 21:45:49,455 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 322 transitions, 1686 flow [2022-07-22 21:45:49,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 21:45:49,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-07-22 21:45:49,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1312 transitions. [2022-07-22 21:45:49,459 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8925170068027211 [2022-07-22 21:45:49,459 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1312 transitions. [2022-07-22 21:45:49,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1312 transitions. [2022-07-22 21:45:49,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:45:49,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1312 transitions. [2022-07-22 21:45:49,463 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-22 21:45:49,466 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-22 21:45:49,467 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-22 21:45:49,467 INFO L186 Difference]: Start difference. First operand has 231 places, 245 transitions, 845 flow. Second operand 6 states and 1312 transitions. [2022-07-22 21:45:49,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 322 transitions, 1686 flow [2022-07-22 21:45:49,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 322 transitions, 1681 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-22 21:45:49,502 INFO L242 Difference]: Finished difference. Result has 237 places, 278 transitions, 1399 flow [2022-07-22 21:45:49,502 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-22 21:45:49,504 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 15 predicate places. [2022-07-22 21:45:49,504 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 278 transitions, 1399 flow [2022-07-22 21:45:49,505 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-22 21:45:49,505 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:45:49,505 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-22 21:45:49,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 21:45:49,506 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-22 21:45:49,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:45:49,507 INFO L85 PathProgramCache]: Analyzing trace with hash -317948234, now seen corresponding path program 4 times [2022-07-22 21:45:49,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:45:49,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852061128] [2022-07-22 21:45:49,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:45:49,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:45:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:45:49,662 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-22 21:45:49,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:45:49,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852061128] [2022-07-22 21:45:49,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852061128] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:45:49,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:45:49,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 21:45:49,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183745132] [2022-07-22 21:45:49,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:45:49,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 21:45:49,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:45:49,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 21:45:49,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-22 21:45:49,668 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 245 [2022-07-22 21:45:49,669 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-22 21:45:49,669 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:45:49,669 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 245 [2022-07-22 21:45:49,669 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:45:51,723 INFO L129 PetriNetUnfolder]: 5382/10455 cut-off events. [2022-07-22 21:45:51,723 INFO L130 PetriNetUnfolder]: For 24939/24939 co-relation queries the response was YES. [2022-07-22 21:45:51,776 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-22 21:45:51,846 INFO L132 encePairwiseOnDemand]: 239/245 looper letters, 119 selfloop transitions, 45 changer transitions 0/348 dead transitions. [2022-07-22 21:45:51,846 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 348 transitions, 2352 flow [2022-07-22 21:45:51,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 21:45:51,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-22 21:45:51,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1097 transitions. [2022-07-22 21:45:51,850 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8955102040816326 [2022-07-22 21:45:51,850 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1097 transitions. [2022-07-22 21:45:51,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1097 transitions. [2022-07-22 21:45:51,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:45:51,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1097 transitions. [2022-07-22 21:45:51,853 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-22 21:45:51,855 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-22 21:45:51,855 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-22 21:45:51,856 INFO L186 Difference]: Start difference. First operand has 237 places, 278 transitions, 1399 flow. Second operand 5 states and 1097 transitions. [2022-07-22 21:45:51,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 348 transitions, 2352 flow [2022-07-22 21:45:51,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 348 transitions, 2296 flow, removed 28 selfloop flow, removed 0 redundant places. [2022-07-22 21:45:51,955 INFO L242 Difference]: Finished difference. Result has 244 places, 306 transitions, 1912 flow [2022-07-22 21:45:51,956 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-22 21:45:51,956 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 22 predicate places. [2022-07-22 21:45:51,957 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 306 transitions, 1912 flow [2022-07-22 21:45:51,957 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-22 21:45:51,957 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:45:51,958 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-22 21:45:51,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 21:45:51,958 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-22 21:45:51,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:45:51,959 INFO L85 PathProgramCache]: Analyzing trace with hash 9020230, now seen corresponding path program 5 times [2022-07-22 21:45:51,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:45:51,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739766135] [2022-07-22 21:45:51,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:45:51,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:45:52,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:45:52,131 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-22 21:45:52,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:45:52,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739766135] [2022-07-22 21:45:52,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739766135] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:45:52,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:45:52,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 21:45:52,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115461921] [2022-07-22 21:45:52,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:45:52,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 21:45:52,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:45:52,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 21:45:52,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-22 21:45:52,139 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 245 [2022-07-22 21:45:52,140 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-22 21:45:52,140 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:45:52,140 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 245 [2022-07-22 21:45:52,140 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:45:53,984 INFO L129 PetriNetUnfolder]: 5517/9983 cut-off events. [2022-07-22 21:45:53,984 INFO L130 PetriNetUnfolder]: For 33294/33364 co-relation queries the response was YES. [2022-07-22 21:45:54,042 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-22 21:45:54,127 INFO L132 encePairwiseOnDemand]: 237/245 looper letters, 112 selfloop transitions, 71 changer transitions 0/367 dead transitions. [2022-07-22 21:45:54,127 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 367 transitions, 2944 flow [2022-07-22 21:45:54,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 21:45:54,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-22 21:45:54,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1093 transitions. [2022-07-22 21:45:54,131 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8922448979591837 [2022-07-22 21:45:54,131 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1093 transitions. [2022-07-22 21:45:54,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1093 transitions. [2022-07-22 21:45:54,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:45:54,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1093 transitions. [2022-07-22 21:45:54,135 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-22 21:45:54,137 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-22 21:45:54,137 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-22 21:45:54,138 INFO L186 Difference]: Start difference. First operand has 244 places, 306 transitions, 1912 flow. Second operand 5 states and 1093 transitions. [2022-07-22 21:45:54,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 367 transitions, 2944 flow [2022-07-22 21:45:54,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 367 transitions, 2935 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-07-22 21:45:54,209 INFO L242 Difference]: Finished difference. Result has 251 places, 336 transitions, 2706 flow [2022-07-22 21:45:54,210 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-22 21:45:54,211 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 29 predicate places. [2022-07-22 21:45:54,212 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 336 transitions, 2706 flow [2022-07-22 21:45:54,212 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-22 21:45:54,212 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:45:54,213 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-22 21:45:54,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 21:45:54,213 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-22 21:45:54,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:45:54,214 INFO L85 PathProgramCache]: Analyzing trace with hash -842712950, now seen corresponding path program 6 times [2022-07-22 21:45:54,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:45:54,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982763143] [2022-07-22 21:45:54,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:45:54,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:45:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:45:54,339 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-22 21:45:54,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:45:54,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982763143] [2022-07-22 21:45:54,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982763143] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:45:54,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:45:54,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 21:45:54,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272027364] [2022-07-22 21:45:54,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:45:54,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 21:45:54,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:45:54,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 21:45:54,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-22 21:45:54,344 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 245 [2022-07-22 21:45:54,345 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-22 21:45:54,345 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:45:54,345 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 245 [2022-07-22 21:45:54,345 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:45:56,049 INFO L129 PetriNetUnfolder]: 5138/9387 cut-off events. [2022-07-22 21:45:56,050 INFO L130 PetriNetUnfolder]: For 43500/43512 co-relation queries the response was YES. [2022-07-22 21:45:56,099 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-22 21:45:56,161 INFO L132 encePairwiseOnDemand]: 240/245 looper letters, 171 selfloop transitions, 13 changer transitions 0/368 dead transitions. [2022-07-22 21:45:56,161 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 368 transitions, 3317 flow [2022-07-22 21:45:56,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 21:45:56,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-22 21:45:56,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1088 transitions. [2022-07-22 21:45:56,164 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8881632653061224 [2022-07-22 21:45:56,164 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1088 transitions. [2022-07-22 21:45:56,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1088 transitions. [2022-07-22 21:45:56,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:45:56,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1088 transitions. [2022-07-22 21:45:56,167 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-22 21:45:56,169 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-22 21:45:56,170 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-22 21:45:56,170 INFO L186 Difference]: Start difference. First operand has 251 places, 336 transitions, 2706 flow. Second operand 5 states and 1088 transitions. [2022-07-22 21:45:56,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 368 transitions, 3317 flow [2022-07-22 21:45:56,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 368 transitions, 3315 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-07-22 21:45:56,271 INFO L242 Difference]: Finished difference. Result has 257 places, 339 transitions, 2795 flow [2022-07-22 21:45:56,272 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-22 21:45:56,272 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 35 predicate places. [2022-07-22 21:45:56,273 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 339 transitions, 2795 flow [2022-07-22 21:45:56,273 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-22 21:45:56,273 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:45:56,274 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-22 21:45:56,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 21:45:56,274 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-22 21:45:56,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:45:56,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1004322472, now seen corresponding path program 7 times [2022-07-22 21:45:56,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:45:56,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194993341] [2022-07-22 21:45:56,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:45:56,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:45:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:45:56,448 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-22 21:45:56,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:45:56,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194993341] [2022-07-22 21:45:56,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194993341] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:45:56,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:45:56,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 21:45:56,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223370074] [2022-07-22 21:45:56,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:45:56,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 21:45:56,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:45:56,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 21:45:56,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-22 21:45:56,452 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 245 [2022-07-22 21:45:56,453 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-22 21:45:56,453 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:45:56,453 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 245 [2022-07-22 21:45:56,453 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:45:58,079 INFO L129 PetriNetUnfolder]: 5845/10091 cut-off events. [2022-07-22 21:45:58,080 INFO L130 PetriNetUnfolder]: For 50752/50752 co-relation queries the response was YES. [2022-07-22 21:45:58,160 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-22 21:45:58,227 INFO L132 encePairwiseOnDemand]: 238/245 looper letters, 168 selfloop transitions, 54 changer transitions 0/406 dead transitions. [2022-07-22 21:45:58,228 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 406 transitions, 3990 flow [2022-07-22 21:45:58,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 21:45:58,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-22 21:45:58,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1094 transitions. [2022-07-22 21:45:58,236 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.893061224489796 [2022-07-22 21:45:58,236 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1094 transitions. [2022-07-22 21:45:58,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1094 transitions. [2022-07-22 21:45:58,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:45:58,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1094 transitions. [2022-07-22 21:45:58,242 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-22 21:45:58,249 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-22 21:45:58,250 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-22 21:45:58,250 INFO L186 Difference]: Start difference. First operand has 257 places, 339 transitions, 2795 flow. Second operand 5 states and 1094 transitions. [2022-07-22 21:45:58,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 406 transitions, 3990 flow [2022-07-22 21:45:58,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 406 transitions, 3967 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-07-22 21:45:58,376 INFO L242 Difference]: Finished difference. Result has 262 places, 362 transitions, 3427 flow [2022-07-22 21:45:58,377 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-22 21:45:58,377 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 40 predicate places. [2022-07-22 21:45:58,378 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 362 transitions, 3427 flow [2022-07-22 21:45:58,378 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-22 21:45:58,378 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:45:58,378 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-22 21:45:58,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 21:45:58,379 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-22 21:45:58,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:45:58,379 INFO L85 PathProgramCache]: Analyzing trace with hash -2123012021, now seen corresponding path program 1 times [2022-07-22 21:45:58,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:45:58,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258321545] [2022-07-22 21:45:58,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:45:58,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:45:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:45:58,469 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-22 21:45:58,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:45:58,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258321545] [2022-07-22 21:45:58,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258321545] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:45:58,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:45:58,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 21:45:58,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892128026] [2022-07-22 21:45:58,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:45:58,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:45:58,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:45:58,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:45:58,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:45:58,479 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 245 [2022-07-22 21:45:58,480 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-22 21:45:58,480 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:45:58,480 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 245 [2022-07-22 21:45:58,480 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:45:59,559 INFO L129 PetriNetUnfolder]: 2348/5677 cut-off events. [2022-07-22 21:45:59,559 INFO L130 PetriNetUnfolder]: For 55376/60946 co-relation queries the response was YES. [2022-07-22 21:45:59,605 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-22 21:45:59,642 INFO L132 encePairwiseOnDemand]: 234/245 looper letters, 92 selfloop transitions, 8 changer transitions 19/385 dead transitions. [2022-07-22 21:45:59,642 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 385 transitions, 3715 flow [2022-07-22 21:45:59,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 21:45:59,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-22 21:45:59,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1800 transitions. [2022-07-22 21:45:59,646 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8163265306122449 [2022-07-22 21:45:59,646 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1800 transitions. [2022-07-22 21:45:59,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1800 transitions. [2022-07-22 21:45:59,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:45:59,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1800 transitions. [2022-07-22 21:45:59,652 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-22 21:45:59,656 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-22 21:45:59,657 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-22 21:45:59,657 INFO L186 Difference]: Start difference. First operand has 262 places, 362 transitions, 3427 flow. Second operand 9 states and 1800 transitions. [2022-07-22 21:45:59,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 385 transitions, 3715 flow [2022-07-22 21:45:59,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 385 transitions, 3706 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-07-22 21:45:59,749 INFO L242 Difference]: Finished difference. Result has 271 places, 363 transitions, 3458 flow [2022-07-22 21:45:59,750 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-22 21:45:59,750 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 49 predicate places. [2022-07-22 21:45:59,751 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 363 transitions, 3458 flow [2022-07-22 21:45:59,751 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-22 21:45:59,752 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:45:59,752 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-22 21:45:59,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-22 21:45:59,752 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-22 21:45:59,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:45:59,753 INFO L85 PathProgramCache]: Analyzing trace with hash 930183216, now seen corresponding path program 1 times [2022-07-22 21:45:59,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:45:59,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977063117] [2022-07-22 21:45:59,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:45:59,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:45:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:46:00,564 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-22 21:46:00,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:46:00,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977063117] [2022-07-22 21:46:00,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977063117] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:46:00,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554620710] [2022-07-22 21:46:00,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:46:00,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:46:00,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:46:00,568 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-22 21:46:00,572 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-22 21:46:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:46:00,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-22 21:46:00,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:46:00,928 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-22 21:46:00,984 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 21:46:00,985 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-22 21:46:01,043 INFO L356 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-07-22 21:46:01,044 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-22 21:46:02,047 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-07-22 21:46:02,047 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-22 21:46:02,278 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-22 21:46:03,358 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-22 21:46:03,505 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-22 21:46:03,639 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-22 21:46:03,732 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-22 21:46:04,027 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-22 21:46:04,062 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-22 21:46:04,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:46:06,334 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:46:06,335 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-22 21:46:06,351 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-22 21:46:06,367 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-22 21:46:06,377 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-22 21:46:06,389 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-22 21:46:06,400 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-22 21:46:08,483 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-22 21:46:08,502 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-22 21:46:08,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554620710] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:46:08,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:46:08,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 29, 26] total 66 [2022-07-22 21:46:08,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533426811] [2022-07-22 21:46:08,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:46:08,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-07-22 21:46:08,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:46:08,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-07-22 21:46:08,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=706, Invalid=3511, Unknown=73, NotChecked=0, Total=4290 [2022-07-22 21:46:08,512 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 245 [2022-07-22 21:46:08,518 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-22 21:46:08,518 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:46:08,518 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 245 [2022-07-22 21:46:08,518 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:46:19,608 INFO L129 PetriNetUnfolder]: 16249/31797 cut-off events. [2022-07-22 21:46:19,609 INFO L130 PetriNetUnfolder]: For 314882/320916 co-relation queries the response was YES. [2022-07-22 21:46:19,872 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-22 21:46:20,156 INFO L132 encePairwiseOnDemand]: 202/245 looper letters, 662 selfloop transitions, 161 changer transitions 16/965 dead transitions. [2022-07-22 21:46:20,156 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 965 transitions, 13687 flow [2022-07-22 21:46:20,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-07-22 21:46:20,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2022-07-22 21:46:20,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 6404 transitions. [2022-07-22 21:46:20,173 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.4752504638218924 [2022-07-22 21:46:20,173 INFO L72 ComplementDD]: Start complementDD. Operand 55 states and 6404 transitions. [2022-07-22 21:46:20,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 6404 transitions. [2022-07-22 21:46:20,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:46:20,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 55 states and 6404 transitions. [2022-07-22 21:46:20,191 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-22 21:46:20,211 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-22 21:46:20,214 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-22 21:46:20,214 INFO L186 Difference]: Start difference. First operand has 271 places, 363 transitions, 3458 flow. Second operand 55 states and 6404 transitions. [2022-07-22 21:46:20,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 965 transitions, 13687 flow [2022-07-22 21:46:20,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 965 transitions, 13575 flow, removed 46 selfloop flow, removed 6 redundant places. [2022-07-22 21:46:20,727 INFO L242 Difference]: Finished difference. Result has 345 places, 515 transitions, 6160 flow [2022-07-22 21:46:20,727 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-22 21:46:20,728 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 123 predicate places. [2022-07-22 21:46:20,728 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 515 transitions, 6160 flow [2022-07-22 21:46:20,730 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-22 21:46:20,731 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:46:20,731 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-22 21:46:20,759 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-22 21:46:20,947 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-22 21:46:20,948 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-22 21:46:20,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:46:20,948 INFO L85 PathProgramCache]: Analyzing trace with hash -285812815, now seen corresponding path program 1 times [2022-07-22 21:46:20,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:46:20,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119521404] [2022-07-22 21:46:20,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:46:20,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:46:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:46:21,032 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-22 21:46:21,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:46:21,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119521404] [2022-07-22 21:46:21,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119521404] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:46:21,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:46:21,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 21:46:21,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980064450] [2022-07-22 21:46:21,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:46:21,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:46:21,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:46:21,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:46:21,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:46:21,035 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 245 [2022-07-22 21:46:21,036 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-22 21:46:21,036 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:46:21,037 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 245 [2022-07-22 21:46:21,037 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:46:23,994 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)))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_front~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) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (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) (not (< ~q1_back~0 ~n1~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0))) (< |#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|)) (< |#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) (or (<= (+ ~q1_back~0 1) ~q1_front~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)))))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_front~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) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (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) (not (< ~q1_back~0 ~n1~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0))) (< |#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) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (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) (not (< ~q1_back~0 ~n1~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~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))), Black: 1148#(or (<= (+ ~q1_back~0 1) ~q1_front~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)))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_front~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|)) (< |#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) (or (<= (+ ~q1_back~0 1) ~q1_front~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)))))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_front~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) (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)))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_front~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|)) (< |#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) (or (<= (+ ~q1_back~0 1) ~q1_front~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)))))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_front~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|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (<= (+ ~q1_back~0 1) ~q1_front~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)))))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_front~0)))), 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-22 21:46:23,995 INFO L384 tUnfolder$Statistics]: this new event has 177 ancestors and is cut-off event [2022-07-22 21:46:23,996 INFO L387 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-07-22 21:46:23,996 INFO L387 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-07-22 21:46:23,996 INFO L387 tUnfolder$Statistics]: existing Event has 171 ancestors and is cut-off event [2022-07-22 21:46:24,381 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)))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_front~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) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (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) (not (< ~q1_back~0 ~n1~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0))) (< |#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|)) (< |#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) (or (<= (+ ~q1_back~0 1) ~q1_front~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)))))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_front~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) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (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) (not (< ~q1_back~0 ~n1~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0))) (< |#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) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (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) (not (< ~q1_back~0 ~n1~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~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))), Black: 1148#(or (<= (+ ~q1_back~0 1) ~q1_front~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)))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_front~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|)) (< |#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) (or (<= (+ ~q1_back~0 1) ~q1_front~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)))))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_front~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) (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)))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_front~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|)) (< |#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) (or (<= (+ ~q1_back~0 1) ~q1_front~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)))))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_front~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|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (<= (+ ~q1_back~0 1) ~q1_front~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)))))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_front~0)))), 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-22 21:46:24,382 INFO L384 tUnfolder$Statistics]: this new event has 178 ancestors and is cut-off event [2022-07-22 21:46:24,383 INFO L387 tUnfolder$Statistics]: existing Event has 178 ancestors and is cut-off event [2022-07-22 21:46:24,383 INFO L387 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-07-22 21:46:24,383 INFO L387 tUnfolder$Statistics]: existing Event has 178 ancestors and is cut-off event [2022-07-22 21:46:24,383 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)))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_front~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) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (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) (not (< ~q1_back~0 ~n1~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0))) (< |#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|)) (< |#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) (or (<= (+ ~q1_back~0 1) ~q1_front~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)))))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_front~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) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (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) (not (< ~q1_back~0 ~n1~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0))) (< |#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) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (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) (not (< ~q1_back~0 ~n1~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~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))), Black: 1148#(or (<= (+ ~q1_back~0 1) ~q1_front~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)))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_front~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|)) (< |#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) (or (<= (+ ~q1_back~0 1) ~q1_front~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)))))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_front~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) (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)))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_front~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|)) (< |#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) (or (<= (+ ~q1_back~0 1) ~q1_front~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)))))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_front~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|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (<= (+ ~q1_back~0 1) ~q1_front~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)))))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_front~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)), 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-22 21:46:24,384 INFO L384 tUnfolder$Statistics]: this new event has 179 ancestors and is cut-off event [2022-07-22 21:46:24,384 INFO L387 tUnfolder$Statistics]: existing Event has 179 ancestors and is cut-off event [2022-07-22 21:46:24,384 INFO L387 tUnfolder$Statistics]: existing Event has 173 ancestors and is cut-off event [2022-07-22 21:46:24,384 INFO L387 tUnfolder$Statistics]: existing Event has 179 ancestors and is cut-off event [2022-07-22 21:46:24,692 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)))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_front~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) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (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) (not (< ~q1_back~0 ~n1~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0))) (< |#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|)) (< |#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) (or (<= (+ ~q1_back~0 1) ~q1_front~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)))))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_front~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) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (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) (not (< ~q1_back~0 ~n1~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0))) (< |#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) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (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) (not (< ~q1_back~0 ~n1~0)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~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))), Black: 1148#(or (<= (+ ~q1_back~0 1) ~q1_front~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)))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_front~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|)) (< |#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) (or (<= (+ ~q1_back~0 1) ~q1_front~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)))))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_front~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) (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)))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_front~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|)) (< |#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) (or (<= (+ ~q1_back~0 1) ~q1_front~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)))))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_front~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|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (<= (+ ~q1_back~0 1) ~q1_front~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)))))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_front~0)))), 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-22 21:46:24,693 INFO L384 tUnfolder$Statistics]: this new event has 183 ancestors and is cut-off event [2022-07-22 21:46:24,693 INFO L387 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-07-22 21:46:24,693 INFO L387 tUnfolder$Statistics]: existing Event has 183 ancestors and is cut-off event [2022-07-22 21:46:24,693 INFO L387 tUnfolder$Statistics]: existing Event has 183 ancestors and is cut-off event [2022-07-22 21:46:26,132 INFO L129 PetriNetUnfolder]: 9168/22632 cut-off events. [2022-07-22 21:46:26,133 INFO L130 PetriNetUnfolder]: For 247910/263193 co-relation queries the response was YES. [2022-07-22 21:46:26,433 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-22 21:46:26,559 INFO L132 encePairwiseOnDemand]: 236/245 looper letters, 333 selfloop transitions, 8 changer transitions 47/671 dead transitions. [2022-07-22 21:46:26,560 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 671 transitions, 9797 flow [2022-07-22 21:46:26,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 21:46:26,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-22 21:46:26,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1406 transitions. [2022-07-22 21:46:26,563 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8198250728862974 [2022-07-22 21:46:26,563 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1406 transitions. [2022-07-22 21:46:26,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1406 transitions. [2022-07-22 21:46:26,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:46:26,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1406 transitions. [2022-07-22 21:46:26,565 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-22 21:46:26,567 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-22 21:46:26,568 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-22 21:46:26,568 INFO L186 Difference]: Start difference. First operand has 345 places, 515 transitions, 6160 flow. Second operand 7 states and 1406 transitions. [2022-07-22 21:46:26,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 671 transitions, 9797 flow [2022-07-22 21:46:27,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 671 transitions, 9697 flow, removed 36 selfloop flow, removed 18 redundant places. [2022-07-22 21:46:27,039 INFO L242 Difference]: Finished difference. Result has 330 places, 517 transitions, 6136 flow [2022-07-22 21:46:27,040 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-22 21:46:27,040 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 108 predicate places. [2022-07-22 21:46:27,040 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 517 transitions, 6136 flow [2022-07-22 21:46:27,041 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-22 21:46:27,041 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:46:27,041 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-22 21:46:27,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 21:46:27,042 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-22 21:46:27,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:46:27,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1842698929, now seen corresponding path program 2 times [2022-07-22 21:46:27,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:46:27,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003530507] [2022-07-22 21:46:27,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:46:27,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:46:27,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:46:28,599 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-22 21:46:28,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:46:28,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003530507] [2022-07-22 21:46:28,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003530507] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:46:28,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978028801] [2022-07-22 21:46:28,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 21:46:28,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:46:28,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:46:28,604 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-22 21:46:28,608 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-22 21:46:28,762 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 21:46:28,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 21:46:28,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-22 21:46:28,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:46:28,877 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-22 21:46:29,441 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 21:46:29,441 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-22 21:46:29,831 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-22 21:46:30,856 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-22 21:46:31,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 21:46:31,130 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-22 21:46:31,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 21:46:31,329 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-22 21:46:31,566 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-22 21:46:31,734 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-22 21:46:31,779 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-22 21:46:31,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:46:33,838 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:46:33,838 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-22 21:46:33,842 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-22 21:46:33,848 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-22 21:46:33,855 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-22 21:46:33,863 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-22 21:46:33,872 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-22 21:46:36,121 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-22 21:46:36,126 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-22 21:46:36,133 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-22 21:46:36,247 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-22 21:46:36,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978028801] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:46:36,248 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:46:36,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31, 32] total 81 [2022-07-22 21:46:36,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081330168] [2022-07-22 21:46:36,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:46:36,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-07-22 21:46:36,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:46:36,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-07-22 21:46:36,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=5924, Unknown=57, NotChecked=0, Total=6480 [2022-07-22 21:46:36,257 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 245 [2022-07-22 21:46:36,263 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-22 21:46:36,264 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:46:36,264 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 245 [2022-07-22 21:46:36,264 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand