./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-min-max-1.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 0e7e1d85f63f5db62c0766d87dec12398108cf8053838b2df867ce8148d55e54 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 21:44:10,007 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 21:44:10,009 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 21:44:10,028 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 21:44:10,029 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 21:44:10,030 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 21:44:10,031 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 21:44:10,032 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 21:44:10,033 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 21:44:10,033 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 21:44:10,034 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 21:44:10,035 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 21:44:10,035 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 21:44:10,036 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 21:44:10,036 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 21:44:10,037 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 21:44:10,037 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 21:44:10,038 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 21:44:10,039 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 21:44:10,040 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 21:44:10,041 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 21:44:10,042 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 21:44:10,042 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 21:44:10,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 21:44:10,043 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 21:44:10,045 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 21:44:10,045 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 21:44:10,046 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 21:44:10,046 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 21:44:10,046 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 21:44:10,047 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 21:44:10,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 21:44:10,048 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 21:44:10,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 21:44:10,048 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 21:44:10,049 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 21:44:10,049 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 21:44:10,050 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 21:44:10,050 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 21:44:10,050 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 21:44:10,051 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 21:44:10,051 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 21:44:10,052 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 21:44:10,065 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 21:44:10,065 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 21:44:10,065 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 21:44:10,065 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 21:44:10,066 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 21:44:10,066 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 21:44:10,067 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 21:44:10,067 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 21:44:10,067 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 21:44:10,067 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 21:44:10,067 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 21:44:10,067 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 21:44:10,068 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 21:44:10,068 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 21:44:10,068 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 21:44:10,068 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 21:44:10,068 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 21:44:10,068 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 21:44:10,068 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 21:44:10,068 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 21:44:10,069 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 21:44:10,069 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 21:44:10,069 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 21:44:10,069 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 21:44:10,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:44:10,069 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 21:44:10,070 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 21:44:10,070 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 21:44:10,070 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 21:44:10,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 21:44:10,070 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 21:44:10,070 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 21:44:10,070 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 21:44:10,070 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 -> 0e7e1d85f63f5db62c0766d87dec12398108cf8053838b2df867ce8148d55e54 [2022-07-22 21:44:10,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 21:44:10,267 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 21:44:10,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 21:44:10,270 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 21:44:10,270 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 21:44:10,271 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c [2022-07-22 21:44:10,328 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a22c40888/d3e8cf50e9d14f9caa23e5bbd982934b/FLAG01ead9b09 [2022-07-22 21:44:10,636 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 21:44:10,637 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c [2022-07-22 21:44:10,644 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a22c40888/d3e8cf50e9d14f9caa23e5bbd982934b/FLAG01ead9b09 [2022-07-22 21:44:11,056 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a22c40888/d3e8cf50e9d14f9caa23e5bbd982934b [2022-07-22 21:44:11,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 21:44:11,059 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 21:44:11,062 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 21:44:11,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 21:44:11,065 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 21:44:11,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:44:11" (1/1) ... [2022-07-22 21:44:11,066 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7872e083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:44:11, skipping insertion in model container [2022-07-22 21:44:11,067 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:44:11" (1/1) ... [2022-07-22 21:44:11,071 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 21:44:11,083 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 21:44:11,210 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/parallel-min-max-1.wvr.c[3057,3070] [2022-07-22 21:44:11,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:44:11,226 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 21:44:11,251 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/parallel-min-max-1.wvr.c[3057,3070] [2022-07-22 21:44:11,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:44:11,262 INFO L208 MainTranslator]: Completed translation [2022-07-22 21:44:11,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:44:11 WrapperNode [2022-07-22 21:44:11,262 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 21:44:11,263 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 21:44:11,263 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 21:44:11,263 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 21:44:11,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:44:11" (1/1) ... [2022-07-22 21:44:11,282 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:44:11" (1/1) ... [2022-07-22 21:44:11,298 INFO L137 Inliner]: procedures = 25, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2022-07-22 21:44:11,298 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 21:44:11,299 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 21:44:11,299 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 21:44:11,299 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 21:44:11,306 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:44:11" (1/1) ... [2022-07-22 21:44:11,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:44:11" (1/1) ... [2022-07-22 21:44:11,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:44:11" (1/1) ... [2022-07-22 21:44:11,320 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:44:11" (1/1) ... [2022-07-22 21:44:11,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:44:11" (1/1) ... [2022-07-22 21:44:11,344 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:44:11" (1/1) ... [2022-07-22 21:44:11,345 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:44:11" (1/1) ... [2022-07-22 21:44:11,347 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 21:44:11,348 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 21:44:11,348 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 21:44:11,348 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 21:44:11,352 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:44:11" (1/1) ... [2022-07-22 21:44:11,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:44:11,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:44:11,387 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 21:44:11,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 21:44:11,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 21:44:11,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 21:44:11,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 21:44:11,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 21:44:11,418 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 21:44:11,418 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 21:44:11,418 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 21:44:11,418 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 21:44:11,418 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-22 21:44:11,418 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-22 21:44:11,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 21:44:11,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 21:44:11,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 21:44:11,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 21:44:11,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 21:44:11,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 21:44:11,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 21:44:11,420 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 21:44:11,491 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 21:44:11,493 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 21:44:11,714 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 21:44:11,761 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 21:44:11,762 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 21:44:11,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:44:11 BoogieIcfgContainer [2022-07-22 21:44:11,763 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 21:44:11,764 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 21:44:11,764 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 21:44:11,766 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 21:44:11,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 09:44:11" (1/3) ... [2022-07-22 21:44:11,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7403b7b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:44:11, skipping insertion in model container [2022-07-22 21:44:11,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:44:11" (2/3) ... [2022-07-22 21:44:11,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7403b7b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:44:11, skipping insertion in model container [2022-07-22 21:44:11,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:44:11" (3/3) ... [2022-07-22 21:44:11,768 INFO L111 eAbstractionObserver]: Analyzing ICFG parallel-min-max-1.wvr.c [2022-07-22 21:44:11,771 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-22 21:44:11,777 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 21:44:11,777 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 21:44:11,777 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-22 21:44:11,830 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-22 21:44:11,862 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 174 places, 176 transitions, 376 flow [2022-07-22 21:44:11,904 INFO L129 PetriNetUnfolder]: 12/173 cut-off events. [2022-07-22 21:44:11,904 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 21:44:11,907 INFO L84 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 173 events. 12/173 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 101 event pairs, 0 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 142. Up to 2 conditions per place. [2022-07-22 21:44:11,907 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 176 transitions, 376 flow [2022-07-22 21:44:11,910 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 162 transitions, 342 flow [2022-07-22 21:44:11,916 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 21:44:11,926 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@5df9a637, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5b50d7da [2022-07-22 21:44:11,926 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-07-22 21:44:11,960 INFO L129 PetriNetUnfolder]: 12/161 cut-off events. [2022-07-22 21:44:11,965 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 21:44:11,965 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:11,966 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:44:11,967 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-22 21:44:11,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:11,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1201893929, now seen corresponding path program 1 times [2022-07-22 21:44:11,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:11,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542597842] [2022-07-22 21:44:11,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:11,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:12,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:12,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:12,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542597842] [2022-07-22 21:44:12,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542597842] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:44:12,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:44:12,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 21:44:12,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455289363] [2022-07-22 21:44:12,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:44:12,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 21:44:12,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:12,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 21:44:12,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-07-22 21:44:12,448 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 176 [2022-07-22 21:44:12,457 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 162 transitions, 342 flow. Second operand has 8 states, 8 states have (on average 120.75) internal successors, (966), 8 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:12,458 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:12,458 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 176 [2022-07-22 21:44:12,459 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:12,640 INFO L129 PetriNetUnfolder]: 80/356 cut-off events. [2022-07-22 21:44:12,640 INFO L130 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2022-07-22 21:44:12,644 INFO L84 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 356 events. 80/356 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1249 event pairs, 64 based on Foata normal form. 5/313 useless extension candidates. Maximal degree in co-relation 395. Up to 154 conditions per place. [2022-07-22 21:44:12,647 INFO L132 encePairwiseOnDemand]: 160/176 looper letters, 43 selfloop transitions, 7 changer transitions 5/158 dead transitions. [2022-07-22 21:44:12,647 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 158 transitions, 444 flow [2022-07-22 21:44:12,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 21:44:12,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-22 21:44:12,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 993 transitions. [2022-07-22 21:44:12,665 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7052556818181818 [2022-07-22 21:44:12,666 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 993 transitions. [2022-07-22 21:44:12,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 993 transitions. [2022-07-22 21:44:12,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:12,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 993 transitions. [2022-07-22 21:44:12,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 124.125) internal successors, (993), 8 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:12,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 176.0) internal successors, (1584), 9 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:12,681 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 176.0) internal successors, (1584), 9 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:12,682 INFO L186 Difference]: Start difference. First operand has 160 places, 162 transitions, 342 flow. Second operand 8 states and 993 transitions. [2022-07-22 21:44:12,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 158 transitions, 444 flow [2022-07-22 21:44:12,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 158 transitions, 432 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-07-22 21:44:12,688 INFO L242 Difference]: Finished difference. Result has 162 places, 150 transitions, 326 flow [2022-07-22 21:44:12,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=326, PETRI_PLACES=162, PETRI_TRANSITIONS=150} [2022-07-22 21:44:12,693 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 2 predicate places. [2022-07-22 21:44:12,693 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 150 transitions, 326 flow [2022-07-22 21:44:12,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 120.75) internal successors, (966), 8 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:12,694 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:12,694 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:44:12,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 21:44:12,694 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-22 21:44:12,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:12,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1093274316, now seen corresponding path program 1 times [2022-07-22 21:44:12,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:12,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131299797] [2022-07-22 21:44:12,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:12,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:12,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:12,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:12,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131299797] [2022-07-22 21:44:12,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131299797] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:44:12,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162228171] [2022-07-22 21:44:12,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:12,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:44:12,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:44:12,840 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 21:44:12,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 21:44:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:12,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 21:44:12,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:44:13,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:13,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:44:13,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:13,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162228171] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-22 21:44:13,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-22 21:44:13,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-07-22 21:44:13,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446074074] [2022-07-22 21:44:13,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:44:13,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:44:13,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:13,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:44:13,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-07-22 21:44:13,251 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 176 [2022-07-22 21:44:13,252 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 150 transitions, 326 flow. Second operand has 7 states, 7 states have (on average 138.71428571428572) internal successors, (971), 7 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:13,252 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:13,252 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 176 [2022-07-22 21:44:13,252 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:13,379 INFO L129 PetriNetUnfolder]: 134/508 cut-off events. [2022-07-22 21:44:13,379 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-07-22 21:44:13,380 INFO L84 FinitePrefix]: Finished finitePrefix Result has 802 conditions, 508 events. 134/508 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2222 event pairs, 85 based on Foata normal form. 0/456 useless extension candidates. Maximal degree in co-relation 706. Up to 111 conditions per place. [2022-07-22 21:44:13,382 INFO L132 encePairwiseOnDemand]: 168/176 looper letters, 34 selfloop transitions, 7 changer transitions 0/158 dead transitions. [2022-07-22 21:44:13,382 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 158 transitions, 426 flow [2022-07-22 21:44:13,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 21:44:13,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-22 21:44:13,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 986 transitions. [2022-07-22 21:44:13,384 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8003246753246753 [2022-07-22 21:44:13,385 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 986 transitions. [2022-07-22 21:44:13,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 986 transitions. [2022-07-22 21:44:13,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:13,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 986 transitions. [2022-07-22 21:44:13,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.85714285714286) internal successors, (986), 7 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:13,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 176.0) internal successors, (1408), 8 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:13,390 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 176.0) internal successors, (1408), 8 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:13,390 INFO L186 Difference]: Start difference. First operand has 162 places, 150 transitions, 326 flow. Second operand 7 states and 986 transitions. [2022-07-22 21:44:13,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 158 transitions, 426 flow [2022-07-22 21:44:13,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 158 transitions, 414 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-07-22 21:44:13,395 INFO L242 Difference]: Finished difference. Result has 160 places, 152 transitions, 347 flow [2022-07-22 21:44:13,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=347, PETRI_PLACES=160, PETRI_TRANSITIONS=152} [2022-07-22 21:44:13,396 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 0 predicate places. [2022-07-22 21:44:13,396 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 152 transitions, 347 flow [2022-07-22 21:44:13,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 138.71428571428572) internal successors, (971), 7 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:13,397 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:13,397 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:44:13,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 21:44:13,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:44:13,612 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-22 21:44:13,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:13,612 INFO L85 PathProgramCache]: Analyzing trace with hash 6752642, now seen corresponding path program 1 times [2022-07-22 21:44:13,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:13,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778661525] [2022-07-22 21:44:13,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:13,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:13,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:13,728 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-22 21:44:13,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:13,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778661525] [2022-07-22 21:44:13,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778661525] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:44:13,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557007752] [2022-07-22 21:44:13,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:13,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:44:13,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:44:13,730 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 21:44:13,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 21:44:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:13,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 21:44:13,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:44:13,906 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-22 21:44:13,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:44:14,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 21:44:14,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557007752] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-22 21:44:14,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-22 21:44:14,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-07-22 21:44:14,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26529681] [2022-07-22 21:44:14,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:44:14,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:44:14,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:14,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:44:14,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-07-22 21:44:14,026 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 176 [2022-07-22 21:44:14,027 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 152 transitions, 347 flow. Second operand has 7 states, 7 states have (on average 139.0) internal successors, (973), 7 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:14,027 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:14,027 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 176 [2022-07-22 21:44:14,027 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:14,136 INFO L129 PetriNetUnfolder]: 136/494 cut-off events. [2022-07-22 21:44:14,136 INFO L130 PetriNetUnfolder]: For 105/141 co-relation queries the response was YES. [2022-07-22 21:44:14,137 INFO L84 FinitePrefix]: Finished finitePrefix Result has 885 conditions, 494 events. 136/494 cut-off events. For 105/141 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2093 event pairs, 57 based on Foata normal form. 36/498 useless extension candidates. Maximal degree in co-relation 784. Up to 119 conditions per place. [2022-07-22 21:44:14,141 INFO L132 encePairwiseOnDemand]: 168/176 looper letters, 36 selfloop transitions, 7 changer transitions 0/160 dead transitions. [2022-07-22 21:44:14,141 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 160 transitions, 459 flow [2022-07-22 21:44:14,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 21:44:14,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-22 21:44:14,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 986 transitions. [2022-07-22 21:44:14,143 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8003246753246753 [2022-07-22 21:44:14,143 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 986 transitions. [2022-07-22 21:44:14,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 986 transitions. [2022-07-22 21:44:14,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:14,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 986 transitions. [2022-07-22 21:44:14,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.85714285714286) internal successors, (986), 7 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:14,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 176.0) internal successors, (1408), 8 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:14,150 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 176.0) internal successors, (1408), 8 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:14,150 INFO L186 Difference]: Start difference. First operand has 160 places, 152 transitions, 347 flow. Second operand 7 states and 986 transitions. [2022-07-22 21:44:14,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 160 transitions, 459 flow [2022-07-22 21:44:14,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 160 transitions, 450 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-22 21:44:14,154 INFO L242 Difference]: Finished difference. Result has 164 places, 153 transitions, 366 flow [2022-07-22 21:44:14,154 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=366, PETRI_PLACES=164, PETRI_TRANSITIONS=153} [2022-07-22 21:44:14,155 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 4 predicate places. [2022-07-22 21:44:14,156 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 153 transitions, 366 flow [2022-07-22 21:44:14,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 139.0) internal successors, (973), 7 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:14,156 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:14,156 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:44:14,176 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-22 21:44:14,360 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,SelfDestructingSolverStorable2 [2022-07-22 21:44:14,361 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-22 21:44:14,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:14,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1616648338, now seen corresponding path program 1 times [2022-07-22 21:44:14,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:14,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166711855] [2022-07-22 21:44:14,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:14,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:14,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 21:44:14,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:14,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166711855] [2022-07-22 21:44:14,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166711855] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:44:14,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:44:14,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 21:44:14,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419797250] [2022-07-22 21:44:14,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:44:14,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 21:44:14,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:14,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 21:44:14,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 21:44:14,487 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 176 [2022-07-22 21:44:14,487 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 153 transitions, 366 flow. Second operand has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:14,488 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:14,488 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 176 [2022-07-22 21:44:14,488 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:14,598 INFO L129 PetriNetUnfolder]: 94/428 cut-off events. [2022-07-22 21:44:14,598 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-07-22 21:44:14,600 INFO L84 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 428 events. 94/428 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1549 event pairs, 45 based on Foata normal form. 1/399 useless extension candidates. Maximal degree in co-relation 619. Up to 137 conditions per place. [2022-07-22 21:44:14,601 INFO L132 encePairwiseOnDemand]: 169/176 looper letters, 48 selfloop transitions, 3 changer transitions 4/163 dead transitions. [2022-07-22 21:44:14,601 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 163 transitions, 498 flow [2022-07-22 21:44:14,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 21:44:14,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-22 21:44:14,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 641 transitions. [2022-07-22 21:44:14,603 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7284090909090909 [2022-07-22 21:44:14,603 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 641 transitions. [2022-07-22 21:44:14,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 641 transitions. [2022-07-22 21:44:14,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:14,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 641 transitions. [2022-07-22 21:44:14,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:14,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:14,607 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:14,607 INFO L186 Difference]: Start difference. First operand has 164 places, 153 transitions, 366 flow. Second operand 5 states and 641 transitions. [2022-07-22 21:44:14,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 163 transitions, 498 flow [2022-07-22 21:44:14,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 163 transitions, 488 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-07-22 21:44:14,612 INFO L242 Difference]: Finished difference. Result has 167 places, 155 transitions, 384 flow [2022-07-22 21:44:14,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=384, PETRI_PLACES=167, PETRI_TRANSITIONS=155} [2022-07-22 21:44:14,613 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 7 predicate places. [2022-07-22 21:44:14,613 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 155 transitions, 384 flow [2022-07-22 21:44:14,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:14,614 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:14,614 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:44:14,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 21:44:14,614 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-22 21:44:14,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:14,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1309242489, now seen corresponding path program 1 times [2022-07-22 21:44:14,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:14,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463062380] [2022-07-22 21:44:14,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:14,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:14,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 21:44:14,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:14,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463062380] [2022-07-22 21:44:14,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463062380] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:44:14,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959528919] [2022-07-22 21:44:14,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:14,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:44:14,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:44:14,890 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-22 21:44:14,892 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-22 21:44:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:14,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-22 21:44:14,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:44:15,316 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 11 treesize of output 7 [2022-07-22 21:44:15,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 21:44:15,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 21:44:15,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 21:44:15,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 21:44:15,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 21:44:15,838 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 15 treesize of output 7 [2022-07-22 21:44:15,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:15,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:44:16,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 21:44:16,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959528919] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-22 21:44:16,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-22 21:44:16,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [16, 23] total 39 [2022-07-22 21:44:16,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549304460] [2022-07-22 21:44:16,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:44:16,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 21:44:16,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:16,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 21:44:16,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1347, Unknown=0, NotChecked=0, Total=1482 [2022-07-22 21:44:16,119 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 176 [2022-07-22 21:44:16,120 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 155 transitions, 384 flow. Second operand has 10 states, 10 states have (on average 107.1) internal successors, (1071), 10 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:16,120 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:16,120 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 176 [2022-07-22 21:44:16,121 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:17,045 INFO L129 PetriNetUnfolder]: 3759/7565 cut-off events. [2022-07-22 21:44:17,045 INFO L130 PetriNetUnfolder]: For 4577/4579 co-relation queries the response was YES. [2022-07-22 21:44:17,061 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17439 conditions, 7565 events. 3759/7565 cut-off events. For 4577/4579 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 61607 event pairs, 502 based on Foata normal form. 3/7341 useless extension candidates. Maximal degree in co-relation 17327. Up to 1402 conditions per place. [2022-07-22 21:44:17,105 INFO L132 encePairwiseOnDemand]: 164/176 looper letters, 149 selfloop transitions, 11 changer transitions 83/334 dead transitions. [2022-07-22 21:44:17,105 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 334 transitions, 1465 flow [2022-07-22 21:44:17,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 21:44:17,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-07-22 21:44:17,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1740 transitions. [2022-07-22 21:44:17,109 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6590909090909091 [2022-07-22 21:44:17,110 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1740 transitions. [2022-07-22 21:44:17,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1740 transitions. [2022-07-22 21:44:17,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:17,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1740 transitions. [2022-07-22 21:44:17,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 116.0) internal successors, (1740), 15 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:17,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 176.0) internal successors, (2816), 16 states have internal predecessors, (2816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:17,118 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 176.0) internal successors, (2816), 16 states have internal predecessors, (2816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:17,118 INFO L186 Difference]: Start difference. First operand has 167 places, 155 transitions, 384 flow. Second operand 15 states and 1740 transitions. [2022-07-22 21:44:17,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 334 transitions, 1465 flow [2022-07-22 21:44:17,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 334 transitions, 1453 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-07-22 21:44:17,147 INFO L242 Difference]: Finished difference. Result has 190 places, 165 transitions, 489 flow [2022-07-22 21:44:17,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=489, PETRI_PLACES=190, PETRI_TRANSITIONS=165} [2022-07-22 21:44:17,149 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 30 predicate places. [2022-07-22 21:44:17,149 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 165 transitions, 489 flow [2022-07-22 21:44:17,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 107.1) internal successors, (1071), 10 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:17,150 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:17,150 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:44:17,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 21:44:17,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:44:17,368 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-22 21:44:17,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:17,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1173872667, now seen corresponding path program 2 times [2022-07-22 21:44:17,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:17,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69035158] [2022-07-22 21:44:17,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:17,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:17,553 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-22 21:44:17,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:17,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69035158] [2022-07-22 21:44:17,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69035158] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:44:17,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872105394] [2022-07-22 21:44:17,554 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 21:44:17,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:44:17,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:44:17,555 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-22 21:44:17,556 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-22 21:44:17,749 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 21:44:17,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 21:44:17,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-22 21:44:17,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:44:18,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 21:44:18,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 21:44:18,090 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:44:18,090 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 61 treesize of output 41 [2022-07-22 21:44:18,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 21:44:18,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:44:18,372 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_164 (Array Int Int))) (<= c_~min~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_164) c_~A~0.base) c_~A~0.offset))) is different from false [2022-07-22 21:44:18,422 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((thread1Thread1of1ForFork0_~i~0 Int) (v_ArrVal_164 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< c_~min~0 .cse0) (<= .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_164) c_~A~0.base) c_~A~0.offset))))) (or (forall ((v_ArrVal_164 (Array Int Int))) (<= c_~min~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_164) c_~A~0.base) c_~A~0.offset))) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (not (< c_~min~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))))))) is different from false [2022-07-22 21:44:18,479 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:44:18,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 89 [2022-07-22 21:44:18,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2022-07-22 21:44:18,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-07-22 21:44:18,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-07-22 21:44:18,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872105394] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:44:18,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:44:18,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 34 [2022-07-22 21:44:18,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994530643] [2022-07-22 21:44:18,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:44:18,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-22 21:44:18,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:18,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-22 21:44:18,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=901, Unknown=2, NotChecked=122, Total=1122 [2022-07-22 21:44:18,659 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 176 [2022-07-22 21:44:18,662 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 165 transitions, 489 flow. Second operand has 34 states, 34 states have (on average 89.97058823529412) internal successors, (3059), 34 states have internal predecessors, (3059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:18,662 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:18,662 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 176 [2022-07-22 21:44:18,662 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:19,644 INFO L129 PetriNetUnfolder]: 1281/4211 cut-off events. [2022-07-22 21:44:19,645 INFO L130 PetriNetUnfolder]: For 6143/6586 co-relation queries the response was YES. [2022-07-22 21:44:19,659 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10855 conditions, 4211 events. 1281/4211 cut-off events. For 6143/6586 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 39608 event pairs, 311 based on Foata normal form. 111/4133 useless extension candidates. Maximal degree in co-relation 10778. Up to 635 conditions per place. [2022-07-22 21:44:19,669 INFO L132 encePairwiseOnDemand]: 158/176 looper letters, 121 selfloop transitions, 21 changer transitions 31/254 dead transitions. [2022-07-22 21:44:19,670 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 254 transitions, 1260 flow [2022-07-22 21:44:19,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-22 21:44:19,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-07-22 21:44:19,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1845 transitions. [2022-07-22 21:44:19,674 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.5241477272727273 [2022-07-22 21:44:19,674 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1845 transitions. [2022-07-22 21:44:19,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1845 transitions. [2022-07-22 21:44:19,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:19,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1845 transitions. [2022-07-22 21:44:19,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 92.25) internal successors, (1845), 20 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:19,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 176.0) internal successors, (3696), 21 states have internal predecessors, (3696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:19,683 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 176.0) internal successors, (3696), 21 states have internal predecessors, (3696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:19,683 INFO L186 Difference]: Start difference. First operand has 190 places, 165 transitions, 489 flow. Second operand 20 states and 1845 transitions. [2022-07-22 21:44:19,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 254 transitions, 1260 flow [2022-07-22 21:44:19,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 254 transitions, 1200 flow, removed 30 selfloop flow, removed 7 redundant places. [2022-07-22 21:44:19,699 INFO L242 Difference]: Finished difference. Result has 201 places, 173 transitions, 597 flow [2022-07-22 21:44:19,699 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=597, PETRI_PLACES=201, PETRI_TRANSITIONS=173} [2022-07-22 21:44:19,700 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 41 predicate places. [2022-07-22 21:44:19,700 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 173 transitions, 597 flow [2022-07-22 21:44:19,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 89.97058823529412) internal successors, (3059), 34 states have internal predecessors, (3059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:19,701 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:19,701 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:44:19,721 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-22 21:44:19,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:44:19,918 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-22 21:44:19,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:19,918 INFO L85 PathProgramCache]: Analyzing trace with hash 2123503417, now seen corresponding path program 3 times [2022-07-22 21:44:19,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:19,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245894336] [2022-07-22 21:44:19,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:19,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:20,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 21:44:20,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:20,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245894336] [2022-07-22 21:44:20,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245894336] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:44:20,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104087813] [2022-07-22 21:44:20,009 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 21:44:20,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:44:20,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:44:20,011 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-22 21:44:20,012 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-22 21:44:20,118 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-22 21:44:20,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 21:44:20,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-22 21:44:20,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:44:20,402 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 11 treesize of output 7 [2022-07-22 21:44:20,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 21:44:20,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 21:44:20,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 21:44:20,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-07-22 21:44:20,827 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 15 treesize of output 7 [2022-07-22 21:44:20,885 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-22 21:44:20,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:44:21,212 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_201 (Array Int Int))) (<= (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201) c_~A~0.base) c_~A~0.offset) 1))) (forall ((v_ArrVal_201 (Array Int Int))) (<= (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201) c_~A~0.base) c_~A~0.offset)))) is different from false [2022-07-22 21:44:21,225 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_201 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (<= (select (select .cse0 c_~A~0.base) c_~A~0.offset) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201) c_~A~0.base) c_~A~0.offset) 1)))) (forall ((v_ArrVal_201 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (<= (select (select .cse1 c_~A~0.base) c_~A~0.offset) (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201) c_~A~0.base) c_~A~0.offset))))) is different from false [2022-07-22 21:44:21,275 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_199 (Array Int Int)) (v_ArrVal_201 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (<= (select (select .cse0 c_~A~0.base) c_~A~0.offset) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201) c_~A~0.base) c_~A~0.offset) 1)))) (forall ((v_ArrVal_199 (Array Int Int)) (v_ArrVal_201 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (<= (select (select .cse1 c_~A~0.base) c_~A~0.offset) (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201) c_~A~0.base) c_~A~0.offset))))) is different from false [2022-07-22 21:44:21,334 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_199 (Array Int Int)) (v_ArrVal_201 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (<= (select (select .cse0 |c_ULTIMATE.start_main_#t~ret17#1.base|) |c_ULTIMATE.start_main_#t~ret17#1.offset|) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_main_#t~ret17#1.base|) |c_ULTIMATE.start_main_#t~ret17#1.offset|) 1)))) (forall ((v_ArrVal_199 (Array Int Int)) (v_ArrVal_201 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (<= (select (select .cse1 |c_ULTIMATE.start_main_#t~ret17#1.base|) |c_ULTIMATE.start_main_#t~ret17#1.offset|) (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_main_#t~ret17#1.base|) |c_ULTIMATE.start_main_#t~ret17#1.offset|))))) is different from false [2022-07-22 21:44:21,344 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_199 (Array Int Int)) (v_ArrVal_201 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (<= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 1)))) (forall ((v_ArrVal_199 (Array Int Int)) (v_ArrVal_201 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (<= (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))) is different from false [2022-07-22 21:44:21,350 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_199 (Array Int Int)) (v_ArrVal_201 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (<= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (forall ((v_ArrVal_199 (Array Int Int)) (v_ArrVal_201 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200))) (<= (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1))))) is different from false [2022-07-22 21:44:21,373 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:44:21,373 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 52 treesize of output 41 [2022-07-22 21:44:21,376 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 2226 treesize of output 2066 [2022-07-22 21:44:21,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1790 treesize of output 1662 [2022-07-22 21:44:21,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1662 treesize of output 1550 [2022-07-22 21:44:21,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1550 treesize of output 1478 [2022-07-22 21:44:37,279 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-22 21:44:37,280 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 50 treesize of output 1 [2022-07-22 21:44:37,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-07-22 21:44:37,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104087813] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:44:37,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:44:37,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 21, 19] total 39 [2022-07-22 21:44:37,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487315802] [2022-07-22 21:44:37,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:44:37,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-22 21:44:37,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:37,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-22 21:44:37,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=958, Unknown=8, NotChecked=402, Total=1482 [2022-07-22 21:44:37,385 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 176 [2022-07-22 21:44:37,388 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 173 transitions, 597 flow. Second operand has 39 states, 39 states have (on average 81.38461538461539) internal successors, (3174), 39 states have internal predecessors, (3174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:37,388 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:37,388 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 176 [2022-07-22 21:44:37,388 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:40,240 INFO L129 PetriNetUnfolder]: 4410/10474 cut-off events. [2022-07-22 21:44:40,240 INFO L130 PetriNetUnfolder]: For 33726/34420 co-relation queries the response was YES. [2022-07-22 21:44:40,278 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33528 conditions, 10474 events. 4410/10474 cut-off events. For 33726/34420 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 101132 event pairs, 393 based on Foata normal form. 270/10404 useless extension candidates. Maximal degree in co-relation 33459. Up to 3611 conditions per place. [2022-07-22 21:44:40,314 INFO L132 encePairwiseOnDemand]: 144/176 looper letters, 236 selfloop transitions, 126 changer transitions 35/467 dead transitions. [2022-07-22 21:44:40,314 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 467 transitions, 3106 flow [2022-07-22 21:44:40,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-22 21:44:40,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2022-07-22 21:44:40,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 3191 transitions. [2022-07-22 21:44:40,320 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.4771232057416268 [2022-07-22 21:44:40,321 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 3191 transitions. [2022-07-22 21:44:40,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 3191 transitions. [2022-07-22 21:44:40,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:40,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 3191 transitions. [2022-07-22 21:44:40,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 83.97368421052632) internal successors, (3191), 38 states have internal predecessors, (3191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:40,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 176.0) internal successors, (6864), 39 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:40,335 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 176.0) internal successors, (6864), 39 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:40,335 INFO L186 Difference]: Start difference. First operand has 201 places, 173 transitions, 597 flow. Second operand 38 states and 3191 transitions. [2022-07-22 21:44:40,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 467 transitions, 3106 flow [2022-07-22 21:44:40,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 467 transitions, 3039 flow, removed 24 selfloop flow, removed 14 redundant places. [2022-07-22 21:44:40,418 INFO L242 Difference]: Finished difference. Result has 239 places, 281 transitions, 1853 flow [2022-07-22 21:44:40,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=1853, PETRI_PLACES=239, PETRI_TRANSITIONS=281} [2022-07-22 21:44:40,419 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 79 predicate places. [2022-07-22 21:44:40,419 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 281 transitions, 1853 flow [2022-07-22 21:44:40,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 81.38461538461539) internal successors, (3174), 39 states have internal predecessors, (3174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:40,420 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:40,421 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:44:40,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-22 21:44:40,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:44:40,636 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-22 21:44:40,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:40,636 INFO L85 PathProgramCache]: Analyzing trace with hash -122503433, now seen corresponding path program 4 times [2022-07-22 21:44:40,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:40,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660945003] [2022-07-22 21:44:40,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:40,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:40,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:40,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 21:44:40,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:40,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660945003] [2022-07-22 21:44:40,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660945003] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:44:40,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:44:40,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 21:44:40,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41431925] [2022-07-22 21:44:40,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:44:40,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 21:44:40,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:40,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 21:44:40,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-22 21:44:40,782 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 176 [2022-07-22 21:44:40,783 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 281 transitions, 1853 flow. Second operand has 9 states, 9 states have (on average 122.0) internal successors, (1098), 9 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:40,783 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:40,783 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 176 [2022-07-22 21:44:40,783 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:41,154 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L75-->L77: Formula: (let ((.cse1 (select (select |v_#memory_int_37| v_~A~0.base_26) (+ (* v_thread2Thread1of1ForFork1_~i~1_7 4) v_~A~0.offset_26)))) (let ((.cse0 (< .cse1 v_~max~0_29))) (or (and (= |v_thread2Thread1of1ForFork1_#t~mem9_1| |v_thread2_#t~mem9_26|) (= v_~max~0_29 v_~max~0_28) .cse0) (and (not .cse0) (= .cse1 |v_thread2_#t~mem9_26|) (= |v_thread2_#t~mem9_26| v_~max~0_28))))) InVars {~A~0.base=v_~A~0.base_26, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_7, ~A~0.offset=v_~A~0.offset_26, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_1|, #memory_int=|v_#memory_int_37|, ~max~0=v_~max~0_29} OutVars{~A~0.base=v_~A~0.base_26, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_7, thread2Thread1of1ForFork1_#t~mem8=|v_thread2Thread1of1ForFork1_#t~mem8_1|, ~A~0.offset=v_~A~0.offset_26, #memory_int=|v_#memory_int_37|, ~max~0=v_~max~0_28, thread2Thread1of1ForFork1_#t~ite10=|v_thread2Thread1of1ForFork1_#t~ite10_1|} AuxVars[|v_thread2_#t~mem9_26|] AssignedVars[thread2Thread1of1ForFork1_#t~mem8, thread2Thread1of1ForFork1_#t~mem9, ~max~0, thread2Thread1of1ForFork1_#t~ite10][180], [Black: 190#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (<= ~N~0 0)) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1020#(and (or (<= 1 ~N~0) (not (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0))), Black: 199#(<= 1 ~N~0), 2#L109-3true, 1892#(or (not (= (+ ~v_assert~0 (* (- 256) (div ~v_assert~0 256))) (+ (* (- 256) (div ~b2~0 256)) ~b2~0))) (not (= (+ ~v_assert~0 (* (- 256) (div ~v_assert~0 256))) (+ ~b1~0 (* (- 256) (div ~b1~0 256))))) (not (= (+ ~v_assert~0 (* (- 256) (div ~v_assert~0 256))) 0)) (not |ULTIMATE.start_main_#t~short19#1|)), 3800#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), 1904#true, 4838#true, Black: 4814#(and (= ~v_assert~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4785#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~min~0 ~max~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4779#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~max~0 ~min~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4801#(and (= (+ ~max~0 (* (- 1) ~min~0)) 0) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)), Black: 4777#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4182#(<= ~min~0 ~max~0), Black: 4783#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~min~0 ~max~0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0))) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 96#L77true, Black: 4790#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~v_assert~0 1) (= ~max~0 ~min~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4788#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~min~0 ~max~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4816#(and (= ~v_assert~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4811#(and (or (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)) (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0) (<= ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (or (<= ~min~0 ~max~0) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0))) (or (<= ~min~0 ~max~0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)))), Black: 3825#(= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0), Black: 4198#(= ~v_assert~0 1), Black: 4792#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~v_assert~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4770#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (forall ((v_ArrVal_201 (Array Int Int))) (or (<= ~min~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201) ~A~0.base) ~A~0.offset)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201) ~A~0.base) ~A~0.offset) ~max~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|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~min~0 ~max~0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0))) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1033#(<= 1 ~N~0), Black: 4806#(and (= ~v_assert~0 1) (= (+ ~max~0 (* (- 1) ~min~0)) 0) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)), Black: 2826#(and (<= ~min~0 ~max~0) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))), Black: 4795#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= thread2Thread1of1ForFork1_~i~1 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4781#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= thread2Thread1of1ForFork1_~i~1 0) (= ~max~0 ~min~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4799#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~v_assert~0 1) (= thread2Thread1of1ForFork1_~i~1 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4797#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~v_assert~0 1) (= thread2Thread1of1ForFork1_~i~1 0) (= ~max~0 ~min~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2831#(and (or (not (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= ~min~0 ~max~0) (or (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (select (select |#memory_int| ~A~0.base) ~A~0.offset)))), Black: 3806#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2500#(and (or (not (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (or (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (select (select |#memory_int| ~A~0.base) ~A~0.offset)))), Black: 3803#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1915#(<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)), Black: 2828#(and (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0) (<= ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (or (<= ~min~0 ~max~0) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0))) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))), 3823#true, Black: 3798#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min~0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1916#(<= ~min~0 ~max~0), Black: 1890#true, 5#L59true]) [2022-07-22 21:44:41,155 INFO L384 tUnfolder$Statistics]: this new event has 114 ancestors and is not cut-off event [2022-07-22 21:44:41,155 INFO L387 tUnfolder$Statistics]: existing Event has 119 ancestors and is not cut-off event [2022-07-22 21:44:41,156 INFO L387 tUnfolder$Statistics]: existing Event has 114 ancestors and is not cut-off event [2022-07-22 21:44:41,156 INFO L387 tUnfolder$Statistics]: existing Event has 114 ancestors and is not cut-off event [2022-07-22 21:44:41,310 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([484] L109-3-->thread3ENTRY: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar3_2) (= 0 v_thread3Thread1of1ForFork2_thidvar2_2) (= |v_ULTIMATE.start_main_#t~pre24#1_6| v_thread3Thread1of1ForFork2_thidvar0_2) (= 0 v_thread3Thread1of1ForFork2_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre24#1=|v_ULTIMATE.start_main_#t~pre24#1_6|} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_2, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, ULTIMATE.start_main_#t~pre24#1=|v_ULTIMATE.start_main_#t~pre24#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_4|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar3, thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base][152], [Black: 190#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (<= ~N~0 0)) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1020#(and (or (<= 1 ~N~0) (not (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0))), Black: 199#(<= 1 ~N~0), 1892#(or (not (= (+ ~v_assert~0 (* (- 256) (div ~v_assert~0 256))) (+ (* (- 256) (div ~b2~0 256)) ~b2~0))) (not (= (+ ~v_assert~0 (* (- 256) (div ~v_assert~0 256))) (+ ~b1~0 (* (- 256) (div ~b1~0 256))))) (not (= (+ ~v_assert~0 (* (- 256) (div ~v_assert~0 256))) 0)) (not |ULTIMATE.start_main_#t~short19#1|)), 1904#true, 4838#true, Black: 4814#(and (= ~v_assert~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4785#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~min~0 ~max~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4779#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~max~0 ~min~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4801#(and (= (+ ~max~0 (* (- 1) ~min~0)) 0) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)), Black: 4777#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4182#(<= ~min~0 ~max~0), 3796#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 4783#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~min~0 ~max~0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0))) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4790#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~v_assert~0 1) (= ~max~0 ~min~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4788#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~min~0 ~max~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4816#(and (= ~v_assert~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4811#(and (or (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)) (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0) (<= ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (or (<= ~min~0 ~max~0) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0))) (or (<= ~min~0 ~max~0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)))), Black: 3825#(= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0), Black: 4198#(= ~v_assert~0 1), Black: 4792#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~v_assert~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4770#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (forall ((v_ArrVal_201 (Array Int Int))) (or (<= ~min~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201) ~A~0.base) ~A~0.offset)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201) ~A~0.base) ~A~0.offset) ~max~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|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~min~0 ~max~0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0))) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1033#(<= 1 ~N~0), Black: 4806#(and (= ~v_assert~0 1) (= (+ ~max~0 (* (- 1) ~min~0)) 0) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)), Black: 2826#(and (<= ~min~0 ~max~0) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))), Black: 4795#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= thread2Thread1of1ForFork1_~i~1 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4781#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= thread2Thread1of1ForFork1_~i~1 0) (= ~max~0 ~min~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4799#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~v_assert~0 1) (= thread2Thread1of1ForFork1_~i~1 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4797#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~v_assert~0 1) (= thread2Thread1of1ForFork1_~i~1 0) (= ~max~0 ~min~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2831#(and (or (not (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= ~min~0 ~max~0) (or (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (select (select |#memory_int| ~A~0.base) ~A~0.offset)))), Black: 3806#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), 100#thread3ENTRYtrue, Black: 2500#(and (or (not (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (or (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (select (select |#memory_int| ~A~0.base) ~A~0.offset)))), Black: 3803#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1915#(<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)), 3823#true, Black: 3798#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min~0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2828#(and (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0) (<= ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (or (<= ~min~0 ~max~0) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0))) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))), Black: 1916#(<= ~min~0 ~max~0), Black: 1890#true, 5#L59true, 27#L109-4true, 74#L74-4true]) [2022-07-22 21:44:41,311 INFO L384 tUnfolder$Statistics]: this new event has 118 ancestors and is cut-off event [2022-07-22 21:44:41,311 INFO L387 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-07-22 21:44:41,311 INFO L387 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-07-22 21:44:41,311 INFO L387 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-07-22 21:44:41,311 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L75-->L77: Formula: (let ((.cse1 (select (select |v_#memory_int_37| v_~A~0.base_26) (+ (* v_thread2Thread1of1ForFork1_~i~1_7 4) v_~A~0.offset_26)))) (let ((.cse0 (< .cse1 v_~max~0_29))) (or (and (= |v_thread2Thread1of1ForFork1_#t~mem9_1| |v_thread2_#t~mem9_26|) (= v_~max~0_29 v_~max~0_28) .cse0) (and (not .cse0) (= .cse1 |v_thread2_#t~mem9_26|) (= |v_thread2_#t~mem9_26| v_~max~0_28))))) InVars {~A~0.base=v_~A~0.base_26, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_7, ~A~0.offset=v_~A~0.offset_26, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_1|, #memory_int=|v_#memory_int_37|, ~max~0=v_~max~0_29} OutVars{~A~0.base=v_~A~0.base_26, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_7, thread2Thread1of1ForFork1_#t~mem8=|v_thread2Thread1of1ForFork1_#t~mem8_1|, ~A~0.offset=v_~A~0.offset_26, #memory_int=|v_#memory_int_37|, ~max~0=v_~max~0_28, thread2Thread1of1ForFork1_#t~ite10=|v_thread2Thread1of1ForFork1_#t~ite10_1|} AuxVars[|v_thread2_#t~mem9_26|] AssignedVars[thread2Thread1of1ForFork1_#t~mem8, thread2Thread1of1ForFork1_#t~mem9, ~max~0, thread2Thread1of1ForFork1_#t~ite10][180], [Black: 190#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (<= ~N~0 0)) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1020#(and (or (<= 1 ~N~0) (not (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0))), Black: 199#(<= 1 ~N~0), 2#L109-3true, 1892#(or (not (= (+ ~v_assert~0 (* (- 256) (div ~v_assert~0 256))) (+ (* (- 256) (div ~b2~0 256)) ~b2~0))) (not (= (+ ~v_assert~0 (* (- 256) (div ~v_assert~0 256))) (+ ~b1~0 (* (- 256) (div ~b1~0 256))))) (not (= (+ ~v_assert~0 (* (- 256) (div ~v_assert~0 256))) 0)) (not |ULTIMATE.start_main_#t~short19#1|)), 1904#true, 4838#true, Black: 4814#(and (= ~v_assert~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4785#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~min~0 ~max~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4779#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~max~0 ~min~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4801#(and (= (+ ~max~0 (* (- 1) ~min~0)) 0) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)), Black: 4777#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4182#(<= ~min~0 ~max~0), 3796#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), 96#L77true, Black: 4783#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~min~0 ~max~0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0))) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4790#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~v_assert~0 1) (= ~max~0 ~min~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4788#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~min~0 ~max~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4816#(and (= ~v_assert~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4811#(and (or (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)) (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0) (<= ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (or (<= ~min~0 ~max~0) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0))) (or (<= ~min~0 ~max~0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)))), Black: 3825#(= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0), Black: 4198#(= ~v_assert~0 1), Black: 4792#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~v_assert~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4770#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (forall ((v_ArrVal_201 (Array Int Int))) (or (<= ~min~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201) ~A~0.base) ~A~0.offset)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201) ~A~0.base) ~A~0.offset) ~max~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|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~min~0 ~max~0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0))) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4806#(and (= ~v_assert~0 1) (= (+ ~max~0 (* (- 1) ~min~0)) 0) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)), Black: 1033#(<= 1 ~N~0), Black: 2826#(and (<= ~min~0 ~max~0) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))), Black: 4795#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= thread2Thread1of1ForFork1_~i~1 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4781#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= thread2Thread1of1ForFork1_~i~1 0) (= ~max~0 ~min~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4799#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~v_assert~0 1) (= thread2Thread1of1ForFork1_~i~1 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4797#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~v_assert~0 1) (= thread2Thread1of1ForFork1_~i~1 0) (= ~max~0 ~min~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2831#(and (or (not (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= ~min~0 ~max~0) (or (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (select (select |#memory_int| ~A~0.base) ~A~0.offset)))), Black: 3806#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2500#(and (or (not (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (or (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (select (select |#memory_int| ~A~0.base) ~A~0.offset)))), Black: 3803#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1915#(<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)), 3823#true, Black: 3798#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min~0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2828#(and (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0) (<= ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (or (<= ~min~0 ~max~0) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0))) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))), Black: 1916#(<= ~min~0 ~max~0), Black: 1890#true, 5#L59true]) [2022-07-22 21:44:41,326 INFO L384 tUnfolder$Statistics]: this new event has 119 ancestors and is cut-off event [2022-07-22 21:44:41,326 INFO L387 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-07-22 21:44:41,326 INFO L387 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-07-22 21:44:41,326 INFO L387 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-07-22 21:44:41,420 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([471] L75-->L77: Formula: (let ((.cse1 (select (select |v_#memory_int_37| v_~A~0.base_26) (+ (* v_thread2Thread1of1ForFork1_~i~1_7 4) v_~A~0.offset_26)))) (let ((.cse0 (< .cse1 v_~max~0_29))) (or (and (= |v_thread2Thread1of1ForFork1_#t~mem9_1| |v_thread2_#t~mem9_26|) (= v_~max~0_29 v_~max~0_28) .cse0) (and (not .cse0) (= .cse1 |v_thread2_#t~mem9_26|) (= |v_thread2_#t~mem9_26| v_~max~0_28))))) InVars {~A~0.base=v_~A~0.base_26, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_7, ~A~0.offset=v_~A~0.offset_26, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_1|, #memory_int=|v_#memory_int_37|, ~max~0=v_~max~0_29} OutVars{~A~0.base=v_~A~0.base_26, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_7, thread2Thread1of1ForFork1_#t~mem8=|v_thread2Thread1of1ForFork1_#t~mem8_1|, ~A~0.offset=v_~A~0.offset_26, #memory_int=|v_#memory_int_37|, ~max~0=v_~max~0_28, thread2Thread1of1ForFork1_#t~ite10=|v_thread2Thread1of1ForFork1_#t~ite10_1|} AuxVars[|v_thread2_#t~mem9_26|] AssignedVars[thread2Thread1of1ForFork1_#t~mem8, thread2Thread1of1ForFork1_#t~mem9, ~max~0, thread2Thread1of1ForFork1_#t~ite10][180], [Black: 190#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (<= ~N~0 0)) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1020#(and (or (<= 1 ~N~0) (not (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0))), Black: 199#(<= 1 ~N~0), 2#L109-3true, 1892#(or (not (= (+ ~v_assert~0 (* (- 256) (div ~v_assert~0 256))) (+ (* (- 256) (div ~b2~0 256)) ~b2~0))) (not (= (+ ~v_assert~0 (* (- 256) (div ~v_assert~0 256))) (+ ~b1~0 (* (- 256) (div ~b1~0 256))))) (not (= (+ ~v_assert~0 (* (- 256) (div ~v_assert~0 256))) 0)) (not |ULTIMATE.start_main_#t~short19#1|)), 1904#true, 4838#true, Black: 4814#(and (= ~v_assert~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4785#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~min~0 ~max~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4779#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~max~0 ~min~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4801#(and (= (+ ~max~0 (* (- 1) ~min~0)) 0) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)), Black: 4777#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4182#(<= ~min~0 ~max~0), 3796#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 4783#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~min~0 ~max~0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0))) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 96#L77true, Black: 4790#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~v_assert~0 1) (= ~max~0 ~min~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4788#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~min~0 ~max~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4816#(and (= ~v_assert~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4811#(and (or (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)) (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0) (<= ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (or (<= ~min~0 ~max~0) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0))) (or (<= ~min~0 ~max~0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)))), Black: 3825#(= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0), Black: 4198#(= ~v_assert~0 1), Black: 4792#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~v_assert~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4770#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (forall ((v_ArrVal_201 (Array Int Int))) (or (<= ~min~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201) ~A~0.base) ~A~0.offset)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201) ~A~0.base) ~A~0.offset) ~max~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|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~min~0 ~max~0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0))) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1033#(<= 1 ~N~0), Black: 4806#(and (= ~v_assert~0 1) (= (+ ~max~0 (* (- 1) ~min~0)) 0) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)), Black: 4795#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= thread2Thread1of1ForFork1_~i~1 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2826#(and (<= ~min~0 ~max~0) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))), Black: 4781#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= thread2Thread1of1ForFork1_~i~1 0) (= ~max~0 ~min~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4799#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~v_assert~0 1) (= thread2Thread1of1ForFork1_~i~1 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4797#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~v_assert~0 1) (= thread2Thread1of1ForFork1_~i~1 0) (= ~max~0 ~min~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2831#(and (or (not (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= ~min~0 ~max~0) (or (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (select (select |#memory_int| ~A~0.base) ~A~0.offset)))), Black: 3806#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2500#(and (or (not (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (or (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (select (select |#memory_int| ~A~0.base) ~A~0.offset)))), Black: 1915#(<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)), Black: 3803#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), 3823#true, Black: 2828#(and (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0) (<= ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (or (<= ~min~0 ~max~0) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0))) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))), Black: 3798#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min~0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1916#(<= ~min~0 ~max~0), Black: 1890#true, 5#L59true]) [2022-07-22 21:44:41,420 INFO L384 tUnfolder$Statistics]: this new event has 119 ancestors and is cut-off event [2022-07-22 21:44:41,420 INFO L387 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-07-22 21:44:41,420 INFO L387 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2022-07-22 21:44:41,420 INFO L387 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-07-22 21:44:41,421 INFO L387 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-07-22 21:44:41,441 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L75-->L77: Formula: (let ((.cse1 (select (select |v_#memory_int_37| v_~A~0.base_26) (+ (* v_thread2Thread1of1ForFork1_~i~1_7 4) v_~A~0.offset_26)))) (let ((.cse0 (< .cse1 v_~max~0_29))) (or (and (= |v_thread2Thread1of1ForFork1_#t~mem9_1| |v_thread2_#t~mem9_26|) (= v_~max~0_29 v_~max~0_28) .cse0) (and (not .cse0) (= .cse1 |v_thread2_#t~mem9_26|) (= |v_thread2_#t~mem9_26| v_~max~0_28))))) InVars {~A~0.base=v_~A~0.base_26, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_7, ~A~0.offset=v_~A~0.offset_26, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_1|, #memory_int=|v_#memory_int_37|, ~max~0=v_~max~0_29} OutVars{~A~0.base=v_~A~0.base_26, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_7, thread2Thread1of1ForFork1_#t~mem8=|v_thread2Thread1of1ForFork1_#t~mem8_1|, ~A~0.offset=v_~A~0.offset_26, #memory_int=|v_#memory_int_37|, ~max~0=v_~max~0_28, thread2Thread1of1ForFork1_#t~ite10=|v_thread2Thread1of1ForFork1_#t~ite10_1|} AuxVars[|v_thread2_#t~mem9_26|] AssignedVars[thread2Thread1of1ForFork1_#t~mem8, thread2Thread1of1ForFork1_#t~mem9, ~max~0, thread2Thread1of1ForFork1_#t~ite10][180], [Black: 190#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (<= ~N~0 0)) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 1020#(and (or (<= 1 ~N~0) (not (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0))), Black: 199#(<= 1 ~N~0), 1892#(or (not (= (+ ~v_assert~0 (* (- 256) (div ~v_assert~0 256))) (+ (* (- 256) (div ~b2~0 256)) ~b2~0))) (not (= (+ ~v_assert~0 (* (- 256) (div ~v_assert~0 256))) (+ ~b1~0 (* (- 256) (div ~b1~0 256))))) (not (= (+ ~v_assert~0 (* (- 256) (div ~v_assert~0 256))) 0)) (not |ULTIMATE.start_main_#t~short19#1|)), 3800#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), 4838#true, Black: 4814#(and (= ~v_assert~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4785#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~min~0 ~max~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4779#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~max~0 ~min~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 4198#(= ~v_assert~0 1), Black: 4801#(and (= (+ ~max~0 (* (- 1) ~min~0)) 0) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)), Black: 4777#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4182#(<= ~min~0 ~max~0), 39#L86true, Black: 4783#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (or (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~min~0 ~max~0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0))) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 96#L77true, Black: 4790#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~v_assert~0 1) (= ~max~0 ~min~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4788#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~min~0 ~max~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4816#(and (= ~v_assert~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4811#(and (or (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)) (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0) (<= ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (or (<= ~min~0 ~max~0) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0))) (or (<= ~min~0 ~max~0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)))), Black: 3825#(= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0), Black: 4792#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~v_assert~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4770#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (forall ((v_ArrVal_201 (Array Int Int))) (or (<= ~min~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201) ~A~0.base) ~A~0.offset)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201) ~A~0.base) ~A~0.offset) ~max~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|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= ~min~0 ~max~0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0))) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1033#(<= 1 ~N~0), Black: 4806#(and (= ~v_assert~0 1) (= (+ ~max~0 (* (- 1) ~min~0)) 0) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)), Black: 4795#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= thread2Thread1of1ForFork1_~i~1 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2826#(and (<= ~min~0 ~max~0) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))), Black: 4781#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= thread2Thread1of1ForFork1_~i~1 0) (= ~max~0 ~min~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4799#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~v_assert~0 1) (= thread2Thread1of1ForFork1_~i~1 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4797#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~v_assert~0 1) (= thread2Thread1of1ForFork1_~i~1 0) (= ~max~0 ~min~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~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|) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2831#(and (or (not (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= ~min~0 ~max~0) (or (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (select (select |#memory_int| ~A~0.base) ~A~0.offset)))), Black: 1904#true, Black: 3806#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2500#(and (or (not (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (or (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (select (select |#memory_int| ~A~0.base) ~A~0.offset)))), Black: 3803#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2828#(and (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0) (<= ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))) (or (<= ~min~0 ~max~0) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) ~max~0))) (<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))), Black: 3798#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~A~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min~0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1890#true, Black: 1916#(<= ~min~0 ~max~0), 5#L59true, 27#L109-4true, 1915#(<= ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))]) [2022-07-22 21:44:41,441 INFO L384 tUnfolder$Statistics]: this new event has 121 ancestors and is cut-off event [2022-07-22 21:44:41,441 INFO L387 tUnfolder$Statistics]: existing Event has 121 ancestors and is cut-off event [2022-07-22 21:44:41,441 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-07-22 21:44:41,442 INFO L387 tUnfolder$Statistics]: existing Event has 121 ancestors and is cut-off event [2022-07-22 21:44:41,697 INFO L129 PetriNetUnfolder]: 2368/7326 cut-off events. [2022-07-22 21:44:41,697 INFO L130 PetriNetUnfolder]: For 63125/64786 co-relation queries the response was YES. [2022-07-22 21:44:41,737 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31121 conditions, 7326 events. 2368/7326 cut-off events. For 63125/64786 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 77081 event pairs, 470 based on Foata normal form. 177/7149 useless extension candidates. Maximal degree in co-relation 31051. Up to 2012 conditions per place. [2022-07-22 21:44:41,757 INFO L132 encePairwiseOnDemand]: 165/176 looper letters, 142 selfloop transitions, 10 changer transitions 120/422 dead transitions. [2022-07-22 21:44:41,757 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 422 transitions, 3967 flow [2022-07-22 21:44:41,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 21:44:41,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-22 21:44:41,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1238 transitions. [2022-07-22 21:44:41,759 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7034090909090909 [2022-07-22 21:44:41,759 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1238 transitions. [2022-07-22 21:44:41,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1238 transitions. [2022-07-22 21:44:41,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:41,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1238 transitions. [2022-07-22 21:44:41,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 123.8) internal successors, (1238), 10 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:41,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 176.0) internal successors, (1936), 11 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:41,764 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 176.0) internal successors, (1936), 11 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:41,764 INFO L186 Difference]: Start difference. First operand has 239 places, 281 transitions, 1853 flow. Second operand 10 states and 1238 transitions. [2022-07-22 21:44:41,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 422 transitions, 3967 flow [2022-07-22 21:44:41,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 422 transitions, 3701 flow, removed 110 selfloop flow, removed 16 redundant places. [2022-07-22 21:44:41,909 INFO L242 Difference]: Finished difference. Result has 232 places, 264 transitions, 1562 flow [2022-07-22 21:44:41,910 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=1716, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1562, PETRI_PLACES=232, PETRI_TRANSITIONS=264} [2022-07-22 21:44:41,910 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 72 predicate places. [2022-07-22 21:44:41,910 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 264 transitions, 1562 flow [2022-07-22 21:44:41,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 122.0) internal successors, (1098), 9 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:41,911 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:41,911 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:44:41,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 21:44:41,911 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-22 21:44:41,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:41,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1245886479, now seen corresponding path program 5 times [2022-07-22 21:44:41,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:41,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788163606] [2022-07-22 21:44:41,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:41,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:42,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 21:44:42,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:42,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788163606] [2022-07-22 21:44:42,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788163606] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:44:42,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736444768] [2022-07-22 21:44:42,124 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 21:44:42,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:44:42,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:44:42,125 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 21:44:42,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-22 21:44:42,213 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-07-22 21:44:42,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 21:44:42,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-22 21:44:42,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:44:42,453 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 11 treesize of output 7 [2022-07-22 21:44:42,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 21:44:42,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 21:44:42,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 21:44:42,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 21:44:42,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 21:44:42,867 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 15 treesize of output 7 [2022-07-22 21:44:42,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:42,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:44:43,165 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_254 (Array Int Int))) (<= c_~min~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_254) c_~A~0.base) c_~A~0.offset))) is different from false [2022-07-22 21:44:43,174 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_254 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (<= c_~min~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_253) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_254) c_~A~0.base) c_~A~0.offset))) is different from false [2022-07-22 21:44:43,359 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_254 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (<= (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_253) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_254) c_~A~0.base) c_~A~0.offset))) is different from false [2022-07-22 21:44:43,378 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_252 (Array Int Int)) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_252))) (<= (select (select .cse0 c_~A~0.base) c_~A~0.offset) (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_253) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_254) c_~A~0.base) c_~A~0.offset)))) is different from false [2022-07-22 21:44:43,408 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_252 (Array Int Int)) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_252))) (<= (select (select .cse0 |c_ULTIMATE.start_main_#t~ret17#1.base|) |c_ULTIMATE.start_main_#t~ret17#1.offset|) (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_253) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_254) |c_ULTIMATE.start_main_#t~ret17#1.base|) |c_ULTIMATE.start_main_#t~ret17#1.offset|)))) is different from false [2022-07-22 21:44:43,413 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_252 (Array Int Int)) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_252))) (<= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_253) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_254) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) is different from false [2022-07-22 21:44:43,418 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_252 (Array Int Int)) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_252))) (<= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_253) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_254) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) is different from false [2022-07-22 21:44:43,432 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:44:43,432 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 47 treesize of output 36 [2022-07-22 21:44:43,435 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 2166 treesize of output 1910 [2022-07-22 21:44:43,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1396 treesize of output 1340 [2022-07-22 21:44:43,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1340 treesize of output 1256 [2022-07-22 21:44:43,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1256 treesize of output 1144 [2022-07-22 21:44:47,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-22 21:44:47,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736444768] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:44:47,176 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:44:47,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 24, 23] total 53 [2022-07-22 21:44:47,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326876878] [2022-07-22 21:44:47,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:44:47,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-22 21:44:47,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:47,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-22 21:44:47,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1870, Unknown=15, NotChecked=658, Total=2756 [2022-07-22 21:44:47,181 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 176 [2022-07-22 21:44:47,183 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 264 transitions, 1562 flow. Second operand has 53 states, 53 states have (on average 75.16981132075472) internal successors, (3984), 53 states have internal predecessors, (3984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:47,183 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:47,183 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 176 [2022-07-22 21:44:47,183 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:55,892 INFO L129 PetriNetUnfolder]: 19078/37421 cut-off events. [2022-07-22 21:44:55,893 INFO L130 PetriNetUnfolder]: For 360722/361557 co-relation queries the response was YES. [2022-07-22 21:44:56,122 INFO L84 FinitePrefix]: Finished finitePrefix Result has 170837 conditions, 37421 events. 19078/37421 cut-off events. For 360722/361557 co-relation queries the response was YES. Maximal size of possible extension queue 1772. Compared 384295 event pairs, 1174 based on Foata normal form. 183/37368 useless extension candidates. Maximal degree in co-relation 170746. Up to 7091 conditions per place. [2022-07-22 21:44:56,192 INFO L132 encePairwiseOnDemand]: 149/176 looper letters, 364 selfloop transitions, 77 changer transitions 502/1008 dead transitions. [2022-07-22 21:44:56,192 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 1008 transitions, 9385 flow [2022-07-22 21:44:56,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-07-22 21:44:56,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2022-07-22 21:44:56,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 4430 transitions. [2022-07-22 21:44:56,196 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.45764462809917356 [2022-07-22 21:44:56,196 INFO L72 ComplementDD]: Start complementDD. Operand 55 states and 4430 transitions. [2022-07-22 21:44:56,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 4430 transitions. [2022-07-22 21:44:56,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:56,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 55 states and 4430 transitions. [2022-07-22 21:44:56,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 56 states, 55 states have (on average 80.54545454545455) internal successors, (4430), 55 states have internal predecessors, (4430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:56,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 56 states, 56 states have (on average 176.0) internal successors, (9856), 56 states have internal predecessors, (9856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:56,212 INFO L81 ComplementDD]: Finished complementDD. Result has 56 states, 56 states have (on average 176.0) internal successors, (9856), 56 states have internal predecessors, (9856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:56,212 INFO L186 Difference]: Start difference. First operand has 232 places, 264 transitions, 1562 flow. Second operand 55 states and 4430 transitions. [2022-07-22 21:44:56,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 1008 transitions, 9385 flow [2022-07-22 21:44:57,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 1008 transitions, 9075 flow, removed 146 selfloop flow, removed 8 redundant places. [2022-07-22 21:44:57,280 INFO L242 Difference]: Finished difference. Result has 314 places, 290 transitions, 2254 flow [2022-07-22 21:44:57,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=1521, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=2254, PETRI_PLACES=314, PETRI_TRANSITIONS=290} [2022-07-22 21:44:57,281 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 154 predicate places. [2022-07-22 21:44:57,281 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 290 transitions, 2254 flow [2022-07-22 21:44:57,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 75.16981132075472) internal successors, (3984), 53 states have internal predecessors, (3984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:57,282 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:57,282 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:44:57,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-22 21:44:57,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:44:57,500 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-22 21:44:57,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:57,500 INFO L85 PathProgramCache]: Analyzing trace with hash 456128931, now seen corresponding path program 6 times [2022-07-22 21:44:57,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:57,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577812919] [2022-07-22 21:44:57,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:57,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:57,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 21:44:57,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:57,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577812919] [2022-07-22 21:44:57,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577812919] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:44:57,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273842013] [2022-07-22 21:44:57,622 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-22 21:44:57,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:44:57,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:44:57,624 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 21:44:57,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-22 21:44:57,711 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-07-22 21:44:57,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 21:44:57,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-22 21:44:57,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:44:57,927 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 11 treesize of output 7 [2022-07-22 21:44:58,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 21:44:58,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 21:44:58,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 21:44:58,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 21:44:58,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 21:44:58,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 21:44:58,525 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 15 treesize of output 7 [2022-07-22 21:44:58,590 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-22 21:44:58,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:44:58,779 WARN L833 $PredicateComparison]: unable to prove that (or (= (mod c_~b1~0 256) 0) (forall ((v_ArrVal_291 (Array Int Int))) (<= c_~min~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_291) c_~A~0.base) c_~A~0.offset)))) is different from false [2022-07-22 21:44:58,799 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_291 (Array Int Int))) (<= c_~min~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_290) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_291) c_~A~0.base) c_~A~0.offset))) (= (mod c_~b1~0 256) 0)) is different from false [2022-07-22 21:44:58,817 WARN L833 $PredicateComparison]: unable to prove that (or (= (mod c_~b1~0 256) 0) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_289 (Array Int Int))) (<= c_~min~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_290) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_291) c_~A~0.base) c_~A~0.offset)))) is different from false [2022-07-22 21:44:58,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 21:44:58,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273842013] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:44:58,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:44:58,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 25, 14] total 40 [2022-07-22 21:44:58,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722773038] [2022-07-22 21:44:58,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:44:58,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-22 21:44:58,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:58,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-22 21:44:58,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1133, Unknown=19, NotChecked=216, Total=1560 [2022-07-22 21:44:58,947 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 176 [2022-07-22 21:44:58,949 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 290 transitions, 2254 flow. Second operand has 40 states, 40 states have (on average 76.6) internal successors, (3064), 40 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:58,949 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:58,949 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 176 [2022-07-22 21:44:58,949 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:45:04,182 INFO L129 PetriNetUnfolder]: 5760/13767 cut-off events. [2022-07-22 21:45:04,182 INFO L130 PetriNetUnfolder]: For 361288/363047 co-relation queries the response was YES. [2022-07-22 21:45:04,269 INFO L84 FinitePrefix]: Finished finitePrefix Result has 83139 conditions, 13767 events. 5760/13767 cut-off events. For 361288/363047 co-relation queries the response was YES. Maximal size of possible extension queue 785. Compared 140483 event pairs, 827 based on Foata normal form. 473/13868 useless extension candidates. Maximal degree in co-relation 82936. Up to 3034 conditions per place. [2022-07-22 21:45:04,308 INFO L132 encePairwiseOnDemand]: 146/176 looper letters, 272 selfloop transitions, 100 changer transitions 344/790 dead transitions. [2022-07-22 21:45:04,308 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 790 transitions, 9235 flow [2022-07-22 21:45:04,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-22 21:45:04,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2022-07-22 21:45:04,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 3284 transitions. [2022-07-22 21:45:04,312 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.44426406926406925 [2022-07-22 21:45:04,312 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 3284 transitions. [2022-07-22 21:45:04,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 3284 transitions. [2022-07-22 21:45:04,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:45:04,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 3284 transitions. [2022-07-22 21:45:04,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 78.19047619047619) internal successors, (3284), 42 states have internal predecessors, (3284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:45:04,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 176.0) internal successors, (7568), 43 states have internal predecessors, (7568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:45:04,323 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 176.0) internal successors, (7568), 43 states have internal predecessors, (7568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:45:04,323 INFO L186 Difference]: Start difference. First operand has 314 places, 290 transitions, 2254 flow. Second operand 42 states and 3284 transitions. [2022-07-22 21:45:04,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 790 transitions, 9235 flow [2022-07-22 21:45:04,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 790 transitions, 8719 flow, removed 233 selfloop flow, removed 40 redundant places. [2022-07-22 21:45:05,000 INFO L242 Difference]: Finished difference. Result has 301 places, 307 transitions, 2824 flow [2022-07-22 21:45:05,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=2095, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=2824, PETRI_PLACES=301, PETRI_TRANSITIONS=307} [2022-07-22 21:45:05,001 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 141 predicate places. [2022-07-22 21:45:05,001 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 307 transitions, 2824 flow [2022-07-22 21:45:05,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 76.6) internal successors, (3064), 40 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:45:05,002 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:45:05,002 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:45:05,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-22 21:45:05,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:45:05,215 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-22 21:45:05,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:45:05,216 INFO L85 PathProgramCache]: Analyzing trace with hash -564985367, now seen corresponding path program 7 times [2022-07-22 21:45:05,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:45:05,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688725211] [2022-07-22 21:45:05,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:45:05,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:45:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:45:05,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 21:45:05,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:45:05,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688725211] [2022-07-22 21:45:05,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688725211] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:45:05,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90690039] [2022-07-22 21:45:05,306 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-22 21:45:05,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:45:05,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:45:05,307 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 21:45:05,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-22 21:45:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:45:05,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-22 21:45:05,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:45:05,593 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 11 treesize of output 7 [2022-07-22 21:45:05,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 21:45:05,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 21:45:05,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 21:45:05,833 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 15 treesize of output 7 [2022-07-22 21:45:05,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:45:05,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:45:06,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 21:45:06,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90690039] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:45:06,050 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:45:06,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 21, 10] total 29 [2022-07-22 21:45:06,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485304674] [2022-07-22 21:45:06,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:45:06,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-22 21:45:06,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:45:06,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-22 21:45:06,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2022-07-22 21:45:06,052 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 176 [2022-07-22 21:45:06,054 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 307 transitions, 2824 flow. Second operand has 29 states, 29 states have (on average 82.55172413793103) internal successors, (2394), 29 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:45:06,054 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:45:06,054 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 176 [2022-07-22 21:45:06,054 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:45:12,421 INFO L129 PetriNetUnfolder]: 15250/30630 cut-off events. [2022-07-22 21:45:12,421 INFO L130 PetriNetUnfolder]: For 933257/933453 co-relation queries the response was YES. [2022-07-22 21:45:12,690 INFO L84 FinitePrefix]: Finished finitePrefix Result has 192431 conditions, 30630 events. 15250/30630 cut-off events. For 933257/933453 co-relation queries the response was YES. Maximal size of possible extension queue 1420. Compared 310980 event pairs, 877 based on Foata normal form. 141/30674 useless extension candidates. Maximal degree in co-relation 192361. Up to 7767 conditions per place. [2022-07-22 21:45:12,717 INFO L132 encePairwiseOnDemand]: 152/176 looper letters, 0 selfloop transitions, 0 changer transitions 768/768 dead transitions. [2022-07-22 21:45:12,717 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 768 transitions, 9285 flow [2022-07-22 21:45:12,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-22 21:45:12,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2022-07-22 21:45:12,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 3323 transitions. [2022-07-22 21:45:12,720 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.4841200466200466 [2022-07-22 21:45:12,720 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 3323 transitions. [2022-07-22 21:45:12,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 3323 transitions. [2022-07-22 21:45:12,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:45:12,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 3323 transitions. [2022-07-22 21:45:12,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 85.2051282051282) internal successors, (3323), 39 states have internal predecessors, (3323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:45:12,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 176.0) internal successors, (7040), 40 states have internal predecessors, (7040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:45:12,729 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 176.0) internal successors, (7040), 40 states have internal predecessors, (7040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:45:12,729 INFO L186 Difference]: Start difference. First operand has 301 places, 307 transitions, 2824 flow. Second operand 39 states and 3323 transitions. [2022-07-22 21:45:12,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 768 transitions, 9285 flow [2022-07-22 21:45:13,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 768 transitions, 8767 flow, removed 212 selfloop flow, removed 34 redundant places. [2022-07-22 21:45:13,886 INFO L242 Difference]: Finished difference. Result has 288 places, 0 transitions, 0 flow [2022-07-22 21:45:13,886 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=2590, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=0, PETRI_PLACES=288, PETRI_TRANSITIONS=0} [2022-07-22 21:45:13,886 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 128 predicate places. [2022-07-22 21:45:13,886 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 0 transitions, 0 flow [2022-07-22 21:45:13,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 82.55172413793103) internal successors, (2394), 29 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:45:13,889 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-07-22 21:45:13,889 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-07-22 21:45:13,889 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-07-22 21:45:13,889 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-07-22 21:45:13,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-22 21:45:14,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-22 21:45:14,104 INFO L356 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1] [2022-07-22 21:45:14,106 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-22 21:45:14,106 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 21:45:14,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 09:45:14 BasicIcfg [2022-07-22 21:45:14,109 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 21:45:14,109 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 21:45:14,109 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 21:45:14,109 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 21:45:14,110 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:44:11" (3/4) ... [2022-07-22 21:45:14,111 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-22 21:45:14,115 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-07-22 21:45:14,115 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-07-22 21:45:14,115 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-07-22 21:45:14,131 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2022-07-22 21:45:14,132 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-07-22 21:45:14,132 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-22 21:45:14,132 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-22 21:45:14,163 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 21:45:14,163 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 21:45:14,164 INFO L158 Benchmark]: Toolchain (without parser) took 63104.20ms. Allocated memory was 130.0MB in the beginning and 6.0GB in the end (delta: 5.9GB). Free memory was 102.1MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2022-07-22 21:45:14,164 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 86.0MB. Free memory is still 44.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 21:45:14,164 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.64ms. Allocated memory is still 130.0MB. Free memory was 102.1MB in the beginning and 102.3MB in the end (delta: -185.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 21:45:14,164 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.72ms. Allocated memory is still 130.0MB. Free memory was 102.3MB in the beginning and 100.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 21:45:14,164 INFO L158 Benchmark]: Boogie Preprocessor took 48.38ms. Allocated memory is still 130.0MB. Free memory was 100.5MB in the beginning and 98.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 21:45:14,165 INFO L158 Benchmark]: RCFGBuilder took 415.44ms. Allocated memory is still 130.0MB. Free memory was 98.8MB in the beginning and 79.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-22 21:45:14,165 INFO L158 Benchmark]: TraceAbstraction took 62344.45ms. Allocated memory was 130.0MB in the beginning and 6.0GB in the end (delta: 5.9GB). Free memory was 79.2MB in the beginning and 4.4GB in the end (delta: -4.4GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2022-07-22 21:45:14,165 INFO L158 Benchmark]: Witness Printer took 54.05ms. Allocated memory is still 6.0GB. Free memory was 4.4GB in the beginning and 4.4GB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 21:45:14,167 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 86.0MB. Free memory is still 44.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 199.64ms. Allocated memory is still 130.0MB. Free memory was 102.1MB in the beginning and 102.3MB in the end (delta: -185.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.72ms. Allocated memory is still 130.0MB. Free memory was 102.3MB in the beginning and 100.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.38ms. Allocated memory is still 130.0MB. Free memory was 100.5MB in the beginning and 98.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 415.44ms. Allocated memory is still 130.0MB. Free memory was 98.8MB in the beginning and 79.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 62344.45ms. Allocated memory was 130.0MB in the beginning and 6.0GB in the end (delta: 5.9GB). Free memory was 79.2MB in the beginning and 4.4GB in the end (delta: -4.4GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 54.05ms. Allocated memory is still 6.0GB. Free memory was 4.4GB in the beginning and 4.4GB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 115]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 194 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 62.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 30.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4170 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4170 mSDsluCounter, 6063 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3209 IncrementalHoareTripleChecker+Unchecked, 6762 mSDsCounter, 512 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6113 IncrementalHoareTripleChecker+Invalid, 9834 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 512 mSolverCounterUnsat, 557 mSDtfsCounter, 6113 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2700 GetRequests, 2195 SyntacticMatches, 47 SemanticMatches, 458 ConstructedPredicates, 18 IntricatePredicates, 1 DeprecatedPredicates, 6904 ImplicationChecksByTransitivity, 11.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2824occurred in iteration=10, InterpolantAutomatonStates: 246, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 27.9s InterpolantComputationTime, 2753 NumberOfCodeBlocks, 2753 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 3891 ConstructedInterpolants, 121 QuantifiedInterpolants, 23565 SizeOfPredicates, 172 NumberOfNonLiveVariables, 2565 ConjunctsInSsa, 248 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 37/69 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-07-22 21:45:14,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE