./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-channel-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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-channel-sum.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 c902137dd689344b33e1214981c74c26e47854ade5db7e5e71980f90fd07d90c --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 10:29:59,730 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:29:59,731 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:29:59,757 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:29:59,758 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:29:59,758 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:29:59,762 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:29:59,765 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:29:59,766 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:29:59,770 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:29:59,770 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:29:59,772 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:29:59,772 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:29:59,773 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:29:59,775 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:29:59,775 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:29:59,776 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:29:59,777 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:29:59,780 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:29:59,783 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:29:59,785 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:29:59,785 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:29:59,786 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:29:59,786 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:29:59,787 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:29:59,791 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:29:59,791 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:29:59,792 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:29:59,792 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:29:59,793 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:29:59,793 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:29:59,794 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:29:59,795 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:29:59,796 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:29:59,796 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:29:59,797 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:29:59,797 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:29:59,797 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:29:59,798 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:29:59,798 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:29:59,798 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:29:59,799 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:29:59,800 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 10:29:59,821 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:29:59,821 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:29:59,822 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:29:59,822 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:29:59,822 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:29:59,822 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:29:59,823 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:29:59,823 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:29:59,823 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:29:59,824 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:29:59,824 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 10:29:59,824 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 10:29:59,824 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 10:29:59,824 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:29:59,824 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:29:59,825 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:29:59,825 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:29:59,825 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 10:29:59,825 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:29:59,825 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:29:59,825 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:29:59,825 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:29:59,825 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:29:59,826 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:29:59,826 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:29:59,827 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:29:59,827 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:29:59,827 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:29:59,827 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 10:29:59,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 10:29:59,827 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:29:59,827 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:29:59,828 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:29:59,828 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 -> c902137dd689344b33e1214981c74c26e47854ade5db7e5e71980f90fd07d90c [2022-07-12 10:30:00,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:30:00,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:30:00,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:30:00,050 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:30:00,050 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:30:00,051 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-channel-sum.wvr.c [2022-07-12 10:30:00,103 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff1ac17ce/26a8f61273014a9db7b57433bd8b83a2/FLAG8a40f04d9 [2022-07-12 10:30:00,479 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:30:00,480 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-channel-sum.wvr.c [2022-07-12 10:30:00,484 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff1ac17ce/26a8f61273014a9db7b57433bd8b83a2/FLAG8a40f04d9 [2022-07-12 10:30:00,493 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff1ac17ce/26a8f61273014a9db7b57433bd8b83a2 [2022-07-12 10:30:00,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:30:00,495 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:30:00,499 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:30:00,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:30:00,502 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:30:00,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:30:00" (1/1) ... [2022-07-12 10:30:00,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e26a6b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:30:00, skipping insertion in model container [2022-07-12 10:30:00,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:30:00" (1/1) ... [2022-07-12 10:30:00,509 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:30:00,523 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:30:00,637 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-channel-sum.wvr.c[2947,2960] [2022-07-12 10:30:00,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:30:00,661 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 10:30:00,675 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-channel-sum.wvr.c[2947,2960] [2022-07-12 10:30:00,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:30:00,691 INFO L208 MainTranslator]: Completed translation [2022-07-12 10:30:00,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:30:00 WrapperNode [2022-07-12 10:30:00,692 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 10:30:00,693 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 10:30:00,693 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 10:30:00,693 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 10:30:00,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:30:00" (1/1) ... [2022-07-12 10:30:00,745 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:30:00" (1/1) ... [2022-07-12 10:30:00,760 INFO L137 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 151 [2022-07-12 10:30:00,761 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 10:30:00,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 10:30:00,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 10:30:00,762 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 10:30:00,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:30:00" (1/1) ... [2022-07-12 10:30:00,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:30:00" (1/1) ... [2022-07-12 10:30:00,772 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:30:00" (1/1) ... [2022-07-12 10:30:00,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:30:00" (1/1) ... [2022-07-12 10:30:00,779 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:30:00" (1/1) ... [2022-07-12 10:30:00,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:30:00" (1/1) ... [2022-07-12 10:30:00,794 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:30:00" (1/1) ... [2022-07-12 10:30:00,803 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 10:30:00,803 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 10:30:00,803 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 10:30:00,804 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 10:30:00,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:30:00" (1/1) ... [2022-07-12 10:30:00,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:30:00,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:30:00,832 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-12 10:30:00,838 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-12 10:30:00,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 10:30:00,864 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-12 10:30:00,864 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-12 10:30:00,864 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-12 10:30:00,864 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-12 10:30:00,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 10:30:00,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 10:30:00,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 10:30:00,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-12 10:30:00,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-12 10:30:00,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 10:30:00,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 10:30:00,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 10:30:00,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 10:30:00,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 10:30:00,866 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-12 10:30:00,926 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 10:30:00,927 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 10:30:01,125 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 10:30:01,162 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 10:30:01,163 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-12 10:30:01,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:30:01 BoogieIcfgContainer [2022-07-12 10:30:01,164 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 10:30:01,165 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 10:30:01,165 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 10:30:01,171 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 10:30:01,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 10:30:00" (1/3) ... [2022-07-12 10:30:01,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@369fb51a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:30:01, skipping insertion in model container [2022-07-12 10:30:01,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:30:00" (2/3) ... [2022-07-12 10:30:01,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@369fb51a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:30:01, skipping insertion in model container [2022-07-12 10:30:01,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:30:01" (3/3) ... [2022-07-12 10:30:01,174 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-channel-sum.wvr.c [2022-07-12 10:30:01,177 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-12 10:30:01,183 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 10:30:01,183 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 10:30:01,183 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-12 10:30:01,232 INFO L135 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-12 10:30:01,259 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 138 places, 142 transitions, 300 flow [2022-07-12 10:30:01,299 INFO L129 PetriNetUnfolder]: 11/140 cut-off events. [2022-07-12 10:30:01,299 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-12 10:30:01,302 INFO L84 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 140 events. 11/140 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 125 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2022-07-12 10:30:01,303 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 142 transitions, 300 flow [2022-07-12 10:30:01,306 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 131 transitions, 274 flow [2022-07-12 10:30:01,314 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:30:01,319 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@19569520, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@b947bdb [2022-07-12 10:30:01,319 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-07-12 10:30:01,336 INFO L129 PetriNetUnfolder]: 11/130 cut-off events. [2022-07-12 10:30:01,336 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-12 10:30:01,337 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:30:01,337 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] [2022-07-12 10:30:01,338 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:30:01,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:30:01,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1559977782, now seen corresponding path program 1 times [2022-07-12 10:30:01,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:30:01,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338298078] [2022-07-12 10:30:01,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:30:01,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:30:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:30:01,527 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-12 10:30:01,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:30:01,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338298078] [2022-07-12 10:30:01,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338298078] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:30:01,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:30:01,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 10:30:01,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765640703] [2022-07-12 10:30:01,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:30:01,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 10:30:01,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:30:01,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 10:30:01,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 10:30:01,566 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 142 [2022-07-12 10:30:01,572 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 131 transitions, 274 flow. Second operand has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 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-12 10:30:01,572 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:30:01,572 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 142 [2022-07-12 10:30:01,573 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:30:01,619 INFO L129 PetriNetUnfolder]: 11/144 cut-off events. [2022-07-12 10:30:01,619 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-07-12 10:30:01,621 INFO L84 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 144 events. 11/144 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 200 event pairs, 4 based on Foata normal form. 18/152 useless extension candidates. Maximal degree in co-relation 95. Up to 21 conditions per place. [2022-07-12 10:30:01,623 INFO L132 encePairwiseOnDemand]: 135/142 looper letters, 9 selfloop transitions, 0 changer transitions 3/124 dead transitions. [2022-07-12 10:30:01,624 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 124 transitions, 278 flow [2022-07-12 10:30:01,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 10:30:01,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-12 10:30:01,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 266 transitions. [2022-07-12 10:30:01,635 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9366197183098591 [2022-07-12 10:30:01,636 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 266 transitions. [2022-07-12 10:30:01,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 266 transitions. [2022-07-12 10:30:01,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:30:01,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 266 transitions. [2022-07-12 10:30:01,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 133.0) internal successors, (266), 2 states have internal predecessors, (266), 0 states have call successors, (0), 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-12 10:30:01,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 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-12 10:30:01,647 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 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-12 10:30:01,648 INFO L186 Difference]: Start difference. First operand has 127 places, 131 transitions, 274 flow. Second operand 2 states and 266 transitions. [2022-07-12 10:30:01,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 124 transitions, 278 flow [2022-07-12 10:30:01,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 124 transitions, 270 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-12 10:30:01,653 INFO L242 Difference]: Finished difference. Result has 124 places, 121 transitions, 246 flow [2022-07-12 10:30:01,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=246, PETRI_PLACES=124, PETRI_TRANSITIONS=121} [2022-07-12 10:30:01,657 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, -3 predicate places. [2022-07-12 10:30:01,657 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 121 transitions, 246 flow [2022-07-12 10:30:01,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 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-12 10:30:01,657 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:30:01,657 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] [2022-07-12 10:30:01,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 10:30:01,658 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:30:01,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:30:01,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1549083886, now seen corresponding path program 1 times [2022-07-12 10:30:01,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:30:01,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226477790] [2022-07-12 10:30:01,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:30:01,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:30:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:30:01,849 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-12 10:30:01,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:30:01,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226477790] [2022-07-12 10:30:01,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226477790] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:30:01,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:30:01,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 10:30:01,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54699635] [2022-07-12 10:30:01,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:30:01,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 10:30:01,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:30:01,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 10:30:01,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 10:30:01,855 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 142 [2022-07-12 10:30:01,856 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 121 transitions, 246 flow. Second operand has 5 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:30:01,856 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:30:01,856 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 142 [2022-07-12 10:30:01,856 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:30:01,972 INFO L129 PetriNetUnfolder]: 27/291 cut-off events. [2022-07-12 10:30:01,973 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-07-12 10:30:01,974 INFO L84 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 291 events. 27/291 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1048 event pairs, 4 based on Foata normal form. 1/268 useless extension candidates. Maximal degree in co-relation 359. Up to 34 conditions per place. [2022-07-12 10:30:01,975 INFO L132 encePairwiseOnDemand]: 137/142 looper letters, 29 selfloop transitions, 2 changer transitions 4/133 dead transitions. [2022-07-12 10:30:01,975 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 133 transitions, 343 flow [2022-07-12 10:30:01,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 10:30:01,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-12 10:30:01,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-07-12 10:30:01,979 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8112676056338028 [2022-07-12 10:30:01,979 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 576 transitions. [2022-07-12 10:30:01,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 576 transitions. [2022-07-12 10:30:01,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:30:01,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 576 transitions. [2022-07-12 10:30:01,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 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-12 10:30:01,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 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-12 10:30:01,985 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 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-12 10:30:01,985 INFO L186 Difference]: Start difference. First operand has 124 places, 121 transitions, 246 flow. Second operand 5 states and 576 transitions. [2022-07-12 10:30:01,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 133 transitions, 343 flow [2022-07-12 10:30:01,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 133 transitions, 343 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-12 10:30:01,987 INFO L242 Difference]: Finished difference. Result has 128 places, 122 transitions, 262 flow [2022-07-12 10:30:01,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=262, PETRI_PLACES=128, PETRI_TRANSITIONS=122} [2022-07-12 10:30:01,988 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, 1 predicate places. [2022-07-12 10:30:01,989 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 122 transitions, 262 flow [2022-07-12 10:30:01,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:30:01,989 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:30:01,989 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] [2022-07-12 10:30:01,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 10:30:01,990 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:30:01,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:30:01,990 INFO L85 PathProgramCache]: Analyzing trace with hash -37819436, now seen corresponding path program 1 times [2022-07-12 10:30:01,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:30:01,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159722703] [2022-07-12 10:30:01,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:30:01,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:30:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:30:02,092 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-12 10:30:02,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:30:02,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159722703] [2022-07-12 10:30:02,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159722703] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:30:02,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:30:02,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 10:30:02,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846769105] [2022-07-12 10:30:02,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:30:02,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 10:30:02,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:30:02,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 10:30:02,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 10:30:02,099 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 142 [2022-07-12 10:30:02,100 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 122 transitions, 262 flow. Second operand has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 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-12 10:30:02,100 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:30:02,100 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 142 [2022-07-12 10:30:02,100 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:30:02,206 INFO L129 PetriNetUnfolder]: 105/445 cut-off events. [2022-07-12 10:30:02,206 INFO L130 PetriNetUnfolder]: For 16/17 co-relation queries the response was YES. [2022-07-12 10:30:02,209 INFO L84 FinitePrefix]: Finished finitePrefix Result has 666 conditions, 445 events. 105/445 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1676 event pairs, 46 based on Foata normal form. 0/411 useless extension candidates. Maximal degree in co-relation 659. Up to 163 conditions per place. [2022-07-12 10:30:02,211 INFO L132 encePairwiseOnDemand]: 137/142 looper letters, 27 selfloop transitions, 6 changer transitions 3/137 dead transitions. [2022-07-12 10:30:02,212 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 137 transitions, 367 flow [2022-07-12 10:30:02,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 10:30:02,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-07-12 10:30:02,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-07-12 10:30:02,216 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8609154929577465 [2022-07-12 10:30:02,222 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 489 transitions. [2022-07-12 10:30:02,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 489 transitions. [2022-07-12 10:30:02,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:30:02,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 489 transitions. [2022-07-12 10:30:02,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 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-12 10:30:02,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 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-12 10:30:02,228 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 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-12 10:30:02,229 INFO L186 Difference]: Start difference. First operand has 128 places, 122 transitions, 262 flow. Second operand 4 states and 489 transitions. [2022-07-12 10:30:02,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 137 transitions, 367 flow [2022-07-12 10:30:02,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 137 transitions, 361 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-07-12 10:30:02,234 INFO L242 Difference]: Finished difference. Result has 128 places, 127 transitions, 293 flow [2022-07-12 10:30:02,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=293, PETRI_PLACES=128, PETRI_TRANSITIONS=127} [2022-07-12 10:30:02,236 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, 1 predicate places. [2022-07-12 10:30:02,236 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 127 transitions, 293 flow [2022-07-12 10:30:02,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 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-12 10:30:02,237 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:30:02,237 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] [2022-07-12 10:30:02,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 10:30:02,238 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:30:02,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:30:02,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1603560773, now seen corresponding path program 1 times [2022-07-12 10:30:02,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:30:02,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993493149] [2022-07-12 10:30:02,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:30:02,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:30:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:30:02,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:30:02,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:30:02,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993493149] [2022-07-12 10:30:02,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993493149] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:30:02,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444307081] [2022-07-12 10:30:02,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:30:02,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:30:02,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:30:02,386 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-12 10:30:02,395 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-12 10:30:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:30:02,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 10:30:02,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:30:02,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:30:02,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:30:02,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:30:02,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444307081] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:30:02,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:30:02,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 9 [2022-07-12 10:30:02,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186761526] [2022-07-12 10:30:02,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:30:02,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:30:02,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:30:02,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:30:02,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-12 10:30:02,845 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 142 [2022-07-12 10:30:02,847 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 127 transitions, 293 flow. Second operand has 9 states, 9 states have (on average 116.33333333333333) internal successors, (1047), 9 states have internal predecessors, (1047), 0 states have call successors, (0), 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-12 10:30:02,847 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:30:02,848 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 142 [2022-07-12 10:30:02,848 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:30:02,993 INFO L129 PetriNetUnfolder]: 127/527 cut-off events. [2022-07-12 10:30:02,993 INFO L130 PetriNetUnfolder]: For 85/85 co-relation queries the response was YES. [2022-07-12 10:30:02,994 INFO L84 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 527 events. 127/527 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2351 event pairs, 20 based on Foata normal form. 8/506 useless extension candidates. Maximal degree in co-relation 868. Up to 90 conditions per place. [2022-07-12 10:30:02,997 INFO L132 encePairwiseOnDemand]: 135/142 looper letters, 30 selfloop transitions, 6 changer transitions 26/163 dead transitions. [2022-07-12 10:30:02,997 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 163 transitions, 512 flow [2022-07-12 10:30:02,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 10:30:02,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-12 10:30:02,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 968 transitions. [2022-07-12 10:30:02,999 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.852112676056338 [2022-07-12 10:30:03,003 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 968 transitions. [2022-07-12 10:30:03,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 968 transitions. [2022-07-12 10:30:03,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:30:03,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 968 transitions. [2022-07-12 10:30:03,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 121.0) internal successors, (968), 8 states have internal predecessors, (968), 0 states have call successors, (0), 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-12 10:30:03,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 142.0) internal successors, (1278), 9 states have internal predecessors, (1278), 0 states have call successors, (0), 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-12 10:30:03,008 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 142.0) internal successors, (1278), 9 states have internal predecessors, (1278), 0 states have call successors, (0), 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-12 10:30:03,008 INFO L186 Difference]: Start difference. First operand has 128 places, 127 transitions, 293 flow. Second operand 8 states and 968 transitions. [2022-07-12 10:30:03,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 163 transitions, 512 flow [2022-07-12 10:30:03,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 163 transitions, 512 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-12 10:30:03,013 INFO L242 Difference]: Finished difference. Result has 136 places, 124 transitions, 293 flow [2022-07-12 10:30:03,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=293, PETRI_PLACES=136, PETRI_TRANSITIONS=124} [2022-07-12 10:30:03,014 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, 9 predicate places. [2022-07-12 10:30:03,015 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 124 transitions, 293 flow [2022-07-12 10:30:03,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 116.33333333333333) internal successors, (1047), 9 states have internal predecessors, (1047), 0 states have call successors, (0), 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-12 10:30:03,016 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:30:03,016 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] [2022-07-12 10:30:03,033 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-12 10:30:03,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:30:03,230 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:30:03,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:30:03,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1110080317, now seen corresponding path program 2 times [2022-07-12 10:30:03,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:30:03,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818678188] [2022-07-12 10:30:03,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:30:03,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:30:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:30:03,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:30:03,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:30:03,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818678188] [2022-07-12 10:30:03,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818678188] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:30:03,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:30:03,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:30:03,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275191796] [2022-07-12 10:30:03,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:30:03,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:30:03,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:30:03,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:30:03,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:30:03,321 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 142 [2022-07-12 10:30:03,322 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 124 transitions, 293 flow. Second operand has 8 states, 8 states have (on average 108.625) internal successors, (869), 8 states have internal predecessors, (869), 0 states have call successors, (0), 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-12 10:30:03,322 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:30:03,322 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 142 [2022-07-12 10:30:03,322 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:30:03,433 INFO L129 PetriNetUnfolder]: 68/360 cut-off events. [2022-07-12 10:30:03,433 INFO L130 PetriNetUnfolder]: For 86/86 co-relation queries the response was YES. [2022-07-12 10:30:03,434 INFO L84 FinitePrefix]: Finished finitePrefix Result has 606 conditions, 360 events. 68/360 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1102 event pairs, 30 based on Foata normal form. 1/344 useless extension candidates. Maximal degree in co-relation 597. Up to 114 conditions per place. [2022-07-12 10:30:03,436 INFO L132 encePairwiseOnDemand]: 133/142 looper letters, 27 selfloop transitions, 6 changer transitions 9/136 dead transitions. [2022-07-12 10:30:03,436 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 136 transitions, 411 flow [2022-07-12 10:30:03,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 10:30:03,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-12 10:30:03,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 889 transitions. [2022-07-12 10:30:03,438 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7825704225352113 [2022-07-12 10:30:03,438 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 889 transitions. [2022-07-12 10:30:03,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 889 transitions. [2022-07-12 10:30:03,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:30:03,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 889 transitions. [2022-07-12 10:30:03,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 111.125) internal successors, (889), 8 states have internal predecessors, (889), 0 states have call successors, (0), 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-12 10:30:03,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 142.0) internal successors, (1278), 9 states have internal predecessors, (1278), 0 states have call successors, (0), 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-12 10:30:03,443 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 142.0) internal successors, (1278), 9 states have internal predecessors, (1278), 0 states have call successors, (0), 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-12 10:30:03,443 INFO L186 Difference]: Start difference. First operand has 136 places, 124 transitions, 293 flow. Second operand 8 states and 889 transitions. [2022-07-12 10:30:03,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 136 transitions, 411 flow [2022-07-12 10:30:03,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 136 transitions, 390 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-07-12 10:30:03,447 INFO L242 Difference]: Finished difference. Result has 136 places, 124 transitions, 296 flow [2022-07-12 10:30:03,447 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=296, PETRI_PLACES=136, PETRI_TRANSITIONS=124} [2022-07-12 10:30:03,449 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, 9 predicate places. [2022-07-12 10:30:03,449 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 124 transitions, 296 flow [2022-07-12 10:30:03,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.625) internal successors, (869), 8 states have internal predecessors, (869), 0 states have call successors, (0), 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-12 10:30:03,449 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:30:03,450 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] [2022-07-12 10:30:03,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 10:30:03,450 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:30:03,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:30:03,450 INFO L85 PathProgramCache]: Analyzing trace with hash -455278715, now seen corresponding path program 1 times [2022-07-12 10:30:03,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:30:03,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789835546] [2022-07-12 10:30:03,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:30:03,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:30:03,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:30:03,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:30:03,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:30:03,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789835546] [2022-07-12 10:30:03,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789835546] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:30:03,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464142133] [2022-07-12 10:30:03,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:30:03,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:30:03,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:30:03,642 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-12 10:30:03,643 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-12 10:30:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:30:03,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-12 10:30:03,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:30:04,086 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 15 treesize of output 11 [2022-07-12 10:30:04,368 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-12 10:30:04,444 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-12 10:30:04,666 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-12 10:30:04,725 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-12 10:30:04,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:30:05,834 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:30:05,835 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 63 treesize of output 51 [2022-07-12 10:30:05,842 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:30:05,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 153 [2022-07-12 10:30:05,852 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:30:05,852 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 137 treesize of output 141 [2022-07-12 10:30:05,864 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:30:05,865 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 125 treesize of output 117 [2022-07-12 10:30:06,044 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:30:06,044 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 63 treesize of output 51 [2022-07-12 10:30:06,054 INFO L356 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2022-07-12 10:30:06,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 325 treesize of output 297 [2022-07-12 10:30:06,067 INFO L356 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2022-07-12 10:30:06,068 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 293 treesize of output 249 [2022-07-12 10:30:06,078 INFO L356 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2022-07-12 10:30:06,079 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 245 treesize of output 225 [2022-07-12 10:30:06,577 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-12 10:30:06,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464142133] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:30:06,578 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:30:06,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 28, 25] total 52 [2022-07-12 10:30:06,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128779578] [2022-07-12 10:30:06,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:30:06,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-12 10:30:06,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:30:06,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-12 10:30:06,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=2150, Unknown=37, NotChecked=0, Total=2652 [2022-07-12 10:30:06,582 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 142 [2022-07-12 10:30:06,587 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 124 transitions, 296 flow. Second operand has 52 states, 52 states have (on average 59.26923076923077) internal successors, (3082), 52 states have internal predecessors, (3082), 0 states have call successors, (0), 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-12 10:30:06,588 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:30:06,589 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 142 [2022-07-12 10:30:06,589 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:30:07,567 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_~front~0 4))) (let ((.cse6 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (= .cse8 (* c_~back~0 4)))) (.cse7 (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse13 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< 1 (+ c_~sum~0 (select .cse13 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse14 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< (+ c_~sum~0 (select .cse14 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 0))))))) (.cse0 (<= c_~n~0 c_~front~0)) (.cse1 (< c_~front~0 0))) (and (<= c_~n~0 1) (or .cse0 .cse1 (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |c_ULTIMATE.start_main_#t~ret10#1.base|))) (or (not (< (+ c_~sum~0 (select .cse2 (+ (* c_~front~0 4) |c_ULTIMATE.start_main_#t~ret10#1.offset|))) 0)) (not (= (select .cse2 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| (* c_~back~0 4))) 1))))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |c_ULTIMATE.start_main_#t~ret10#1.base|))) (or (not (< 1 (+ c_~sum~0 (select .cse3 (+ (* c_~front~0 4) |c_ULTIMATE.start_main_#t~ret10#1.offset|))))) (not (= (select .cse3 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| (* c_~back~0 4))) 1))))))) (or .cse0 (and (forall ((v_ArrVal_88 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) c_~queue~0.base))) (or (not (= (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (< (+ c_~sum~0 (select .cse4 (+ c_~queue~0.offset (* c_~front~0 4)))) 0))))) (forall ((v_ArrVal_88 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) c_~queue~0.base))) (or (not (= (select .cse5 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (< 1 (+ c_~sum~0 (select .cse5 (+ c_~queue~0.offset (* c_~front~0 4)))))))))) .cse1) (or .cse6 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse1) (or .cse7 .cse0 .cse1) (or .cse6 .cse0 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse1) (or .cse6 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse1) (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse8)) 1) (or .cse6 .cse1 (<= 1 c_~front~0)) (or .cse0 (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) c_~queue~0.base))) (or (not (= (select .cse9 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (< (+ (select .cse9 (+ c_~queue~0.offset (* c_~front~0 4))) c_~sum~0) 0))))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) c_~queue~0.base))) (or (not (< 1 (+ (select .cse10 (+ c_~queue~0.offset (* c_~front~0 4))) c_~sum~0))) (not (= (select .cse10 (+ c_~queue~0.offset (* c_~back~0 4))) 1)))))) .cse1) (= c_~sum~0 0) (or .cse0 (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (< (+ c_~sum~0 (select .cse11 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) 0)) (not (= (select .cse11 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1))))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse12 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (not (< 1 (+ c_~sum~0 (select .cse12 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))))))) .cse1) (or .cse7 (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post18#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse1)))) is different from false [2022-07-12 10:30:07,710 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_~front~0 4))) (let ((.cse6 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (= .cse8 (* c_~back~0 4)))) (.cse7 (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse13 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< 1 (+ c_~sum~0 (select .cse13 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse14 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< (+ c_~sum~0 (select .cse14 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 0))))))) (.cse0 (<= c_~n~0 c_~front~0)) (.cse1 (< c_~front~0 0))) (and (<= c_~n~0 1) (or .cse0 .cse1 (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |c_ULTIMATE.start_main_#t~ret10#1.base|))) (or (not (< (+ c_~sum~0 (select .cse2 (+ (* c_~front~0 4) |c_ULTIMATE.start_main_#t~ret10#1.offset|))) 0)) (not (= (select .cse2 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| (* c_~back~0 4))) 1))))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |c_ULTIMATE.start_main_#t~ret10#1.base|))) (or (not (< 1 (+ c_~sum~0 (select .cse3 (+ (* c_~front~0 4) |c_ULTIMATE.start_main_#t~ret10#1.offset|))))) (not (= (select .cse3 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| (* c_~back~0 4))) 1))))))) (or .cse0 (and (forall ((v_ArrVal_88 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) c_~queue~0.base))) (or (not (= (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (< (+ c_~sum~0 (select .cse4 (+ c_~queue~0.offset (* c_~front~0 4)))) 0))))) (forall ((v_ArrVal_88 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) c_~queue~0.base))) (or (not (= (select .cse5 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (< 1 (+ c_~sum~0 (select .cse5 (+ c_~queue~0.offset (* c_~front~0 4)))))))))) .cse1) (or .cse6 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse1) (or .cse7 .cse0 .cse1) (or .cse6 .cse0 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse1) (or .cse6 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse1) (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse8)) 1) (or .cse6 .cse1 (<= 1 c_~front~0)) (or (= |c_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) (and (< c_~front~0 1) (= |c_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (<= 0 c_~front~0))) (or .cse0 (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) c_~queue~0.base))) (or (not (= (select .cse9 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (< (+ (select .cse9 (+ c_~queue~0.offset (* c_~front~0 4))) c_~sum~0) 0))))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) c_~queue~0.base))) (or (not (< 1 (+ (select .cse10 (+ c_~queue~0.offset (* c_~front~0 4))) c_~sum~0))) (not (= (select .cse10 (+ c_~queue~0.offset (* c_~back~0 4))) 1)))))) .cse1) (= c_~sum~0 0) (or .cse0 (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (< (+ c_~sum~0 (select .cse11 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) 0)) (not (= (select .cse11 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1))))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse12 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (not (< 1 (+ c_~sum~0 (select .cse12 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))))))) .cse1) (or .cse7 (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post18#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse1)))) is different from false [2022-07-12 10:30:08,263 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_~front~0 4))) (let ((.cse8 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (= .cse10 (* c_~back~0 4)))) (.cse6 (< c_~front~0 1)) (.cse7 (<= 0 c_~front~0)) (.cse9 (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse15 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse15 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< 1 (+ c_~sum~0 (select .cse15 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse16 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse16 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< (+ c_~sum~0 (select .cse16 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 0))))))) (.cse0 (<= c_~n~0 c_~front~0)) (.cse1 (< c_~front~0 0))) (and (<= c_~n~0 1) (or .cse0 .cse1 (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |c_ULTIMATE.start_main_#t~ret10#1.base|))) (or (not (< (+ c_~sum~0 (select .cse2 (+ (* c_~front~0 4) |c_ULTIMATE.start_main_#t~ret10#1.offset|))) 0)) (not (= (select .cse2 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| (* c_~back~0 4))) 1))))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |c_ULTIMATE.start_main_#t~ret10#1.base|))) (or (not (< 1 (+ c_~sum~0 (select .cse3 (+ (* c_~front~0 4) |c_ULTIMATE.start_main_#t~ret10#1.offset|))))) (not (= (select .cse3 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| (* c_~back~0 4))) 1))))))) (or .cse0 (and (forall ((v_ArrVal_88 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) c_~queue~0.base))) (or (not (= (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (< (+ c_~sum~0 (select .cse4 (+ c_~queue~0.offset (* c_~front~0 4)))) 0))))) (forall ((v_ArrVal_88 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) c_~queue~0.base))) (or (not (= (select .cse5 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (< 1 (+ c_~sum~0 (select .cse5 (+ c_~queue~0.offset (* c_~front~0 4)))))))))) .cse1) (or (= |c_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) (and (= |c_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse6 .cse7)) (or .cse8 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse1) (or .cse9 .cse0 .cse1) (or .cse8 .cse0 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse1) (or .cse8 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse1) (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse10)) 1) (or .cse8 .cse1 (<= 1 c_~front~0)) (or (= |c_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) (and .cse6 (= |c_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse7)) (or .cse0 (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) c_~queue~0.base))) (or (not (= (select .cse11 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (< (+ (select .cse11 (+ c_~queue~0.offset (* c_~front~0 4))) c_~sum~0) 0))))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) c_~queue~0.base))) (or (not (< 1 (+ (select .cse12 (+ c_~queue~0.offset (* c_~front~0 4))) c_~sum~0))) (not (= (select .cse12 (+ c_~queue~0.offset (* c_~back~0 4))) 1)))))) .cse1) (= c_~sum~0 0) (or .cse0 (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (< (+ c_~sum~0 (select .cse13 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) 0)) (not (= (select .cse13 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1))))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse14 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (not (< 1 (+ c_~sum~0 (select .cse14 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))))))) .cse1) (or .cse9 (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post18#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse1)))) is different from false [2022-07-12 10:30:10,091 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_~front~0 4))) (let ((.cse6 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (= .cse8 (* c_~back~0 4)))) (.cse7 (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse13 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< 1 (+ c_~sum~0 (select .cse13 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse14 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< (+ c_~sum~0 (select .cse14 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 0))))))) (.cse0 (<= c_~n~0 c_~front~0)) (.cse1 (< c_~front~0 0))) (and (<= c_~n~0 1) (or .cse0 .cse1 (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |c_ULTIMATE.start_main_#t~ret10#1.base|))) (or (not (< (+ c_~sum~0 (select .cse2 (+ (* c_~front~0 4) |c_ULTIMATE.start_main_#t~ret10#1.offset|))) 0)) (not (= (select .cse2 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| (* c_~back~0 4))) 1))))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |c_ULTIMATE.start_main_#t~ret10#1.base|))) (or (not (< 1 (+ c_~sum~0 (select .cse3 (+ (* c_~front~0 4) |c_ULTIMATE.start_main_#t~ret10#1.offset|))))) (not (= (select .cse3 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| (* c_~back~0 4))) 1))))))) (or .cse0 (and (forall ((v_ArrVal_88 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) c_~queue~0.base))) (or (not (= (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (< (+ c_~sum~0 (select .cse4 (+ c_~queue~0.offset (* c_~front~0 4)))) 0))))) (forall ((v_ArrVal_88 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) c_~queue~0.base))) (or (not (= (select .cse5 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (< 1 (+ c_~sum~0 (select .cse5 (+ c_~queue~0.offset (* c_~front~0 4)))))))))) .cse1) (or .cse6 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse1) (or .cse7 .cse0 .cse1) (or .cse6 .cse0 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse1) (or .cse6 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse1) (= |c_thread1Thread1of1ForFork0_#t~mem1#1| 1) (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse8)) 1) (or .cse6 .cse1 (<= 1 c_~front~0)) (or .cse0 (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) c_~queue~0.base))) (or (not (= (select .cse9 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (< (+ (select .cse9 (+ c_~queue~0.offset (* c_~front~0 4))) c_~sum~0) 0))))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) c_~queue~0.base))) (or (not (< 1 (+ (select .cse10 (+ c_~queue~0.offset (* c_~front~0 4))) c_~sum~0))) (not (= (select .cse10 (+ c_~queue~0.offset (* c_~back~0 4))) 1)))))) .cse1) (= c_~sum~0 0) (or .cse0 (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (< (+ c_~sum~0 (select .cse11 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) 0)) (not (= (select .cse11 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1))))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse12 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (not (< 1 (+ c_~sum~0 (select .cse12 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))))))) .cse1) (or .cse7 (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post18#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse1)))) is different from false [2022-07-12 10:30:10,313 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_~front~0 4))) (let ((.cse6 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (= .cse8 (* c_~back~0 4)))) (.cse7 (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse13 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< 1 (+ c_~sum~0 (select .cse13 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse14 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< (+ c_~sum~0 (select .cse14 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 0))))))) (.cse0 (<= c_~n~0 c_~front~0)) (.cse1 (< c_~front~0 0))) (and (= (+ (- 1) c_~element~0) 0) (<= c_~n~0 1) (or .cse0 .cse1 (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |c_ULTIMATE.start_main_#t~ret10#1.base|))) (or (not (< (+ c_~sum~0 (select .cse2 (+ (* c_~front~0 4) |c_ULTIMATE.start_main_#t~ret10#1.offset|))) 0)) (not (= (select .cse2 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| (* c_~back~0 4))) 1))))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |c_ULTIMATE.start_main_#t~ret10#1.base|))) (or (not (< 1 (+ c_~sum~0 (select .cse3 (+ (* c_~front~0 4) |c_ULTIMATE.start_main_#t~ret10#1.offset|))))) (not (= (select .cse3 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| (* c_~back~0 4))) 1))))))) (or .cse0 (and (forall ((v_ArrVal_88 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) c_~queue~0.base))) (or (not (= (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (< (+ c_~sum~0 (select .cse4 (+ c_~queue~0.offset (* c_~front~0 4)))) 0))))) (forall ((v_ArrVal_88 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) c_~queue~0.base))) (or (not (= (select .cse5 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (< 1 (+ c_~sum~0 (select .cse5 (+ c_~queue~0.offset (* c_~front~0 4)))))))))) .cse1) (or .cse6 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse1) (or .cse7 .cse0 .cse1) (or .cse6 .cse0 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse1) (or .cse6 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse1) (= |c_thread1Thread1of1ForFork0_#t~mem1#1| 1) (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse8)) 1) (or .cse6 .cse1 (<= 1 c_~front~0)) (or .cse0 (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) c_~queue~0.base))) (or (not (= (select .cse9 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (< (+ (select .cse9 (+ c_~queue~0.offset (* c_~front~0 4))) c_~sum~0) 0))))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) c_~queue~0.base))) (or (not (< 1 (+ (select .cse10 (+ c_~queue~0.offset (* c_~front~0 4))) c_~sum~0))) (not (= (select .cse10 (+ c_~queue~0.offset (* c_~back~0 4))) 1)))))) .cse1) (= c_~sum~0 0) (or .cse0 (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (< (+ c_~sum~0 (select .cse11 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) 0)) (not (= (select .cse11 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1))))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse12 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (not (< 1 (+ c_~sum~0 (select .cse12 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))))))) .cse1) (or .cse7 (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post18#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse1)))) is different from false [2022-07-12 10:30:10,392 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_~front~0 4))) (let ((.cse6 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (= .cse8 (* c_~back~0 4)))) (.cse7 (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse13 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< 1 (+ c_~sum~0 (select .cse13 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse14 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< (+ c_~sum~0 (select .cse14 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 0))))))) (.cse0 (<= c_~n~0 c_~front~0)) (.cse1 (< c_~front~0 0))) (and (= (+ (- 1) c_~element~0) 0) (<= c_~n~0 1) (or .cse0 .cse1 (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |c_ULTIMATE.start_main_#t~ret10#1.base|))) (or (not (< (+ c_~sum~0 (select .cse2 (+ (* c_~front~0 4) |c_ULTIMATE.start_main_#t~ret10#1.offset|))) 0)) (not (= (select .cse2 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| (* c_~back~0 4))) 1))))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |c_ULTIMATE.start_main_#t~ret10#1.base|))) (or (not (< 1 (+ c_~sum~0 (select .cse3 (+ (* c_~front~0 4) |c_ULTIMATE.start_main_#t~ret10#1.offset|))))) (not (= (select .cse3 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| (* c_~back~0 4))) 1))))))) (or .cse0 (and (forall ((v_ArrVal_88 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) c_~queue~0.base))) (or (not (= (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (< (+ c_~sum~0 (select .cse4 (+ c_~queue~0.offset (* c_~front~0 4)))) 0))))) (forall ((v_ArrVal_88 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) c_~queue~0.base))) (or (not (= (select .cse5 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (< 1 (+ c_~sum~0 (select .cse5 (+ c_~queue~0.offset (* c_~front~0 4)))))))))) .cse1) (or .cse6 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse1) (or .cse7 .cse0 .cse1) (or .cse6 .cse0 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse1) (or .cse6 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse1) (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse8)) 1) (or .cse6 .cse1 (<= 1 c_~front~0)) (or .cse0 (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) c_~queue~0.base))) (or (not (= (select .cse9 (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (< (+ (select .cse9 (+ c_~queue~0.offset (* c_~front~0 4))) c_~sum~0) 0))))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) c_~queue~0.base))) (or (not (< 1 (+ (select .cse10 (+ c_~queue~0.offset (* c_~front~0 4))) c_~sum~0))) (not (= (select .cse10 (+ c_~queue~0.offset (* c_~back~0 4))) 1)))))) .cse1) (= c_~sum~0 0) (or .cse0 (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (< (+ c_~sum~0 (select .cse11 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) 0)) (not (= (select .cse11 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1))))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse12 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (not (< 1 (+ c_~sum~0 (select .cse12 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))))))) .cse1) (or .cse7 (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post18#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse1)))) is different from false [2022-07-12 10:30:10,841 INFO L129 PetriNetUnfolder]: 2320/4727 cut-off events. [2022-07-12 10:30:10,841 INFO L130 PetriNetUnfolder]: For 961/965 co-relation queries the response was YES. [2022-07-12 10:30:10,850 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9776 conditions, 4727 events. 2320/4727 cut-off events. For 961/965 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 34542 event pairs, 171 based on Foata normal form. 15/4562 useless extension candidates. Maximal degree in co-relation 9767. Up to 751 conditions per place. [2022-07-12 10:30:10,864 INFO L132 encePairwiseOnDemand]: 100/142 looper letters, 436 selfloop transitions, 209 changer transitions 34/729 dead transitions. [2022-07-12 10:30:10,865 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 729 transitions, 3258 flow [2022-07-12 10:30:10,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2022-07-12 10:30:10,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2022-07-12 10:30:10,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 6113 transitions. [2022-07-12 10:30:10,877 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.4438071729345143 [2022-07-12 10:30:10,877 INFO L72 ComplementDD]: Start complementDD. Operand 97 states and 6113 transitions. [2022-07-12 10:30:10,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 6113 transitions. [2022-07-12 10:30:10,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:30:10,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 97 states and 6113 transitions. [2022-07-12 10:30:10,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 98 states, 97 states have (on average 63.02061855670103) internal successors, (6113), 97 states have internal predecessors, (6113), 0 states have call successors, (0), 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-12 10:30:10,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 98 states, 98 states have (on average 142.0) internal successors, (13916), 98 states have internal predecessors, (13916), 0 states have call successors, (0), 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-12 10:30:10,915 INFO L81 ComplementDD]: Finished complementDD. Result has 98 states, 98 states have (on average 142.0) internal successors, (13916), 98 states have internal predecessors, (13916), 0 states have call successors, (0), 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-12 10:30:10,915 INFO L186 Difference]: Start difference. First operand has 136 places, 124 transitions, 296 flow. Second operand 97 states and 6113 transitions. [2022-07-12 10:30:10,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 729 transitions, 3258 flow [2022-07-12 10:30:10,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 729 transitions, 3154 flow, removed 47 selfloop flow, removed 5 redundant places. [2022-07-12 10:30:10,960 INFO L242 Difference]: Finished difference. Result has 286 places, 350 transitions, 1939 flow [2022-07-12 10:30:10,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=97, PETRI_FLOW=1939, PETRI_PLACES=286, PETRI_TRANSITIONS=350} [2022-07-12 10:30:10,963 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, 159 predicate places. [2022-07-12 10:30:10,963 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 350 transitions, 1939 flow [2022-07-12 10:30:10,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 59.26923076923077) internal successors, (3082), 52 states have internal predecessors, (3082), 0 states have call successors, (0), 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-12 10:30:10,964 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:30:10,965 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] [2022-07-12 10:30:10,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 10:30:11,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-12 10:30:11,165 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:30:11,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:30:11,166 INFO L85 PathProgramCache]: Analyzing trace with hash 671312538, now seen corresponding path program 1 times [2022-07-12 10:30:11,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:30:11,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411373458] [2022-07-12 10:30:11,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:30:11,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:30:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:30:11,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 10:30:11,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:30:11,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411373458] [2022-07-12 10:30:11,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411373458] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:30:11,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:30:11,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 10:30:11,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403780896] [2022-07-12 10:30:11,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:30:11,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:30:11,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:30:11,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:30:11,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:30:11,232 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 142 [2022-07-12 10:30:11,232 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 350 transitions, 1939 flow. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 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-12 10:30:11,232 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:30:11,232 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 142 [2022-07-12 10:30:11,232 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:30:11,661 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([442] thread1EXIT-->L101-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem15#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][108], [Black: 850#(= ~sum~0 0), Black: 1719#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (or (<= 1 ~front~0) (= (* ~front~0 4) (* ~back~0 4)) (< ~front~0 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= ~element~0 1) (<= ~n~0 1)), Black: 1303#(and (not (< 1 (+ ~sum~0 ~element~0))) (not (< (+ ~sum~0 ~element~0) 0))), Black: 1749#(and (not (< ~sum~0 0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (not (< 1 ~sum~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1741#(and (not (< 1 (+ ~sum~0 ~element~0))) (or (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~front~0) (< ~front~0 0)) (not (< (+ ~sum~0 ~element~0) 0))), Black: 855#(and (= ~sum~0 0) (= (+ (- 1) ~element~0) 0)), Black: 1003#(and (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|)), Black: 1729#(and (or (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= ~sum~0 1) (<= 1 ~sum~0)), Black: 1341#(or (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))) (<= ~n~0 ~front~0) (< ~front~0 0)), Black: 848#true, Black: 1611#(and (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1721#(and (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= (+ (- 1) ~element~0) 0) (<= ~n~0 1)), Black: 1660#(and (or (and (< ~front~0 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (<= 0 ~front~0)) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) (and (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (< ~front~0 1) (<= 0 ~front~0))) (or (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (or (and (forall ((v_ArrVal_88 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< 1 (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))) (forall ((v_ArrVal_88 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (<= 1 ~front~0) (< ~front~0 0)) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< (+ |ULTIMATE.start_create_fresh_int_array_#t~post18#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (< 1 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|)) 1)) (not (< 1 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|)) ~sum~0))))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|)) 1)) (not (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|)) ~sum~0) 0))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (<= ~n~0 ~front~0) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~front~0 0)) (<= ~n~0 1) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~sum~0) 0)))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< 1 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~sum~0)))))) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 1636#(and (or (<= 1 ~front~0) (= (* ~front~0 4) (* ~back~0 4)) (< ~front~0 0)) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) (and (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (< ~front~0 1) (<= 0 ~front~0))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (<= ~n~0 1)), Black: 1648#(and (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0)) (< ~front~0 1) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (<= 0 ~front~0) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (<= ~n~0 1)), Black: 1664#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0)) (< ~front~0 1) (= ~back~0 ~front~0) (= ~sum~0 0) (<= 0 ~front~0) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) (<= ~n~0 1)), Black: 854#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (= ~sum~0 0)), Black: 1711#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (or (<= 1 ~front~0) (= (* ~front~0 4) (* ~back~0 4)) (< ~front~0 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (<= ~n~0 1)), Black: 1675#(and (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)))) (or (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), Black: 1671#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0)) (< ~front~0 1) (= ~back~0 ~front~0) (= ~sum~0 0) (<= 0 ~front~0) (= ~element~0 1) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) (<= ~n~0 1)), Black: 146#(= ~sum~0 0), Black: 159#(<= ~back~0 ~front~0), 83#L101-2true, 141#true, 598#(= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)), 11#L65-4true, 157#true, 1813#true, Black: 840#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1122#(and (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) (and (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (< ~front~0 1) (<= 0 ~front~0))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0)), Black: 1106#(and (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (<= ~n~0 1)), Black: 1615#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_#t~post18#1| 0)), Black: 1630#(and (or (<= 1 ~front~0) (= (* ~front~0 4) (* ~back~0 4)) (< ~front~0 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (<= ~n~0 1)), Black: 1617#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 1)), Black: 1737#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (= ~sum~0 0) (or (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~front~0) (< ~front~0 0)) (= (+ (- 1) ~element~0) 0)), Black: 1030#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|)), Black: 1709#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= (+ (- 1) ~element~0) 0) (<= ~n~0 1)), Black: 1658#(and (or (and (< ~front~0 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (<= 0 ~front~0)) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) (and (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (< ~front~0 1) (<= 0 ~front~0))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0)), Black: 1677#(and (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0)) (< ~front~0 1) (= ~back~0 ~front~0) (= ~sum~0 0) (<= 0 ~front~0) (= ~element~0 1) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) (<= ~n~0 1)), Black: 1642#(and (= ~sum~0 0) (or (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 1735#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (or (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (or (and (forall ((v_ArrVal_88 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< 1 (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))) (forall ((v_ArrVal_88 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (<= 1 ~front~0) (< ~front~0 0)) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< (+ |ULTIMATE.start_create_fresh_int_array_#t~post18#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (= (+ (- 1) ~element~0) 0) (or (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (< 1 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|)) 1)) (not (< 1 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|)) ~sum~0))))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|)) 1)) (not (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|)) ~sum~0) 0))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (<= ~n~0 ~front~0) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~front~0 0)) (<= ~n~0 1) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~sum~0) 0)))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< 1 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~sum~0)))))) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 1619#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 1)), Black: 1652#(and (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0)) (< ~front~0 1) (= ~back~0 ~front~0) (= ~sum~0 0) (<= 0 ~front~0) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) (<= ~n~0 1)), Black: 1739#(and (or (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (or (and (forall ((v_ArrVal_88 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< 1 (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))) (forall ((v_ArrVal_88 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (<= 1 ~front~0) (< ~front~0 0)) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< (+ |ULTIMATE.start_create_fresh_int_array_#t~post18#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (= (+ (- 1) ~element~0) 0) (or (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (< 1 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|)) 1)) (not (< 1 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|)) ~sum~0))))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|)) 1)) (not (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|)) ~sum~0) 0))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (<= ~n~0 ~front~0) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~front~0 0)) (<= ~n~0 1) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~sum~0) 0)))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< 1 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~sum~0)))))) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 1632#(and (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) (and (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (< ~front~0 1) (<= 0 ~front~0))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (<= ~n~0 1)), Black: 1640#(and (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) (and (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (< ~front~0 1) (<= 0 ~front~0))) (or (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (or (and (forall ((v_ArrVal_88 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< 1 (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))) (forall ((v_ArrVal_88 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (<= 1 ~front~0) (< ~front~0 0)) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< (+ |ULTIMATE.start_create_fresh_int_array_#t~post18#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (< 1 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|)) 1)) (not (< 1 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|)) ~sum~0))))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|)) 1)) (not (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|)) ~sum~0) 0))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (<= ~n~0 ~front~0) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~front~0 0)) (<= ~n~0 1) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~sum~0) 0)))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< 1 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~sum~0)))))) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 1625#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (< (+ ~queue~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (< (+ ~queue~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 1)), Black: 1650#(and (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)))) (or (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 1621#(and (< (+ |ULTIMATE.start_main_#t~ret10#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (< (+ |ULTIMATE.start_main_#t~ret10#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 1)), Black: 1723#(and (= ~sum~0 0) (or (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~front~0) (< ~front~0 0)) (= (+ (- 1) ~element~0) 0)), Black: 1703#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (<= ~n~0 1)), Black: 1644#(and (or (and (< ~front~0 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (<= 0 ~front~0)) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) (and (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (< ~front~0 1) (<= 0 ~front~0))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (<= ~n~0 1)), Black: 1743#(and (<= ~sum~0 1) (<= 1 ~sum~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1745#(and (<= ~sum~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 1 ~sum~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1245#(and (not (< ~sum~0 0)) (not (< 1 ~sum~0))), Black: 1129#(and (or (and (< ~front~0 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (<= 0 ~front~0)) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0)), Black: 1654#(and (not (< ~sum~0 0)) (or (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~front~0) (< ~front~0 0)) (not (< 1 ~sum~0))), Black: 1725#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (or (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (or (and (forall ((v_ArrVal_88 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< 1 (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))) (forall ((v_ArrVal_88 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (<= 1 ~front~0) (< ~front~0 0)) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< (+ |ULTIMATE.start_create_fresh_int_array_#t~post18#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (< 1 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|)) 1)) (not (< 1 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|)) ~sum~0))))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|)) 1)) (not (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|)) ~sum~0) 0))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (<= ~n~0 ~front~0) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~front~0 0)) (<= ~n~0 1) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~sum~0) 0)))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< 1 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~sum~0)))))) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 1731#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (= ~sum~0 0) (= (+ (- 1) ~element~0) 0)), Black: 1715#(and (or (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))) (<= ~n~0 ~front~0) (< ~front~0 0)) (= ~sum~0 0) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (<= 1 ~front~0) (< ~front~0 0)) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (= (+ (- 1) ~element~0) 0) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (<= ~n~0 ~front~0) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~front~0 0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 1656#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0)) (< ~front~0 1) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (<= 0 ~front~0) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (<= ~n~0 1)), Black: 1646#(and (or (and (< ~front~0 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (<= 0 ~front~0)) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (<= 1 ~front~0) (= (* ~front~0 4) (* ~back~0 4)) (< ~front~0 0)) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) (and (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (< ~front~0 1) (<= 0 ~front~0))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (<= ~n~0 1)), Black: 1623#(and (< (+ |ULTIMATE.start_main_#t~ret10#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (< (+ ~queue~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (< (+ |ULTIMATE.start_main_#t~ret10#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~queue~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 1)), Black: 1673#(and (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0)) (< ~front~0 1) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (<= 0 ~front~0) (= ~element~0 1) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (<= ~n~0 1)), 856#(and (<= ~sum~0 1) (<= 1 ~sum~0)), Black: 1634#(and (or (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (or (and (forall ((v_ArrVal_88 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< 1 (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))))) (forall ((v_ArrVal_88 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (<= 1 ~front~0) (< ~front~0 0)) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< (+ |ULTIMATE.start_create_fresh_int_array_#t~post18#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (< 1 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|)) 1)) (not (< 1 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|)) ~sum~0))))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|)) 1)) (not (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|)) ~sum~0) 0))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (<= ~n~0 ~front~0) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< ~front~0 0)) (<= ~n~0 1) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (<= 0 (+ ~sum~0 1)) (<= ~sum~0 0) (= (* ~front~0 4) (* ~back~0 4))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~sum~0) 0)))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< 1 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_87) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_88) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~sum~0)))))) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 1727#(and (or (<= 1 ~front~0) (= (* ~front~0 4) (* ~back~0 4)) (< ~front~0 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= ~element~0 1) (<= ~n~0 1)), Black: 1357#(or (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~front~0) (< ~front~0 0)), Black: 1662#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0)) (< ~front~0 1) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (<= 0 ~front~0) (= ~element~0 1) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (<= ~n~0 1)), Black: 1733#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (= ~sum~0 0) (or (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 1747#(and (not (< ~sum~0 0)) (not (< 1 ~sum~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))]) [2022-07-12 10:30:11,664 INFO L384 tUnfolder$Statistics]: this new event has 109 ancestors and is cut-off event [2022-07-12 10:30:11,664 INFO L387 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-07-12 10:30:11,664 INFO L387 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-07-12 10:30:11,664 INFO L387 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-07-12 10:30:11,803 INFO L129 PetriNetUnfolder]: 1283/3749 cut-off events. [2022-07-12 10:30:11,803 INFO L130 PetriNetUnfolder]: For 76452/78172 co-relation queries the response was YES. [2022-07-12 10:30:11,827 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20623 conditions, 3749 events. 1283/3749 cut-off events. For 76452/78172 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 31392 event pairs, 414 based on Foata normal form. 113/3525 useless extension candidates. Maximal degree in co-relation 20554. Up to 1375 conditions per place. [2022-07-12 10:30:11,846 INFO L132 encePairwiseOnDemand]: 139/142 looper letters, 87 selfloop transitions, 2 changer transitions 0/344 dead transitions. [2022-07-12 10:30:11,846 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 344 transitions, 2098 flow [2022-07-12 10:30:11,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:30:11,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:30:11,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2022-07-12 10:30:11,847 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8990610328638498 [2022-07-12 10:30:11,847 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 383 transitions. [2022-07-12 10:30:11,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 383 transitions. [2022-07-12 10:30:11,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:30:11,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 383 transitions. [2022-07-12 10:30:11,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 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-12 10:30:11,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 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-12 10:30:11,849 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 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-12 10:30:11,849 INFO L186 Difference]: Start difference. First operand has 286 places, 350 transitions, 1939 flow. Second operand 3 states and 383 transitions. [2022-07-12 10:30:11,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 344 transitions, 2098 flow [2022-07-12 10:30:12,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 344 transitions, 1999 flow, removed 37 selfloop flow, removed 16 redundant places. [2022-07-12 10:30:12,143 INFO L242 Difference]: Finished difference. Result has 269 places, 341 transitions, 1800 flow [2022-07-12 10:30:12,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=1788, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1800, PETRI_PLACES=269, PETRI_TRANSITIONS=341} [2022-07-12 10:30:12,144 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, 142 predicate places. [2022-07-12 10:30:12,145 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 341 transitions, 1800 flow [2022-07-12 10:30:12,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 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-12 10:30:12,145 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:30:12,145 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] [2022-07-12 10:30:12,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 10:30:12,145 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:30:12,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:30:12,146 INFO L85 PathProgramCache]: Analyzing trace with hash 147852322, now seen corresponding path program 2 times [2022-07-12 10:30:12,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:30:12,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708204915] [2022-07-12 10:30:12,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:30:12,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:30:12,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:30:12,209 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:30:12,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:30:12,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708204915] [2022-07-12 10:30:12,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708204915] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:30:12,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405170732] [2022-07-12 10:30:12,210 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 10:30:12,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:30:12,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:30:12,212 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:30:12,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 10:30:12,306 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 10:30:12,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:30:12,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 10:30:12,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:30:12,445 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:30:12,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:30:12,540 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:30:12,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405170732] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:30:12,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:30:12,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 11 [2022-07-12 10:30:12,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279698835] [2022-07-12 10:30:12,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:30:12,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 10:30:12,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:30:12,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 10:30:12,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-12 10:30:12,543 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 142 [2022-07-12 10:30:12,544 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 341 transitions, 1800 flow. Second operand has 11 states, 11 states have (on average 111.45454545454545) internal successors, (1226), 11 states have internal predecessors, (1226), 0 states have call successors, (0), 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-12 10:30:12,544 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:30:12,544 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 142 [2022-07-12 10:30:12,544 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:30:14,695 INFO L129 PetriNetUnfolder]: 5267/11783 cut-off events. [2022-07-12 10:30:14,696 INFO L130 PetriNetUnfolder]: For 227103/229496 co-relation queries the response was YES. [2022-07-12 10:30:14,786 INFO L84 FinitePrefix]: Finished finitePrefix Result has 70880 conditions, 11783 events. 5267/11783 cut-off events. For 227103/229496 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 100994 event pairs, 1184 based on Foata normal form. 164/11288 useless extension candidates. Maximal degree in co-relation 70813. Up to 4094 conditions per place. [2022-07-12 10:30:14,865 INFO L132 encePairwiseOnDemand]: 129/142 looper letters, 347 selfloop transitions, 124 changer transitions 0/666 dead transitions. [2022-07-12 10:30:14,865 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 666 transitions, 5591 flow [2022-07-12 10:30:14,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 10:30:14,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-07-12 10:30:14,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1978 transitions. [2022-07-12 10:30:14,868 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8193869096934548 [2022-07-12 10:30:14,868 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1978 transitions. [2022-07-12 10:30:14,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1978 transitions. [2022-07-12 10:30:14,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:30:14,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1978 transitions. [2022-07-12 10:30:14,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 116.3529411764706) internal successors, (1978), 17 states have internal predecessors, (1978), 0 states have call successors, (0), 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-12 10:30:14,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 142.0) internal successors, (2556), 18 states have internal predecessors, (2556), 0 states have call successors, (0), 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-12 10:30:14,874 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 142.0) internal successors, (2556), 18 states have internal predecessors, (2556), 0 states have call successors, (0), 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-12 10:30:14,874 INFO L186 Difference]: Start difference. First operand has 269 places, 341 transitions, 1800 flow. Second operand 17 states and 1978 transitions. [2022-07-12 10:30:14,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 666 transitions, 5591 flow [2022-07-12 10:30:15,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 666 transitions, 5583 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-07-12 10:30:15,864 INFO L242 Difference]: Finished difference. Result has 297 places, 439 transitions, 3034 flow [2022-07-12 10:30:15,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=1796, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3034, PETRI_PLACES=297, PETRI_TRANSITIONS=439} [2022-07-12 10:30:15,865 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, 170 predicate places. [2022-07-12 10:30:15,865 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 439 transitions, 3034 flow [2022-07-12 10:30:15,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 111.45454545454545) internal successors, (1226), 11 states have internal predecessors, (1226), 0 states have call successors, (0), 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-12 10:30:15,866 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:30:15,866 INFO L200 CegarLoopForPetriNet]: trace histogram [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] [2022-07-12 10:30:15,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-12 10:30:16,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:30:16,079 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:30:16,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:30:16,080 INFO L85 PathProgramCache]: Analyzing trace with hash 327889553, now seen corresponding path program 1 times [2022-07-12 10:30:16,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:30:16,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089214493] [2022-07-12 10:30:16,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:30:16,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:30:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:30:16,149 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 10:30:16,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:30:16,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089214493] [2022-07-12 10:30:16,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089214493] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:30:16,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155580986] [2022-07-12 10:30:16,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:30:16,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:30:16,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:30:16,151 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:30:16,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 10:30:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:30:16,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 10:30:16,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:30:16,295 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 10:30:16,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:30:16,416 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 10:30:16,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155580986] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:30:16,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:30:16,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 11 [2022-07-12 10:30:16,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809946289] [2022-07-12 10:30:16,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:30:16,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 10:30:16,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:30:16,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 10:30:16,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-12 10:30:16,420 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 142 [2022-07-12 10:30:16,421 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 439 transitions, 3034 flow. Second operand has 11 states, 11 states have (on average 111.45454545454545) internal successors, (1226), 11 states have internal predecessors, (1226), 0 states have call successors, (0), 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-12 10:30:16,421 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:30:16,421 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 142 [2022-07-12 10:30:16,421 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:30:20,512 INFO L129 PetriNetUnfolder]: 9612/21461 cut-off events. [2022-07-12 10:30:20,512 INFO L130 PetriNetUnfolder]: For 489073/493895 co-relation queries the response was YES. [2022-07-12 10:30:20,819 INFO L84 FinitePrefix]: Finished finitePrefix Result has 146390 conditions, 21461 events. 9612/21461 cut-off events. For 489073/493895 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 201030 event pairs, 2368 based on Foata normal form. 405/20928 useless extension candidates. Maximal degree in co-relation 146311. Up to 7149 conditions per place. [2022-07-12 10:30:20,986 INFO L132 encePairwiseOnDemand]: 129/142 looper letters, 477 selfloop transitions, 254 changer transitions 2/928 dead transitions. [2022-07-12 10:30:20,986 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 928 transitions, 10138 flow [2022-07-12 10:30:20,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 10:30:20,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-07-12 10:30:20,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2796 transitions. [2022-07-12 10:30:20,989 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8204225352112676 [2022-07-12 10:30:20,989 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 2796 transitions. [2022-07-12 10:30:20,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 2796 transitions. [2022-07-12 10:30:20,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:30:20,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2796 transitions. [2022-07-12 10:30:20,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 116.5) internal successors, (2796), 24 states have internal predecessors, (2796), 0 states have call successors, (0), 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-12 10:30:20,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 142.0) internal successors, (3550), 25 states have internal predecessors, (3550), 0 states have call successors, (0), 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-12 10:30:20,997 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 142.0) internal successors, (3550), 25 states have internal predecessors, (3550), 0 states have call successors, (0), 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-12 10:30:20,997 INFO L186 Difference]: Start difference. First operand has 297 places, 439 transitions, 3034 flow. Second operand 24 states and 2796 transitions. [2022-07-12 10:30:20,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 928 transitions, 10138 flow [2022-07-12 10:30:22,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 928 transitions, 10008 flow, removed 57 selfloop flow, removed 4 redundant places. [2022-07-12 10:30:22,847 INFO L242 Difference]: Finished difference. Result has 331 places, 670 transitions, 6791 flow [2022-07-12 10:30:22,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=2972, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=6791, PETRI_PLACES=331, PETRI_TRANSITIONS=670} [2022-07-12 10:30:22,847 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, 204 predicate places. [2022-07-12 10:30:22,848 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 670 transitions, 6791 flow [2022-07-12 10:30:22,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 111.45454545454545) internal successors, (1226), 11 states have internal predecessors, (1226), 0 states have call successors, (0), 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-12 10:30:22,848 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:30:22,849 INFO L200 CegarLoopForPetriNet]: trace histogram [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] [2022-07-12 10:30:22,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 10:30:23,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:30:23,063 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:30:23,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:30:23,064 INFO L85 PathProgramCache]: Analyzing trace with hash -926888251, now seen corresponding path program 2 times [2022-07-12 10:30:23,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:30:23,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268008033] [2022-07-12 10:30:23,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:30:23,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:30:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:30:23,178 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:30:23,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:30:23,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268008033] [2022-07-12 10:30:23,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268008033] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:30:23,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405320118] [2022-07-12 10:30:23,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 10:30:23,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:30:23,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:30:23,181 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:30:23,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 10:30:23,247 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 10:30:23,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:30:23,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-12 10:30:23,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:30:23,553 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:30:23,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:30:23,992 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:30:23,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405320118] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:30:23,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:30:23,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 31 [2022-07-12 10:30:23,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923378225] [2022-07-12 10:30:23,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:30:23,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-12 10:30:23,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:30:23,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-12 10:30:23,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=810, Unknown=0, NotChecked=0, Total=930 [2022-07-12 10:30:23,995 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 142 [2022-07-12 10:30:23,997 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 670 transitions, 6791 flow. Second operand has 31 states, 31 states have (on average 74.80645161290323) internal successors, (2319), 31 states have internal predecessors, (2319), 0 states have call successors, (0), 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-12 10:30:23,997 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:30:23,997 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 142 [2022-07-12 10:30:23,997 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:30:43,667 INFO L129 PetriNetUnfolder]: 32123/71808 cut-off events. [2022-07-12 10:30:43,667 INFO L130 PetriNetUnfolder]: For 2420321/2422730 co-relation queries the response was YES. [2022-07-12 10:30:44,877 INFO L84 FinitePrefix]: Finished finitePrefix Result has 592061 conditions, 71808 events. 32123/71808 cut-off events. For 2420321/2422730 co-relation queries the response was YES. Maximal size of possible extension queue 2140. Compared 819099 event pairs, 980 based on Foata normal form. 1512/70792 useless extension candidates. Maximal degree in co-relation 591968. Up to 26340 conditions per place. [2022-07-12 10:30:45,345 INFO L132 encePairwiseOnDemand]: 114/142 looper letters, 1604 selfloop transitions, 903 changer transitions 86/2700 dead transitions. [2022-07-12 10:30:45,346 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 2700 transitions, 46887 flow [2022-07-12 10:30:45,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-07-12 10:30:45,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2022-07-12 10:30:45,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 4800 transitions. [2022-07-12 10:30:45,353 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.5541445393673516 [2022-07-12 10:30:45,353 INFO L72 ComplementDD]: Start complementDD. Operand 61 states and 4800 transitions. [2022-07-12 10:30:45,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 4800 transitions. [2022-07-12 10:30:45,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:30:45,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 61 states and 4800 transitions. [2022-07-12 10:30:45,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 62 states, 61 states have (on average 78.68852459016394) internal successors, (4800), 61 states have internal predecessors, (4800), 0 states have call successors, (0), 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-12 10:30:45,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 62 states, 62 states have (on average 142.0) internal successors, (8804), 62 states have internal predecessors, (8804), 0 states have call successors, (0), 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-12 10:30:45,370 INFO L81 ComplementDD]: Finished complementDD. Result has 62 states, 62 states have (on average 142.0) internal successors, (8804), 62 states have internal predecessors, (8804), 0 states have call successors, (0), 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-12 10:30:45,370 INFO L186 Difference]: Start difference. First operand has 331 places, 670 transitions, 6791 flow. Second operand 61 states and 4800 transitions. [2022-07-12 10:30:45,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 2700 transitions, 46887 flow