./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-counter-fun.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-counter-fun.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 00b544e07f34285bd260f481b4b1205a15ed1c83d300c57496244de51f7f3936 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 21:47:13,077 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 21:47:13,080 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 21:47:13,125 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 21:47:13,126 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 21:47:13,128 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 21:47:13,130 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 21:47:13,132 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 21:47:13,134 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 21:47:13,138 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 21:47:13,139 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 21:47:13,141 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 21:47:13,141 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 21:47:13,143 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 21:47:13,144 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 21:47:13,146 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 21:47:13,148 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 21:47:13,149 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 21:47:13,150 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 21:47:13,156 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 21:47:13,158 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 21:47:13,159 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 21:47:13,160 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 21:47:13,161 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 21:47:13,162 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 21:47:13,169 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 21:47:13,169 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 21:47:13,170 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 21:47:13,171 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 21:47:13,171 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 21:47:13,172 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 21:47:13,173 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 21:47:13,175 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 21:47:13,176 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 21:47:13,176 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 21:47:13,177 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 21:47:13,177 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 21:47:13,178 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 21:47:13,178 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 21:47:13,178 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 21:47:13,179 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 21:47:13,181 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 21:47:13,182 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:47:13,211 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 21:47:13,212 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 21:47:13,212 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 21:47:13,213 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 21:47:13,213 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 21:47:13,214 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 21:47:13,214 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 21:47:13,214 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 21:47:13,215 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 21:47:13,215 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 21:47:13,216 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 21:47:13,216 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 21:47:13,216 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 21:47:13,216 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 21:47:13,217 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 21:47:13,217 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 21:47:13,217 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 21:47:13,217 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 21:47:13,218 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 21:47:13,219 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 21:47:13,219 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 21:47:13,219 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 21:47:13,219 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 21:47:13,220 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 21:47:13,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:47:13,220 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 21:47:13,220 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 21:47:13,221 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 21:47:13,221 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 21:47:13,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 21:47:13,221 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 21:47:13,222 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 21:47:13,222 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 21:47:13,222 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 -> 00b544e07f34285bd260f481b4b1205a15ed1c83d300c57496244de51f7f3936 [2022-07-22 21:47:13,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 21:47:13,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 21:47:13,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 21:47:13,494 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 21:47:13,495 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 21:47:13,496 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-counter-fun.wvr.c [2022-07-22 21:47:13,555 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff0cab8ae/d7bce02b90584ea2833a33cc285422f8/FLAG83a8bb161 [2022-07-22 21:47:14,042 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 21:47:14,042 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-counter-fun.wvr.c [2022-07-22 21:47:14,052 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff0cab8ae/d7bce02b90584ea2833a33cc285422f8/FLAG83a8bb161 [2022-07-22 21:47:14,571 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff0cab8ae/d7bce02b90584ea2833a33cc285422f8 [2022-07-22 21:47:14,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 21:47:14,574 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 21:47:14,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 21:47:14,578 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 21:47:14,580 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 21:47:14,581 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:47:14" (1/1) ... [2022-07-22 21:47:14,582 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12f59ed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:47:14, skipping insertion in model container [2022-07-22 21:47:14,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:47:14" (1/1) ... [2022-07-22 21:47:14,590 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 21:47:14,611 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 21:47:14,776 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-counter-fun.wvr.c[2681,2694] [2022-07-22 21:47:14,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:47:14,790 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 21:47:14,808 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-counter-fun.wvr.c[2681,2694] [2022-07-22 21:47:14,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:47:14,827 INFO L208 MainTranslator]: Completed translation [2022-07-22 21:47:14,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:47:14 WrapperNode [2022-07-22 21:47:14,828 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 21:47:14,829 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 21:47:14,829 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 21:47:14,829 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 21:47:14,836 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:47:14" (1/1) ... [2022-07-22 21:47:14,843 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:47:14" (1/1) ... [2022-07-22 21:47:14,887 INFO L137 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 193 [2022-07-22 21:47:14,887 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 21:47:14,888 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 21:47:14,888 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 21:47:14,888 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 21:47:14,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:47:14" (1/1) ... [2022-07-22 21:47:14,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:47:14" (1/1) ... [2022-07-22 21:47:14,910 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:47:14" (1/1) ... [2022-07-22 21:47:14,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:47:14" (1/1) ... [2022-07-22 21:47:14,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:47:14" (1/1) ... [2022-07-22 21:47:14,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:47:14" (1/1) ... [2022-07-22 21:47:14,932 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:47:14" (1/1) ... [2022-07-22 21:47:14,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 21:47:14,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 21:47:14,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 21:47:14,936 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 21:47:14,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:47:14" (1/1) ... [2022-07-22 21:47:14,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:47:14,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:47:14,966 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:47:14,968 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:47:14,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 21:47:14,994 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 21:47:14,994 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 21:47:14,995 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 21:47:14,995 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 21:47:14,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 21:47:14,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 21:47:14,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 21:47:14,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 21:47:14,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 21:47:14,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 21:47:14,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 21:47:14,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 21:47:14,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 21:47:14,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 21:47:14,998 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:47:15,072 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 21:47:15,074 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 21:47:15,499 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 21:47:15,678 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 21:47:15,678 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 21:47:15,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:47:15 BoogieIcfgContainer [2022-07-22 21:47:15,681 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 21:47:15,682 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 21:47:15,683 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 21:47:15,686 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 21:47:15,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 09:47:14" (1/3) ... [2022-07-22 21:47:15,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4f9a7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:47:15, skipping insertion in model container [2022-07-22 21:47:15,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:47:14" (2/3) ... [2022-07-22 21:47:15,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4f9a7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:47:15, skipping insertion in model container [2022-07-22 21:47:15,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:47:15" (3/3) ... [2022-07-22 21:47:15,689 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-counter-fun.wvr.c [2022-07-22 21:47:15,694 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-22 21:47:15,703 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 21:47:15,703 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 21:47:15,703 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-22 21:47:15,753 INFO L135 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 21:47:15,784 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 159 places, 165 transitions, 346 flow [2022-07-22 21:47:15,848 INFO L129 PetriNetUnfolder]: 13/163 cut-off events. [2022-07-22 21:47:15,848 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 21:47:15,853 INFO L84 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 163 events. 13/163 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 81 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 128. Up to 2 conditions per place. [2022-07-22 21:47:15,854 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 165 transitions, 346 flow [2022-07-22 21:47:15,860 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 154 transitions, 320 flow [2022-07-22 21:47:15,870 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 21:47:15,884 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@19970018, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@624ff6a9 [2022-07-22 21:47:15,884 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-07-22 21:47:15,939 INFO L129 PetriNetUnfolder]: 13/153 cut-off events. [2022-07-22 21:47:15,940 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 21:47:15,940 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:47:15,941 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] [2022-07-22 21:47:15,941 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:47:15,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:47:15,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1250269688, now seen corresponding path program 1 times [2022-07-22 21:47:15,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:47:15,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846179963] [2022-07-22 21:47:15,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:47:15,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:47:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:47:16,179 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:47:16,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:47:16,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846179963] [2022-07-22 21:47:16,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846179963] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:47:16,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:47:16,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 21:47:16,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270742495] [2022-07-22 21:47:16,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:47:16,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 21:47:16,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:47:16,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 21:47:16,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 21:47:16,214 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 165 [2022-07-22 21:47:16,217 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 154 transitions, 320 flow. Second operand has 2 states, 2 states have (on average 153.0) internal successors, (306), 2 states have internal predecessors, (306), 0 states have call successors, (0), 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:47:16,218 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:47:16,218 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 165 [2022-07-22 21:47:16,219 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:47:16,262 INFO L129 PetriNetUnfolder]: 13/178 cut-off events. [2022-07-22 21:47:16,263 INFO L130 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-07-22 21:47:16,264 INFO L84 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 178 events. 13/178 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 184 event pairs, 3 based on Foata normal form. 16/181 useless extension candidates. Maximal degree in co-relation 123. Up to 19 conditions per place. [2022-07-22 21:47:16,265 INFO L132 encePairwiseOnDemand]: 156/165 looper letters, 6 selfloop transitions, 0 changer transitions 5/145 dead transitions. [2022-07-22 21:47:16,266 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 145 transitions, 314 flow [2022-07-22 21:47:16,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 21:47:16,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-22 21:47:16,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 313 transitions. [2022-07-22 21:47:16,279 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9484848484848485 [2022-07-22 21:47:16,280 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 313 transitions. [2022-07-22 21:47:16,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 313 transitions. [2022-07-22 21:47:16,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:47:16,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 313 transitions. [2022-07-22 21:47:16,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 156.5) internal successors, (313), 2 states have internal predecessors, (313), 0 states have call successors, (0), 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:47:16,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 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:47:16,292 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 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:47:16,294 INFO L186 Difference]: Start difference. First operand has 148 places, 154 transitions, 320 flow. Second operand 2 states and 313 transitions. [2022-07-22 21:47:16,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 145 transitions, 314 flow [2022-07-22 21:47:16,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 145 transitions, 306 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-22 21:47:16,302 INFO L242 Difference]: Finished difference. Result has 145 places, 140 transitions, 284 flow [2022-07-22 21:47:16,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=284, PETRI_PLACES=145, PETRI_TRANSITIONS=140} [2022-07-22 21:47:16,309 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, -3 predicate places. [2022-07-22 21:47:16,310 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 140 transitions, 284 flow [2022-07-22 21:47:16,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 153.0) internal successors, (306), 2 states have internal predecessors, (306), 0 states have call successors, (0), 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:47:16,311 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:47:16,311 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] [2022-07-22 21:47:16,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 21:47:16,312 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:47:16,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:47:16,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1994540390, now seen corresponding path program 1 times [2022-07-22 21:47:16,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:47:16,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616303680] [2022-07-22 21:47:16,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:47:16,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:47:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:47:16,613 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:47:16,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:47:16,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616303680] [2022-07-22 21:47:16,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616303680] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:47:16,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:47:16,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 21:47:16,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352861393] [2022-07-22 21:47:16,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:47:16,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 21:47:16,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:47:16,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 21:47:16,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 21:47:16,619 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 165 [2022-07-22 21:47:16,620 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 140 transitions, 284 flow. Second operand has 5 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 0 states have call successors, (0), 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:47:16,620 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:47:16,620 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 165 [2022-07-22 21:47:16,620 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:47:16,731 INFO L129 PetriNetUnfolder]: 14/189 cut-off events. [2022-07-22 21:47:16,731 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-07-22 21:47:16,732 INFO L84 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 189 events. 14/189 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 244 event pairs, 0 based on Foata normal form. 1/182 useless extension candidates. Maximal degree in co-relation 238. Up to 23 conditions per place. [2022-07-22 21:47:16,733 INFO L132 encePairwiseOnDemand]: 159/165 looper letters, 28 selfloop transitions, 3 changer transitions 4/148 dead transitions. [2022-07-22 21:47:16,733 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 148 transitions, 373 flow [2022-07-22 21:47:16,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 21:47:16,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-22 21:47:16,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 651 transitions. [2022-07-22 21:47:16,738 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7890909090909091 [2022-07-22 21:47:16,738 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 651 transitions. [2022-07-22 21:47:16,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 651 transitions. [2022-07-22 21:47:16,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:47:16,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 651 transitions. [2022-07-22 21:47:16,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 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:47:16,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 165.0) internal successors, (990), 6 states have internal predecessors, (990), 0 states have call successors, (0), 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:47:16,746 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 165.0) internal successors, (990), 6 states have internal predecessors, (990), 0 states have call successors, (0), 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:47:16,746 INFO L186 Difference]: Start difference. First operand has 145 places, 140 transitions, 284 flow. Second operand 5 states and 651 transitions. [2022-07-22 21:47:16,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 148 transitions, 373 flow [2022-07-22 21:47:16,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 148 transitions, 373 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-22 21:47:16,750 INFO L242 Difference]: Finished difference. Result has 147 places, 142 transitions, 307 flow [2022-07-22 21:47:16,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=307, PETRI_PLACES=147, PETRI_TRANSITIONS=142} [2022-07-22 21:47:16,751 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, -1 predicate places. [2022-07-22 21:47:16,751 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 142 transitions, 307 flow [2022-07-22 21:47:16,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 0 states have call successors, (0), 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:47:16,752 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:47:16,753 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] [2022-07-22 21:47:16,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 21:47:16,753 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:47:16,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:47:16,754 INFO L85 PathProgramCache]: Analyzing trace with hash 353416500, now seen corresponding path program 1 times [2022-07-22 21:47:16,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:47:16,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333962625] [2022-07-22 21:47:16,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:47:16,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:47:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:47:16,896 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:47:16,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:47:16,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333962625] [2022-07-22 21:47:16,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333962625] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:47:16,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142552668] [2022-07-22 21:47:16,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:47:16,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:47:16,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:47:16,904 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:47:16,906 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:47:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:47:17,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 21:47:17,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:47:17,400 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:47:17,400 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 21:47:17,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142552668] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:47:17,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 21:47:17,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2022-07-22 21:47:17,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052386503] [2022-07-22 21:47:17,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:47:17,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:47:17,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:47:17,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:47:17,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-22 21:47:17,405 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 165 [2022-07-22 21:47:17,406 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 142 transitions, 307 flow. Second operand has 7 states, 7 states have (on average 124.57142857142857) internal successors, (872), 7 states have internal predecessors, (872), 0 states have call successors, (0), 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:47:17,406 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:47:17,406 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 165 [2022-07-22 21:47:17,406 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:47:17,586 INFO L129 PetriNetUnfolder]: 15/265 cut-off events. [2022-07-22 21:47:17,586 INFO L130 PetriNetUnfolder]: For 28/31 co-relation queries the response was YES. [2022-07-22 21:47:17,587 INFO L84 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 265 events. 15/265 cut-off events. For 28/31 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 504 event pairs, 2 based on Foata normal form. 4/253 useless extension candidates. Maximal degree in co-relation 363. Up to 37 conditions per place. [2022-07-22 21:47:17,589 INFO L132 encePairwiseOnDemand]: 153/165 looper letters, 31 selfloop transitions, 9 changer transitions 17/163 dead transitions. [2022-07-22 21:47:17,589 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 163 transitions, 467 flow [2022-07-22 21:47:17,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 21:47:17,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-22 21:47:17,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1267 transitions. [2022-07-22 21:47:17,594 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7678787878787878 [2022-07-22 21:47:17,594 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1267 transitions. [2022-07-22 21:47:17,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1267 transitions. [2022-07-22 21:47:17,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:47:17,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1267 transitions. [2022-07-22 21:47:17,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 126.7) internal successors, (1267), 10 states have internal predecessors, (1267), 0 states have call successors, (0), 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:47:17,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 165.0) internal successors, (1815), 11 states have internal predecessors, (1815), 0 states have call successors, (0), 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:47:17,604 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 165.0) internal successors, (1815), 11 states have internal predecessors, (1815), 0 states have call successors, (0), 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:47:17,605 INFO L186 Difference]: Start difference. First operand has 147 places, 142 transitions, 307 flow. Second operand 10 states and 1267 transitions. [2022-07-22 21:47:17,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 163 transitions, 467 flow [2022-07-22 21:47:17,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 163 transitions, 460 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-07-22 21:47:17,613 INFO L242 Difference]: Finished difference. Result has 153 places, 143 transitions, 332 flow [2022-07-22 21:47:17,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=332, PETRI_PLACES=153, PETRI_TRANSITIONS=143} [2022-07-22 21:47:17,616 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 5 predicate places. [2022-07-22 21:47:17,616 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 143 transitions, 332 flow [2022-07-22 21:47:17,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 124.57142857142857) internal successors, (872), 7 states have internal predecessors, (872), 0 states have call successors, (0), 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:47:17,617 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:47:17,617 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] [2022-07-22 21:47:17,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-22 21:47:17,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:47:17,843 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:47:17,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:47:17,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1935558459, now seen corresponding path program 1 times [2022-07-22 21:47:17,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:47:17,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286783017] [2022-07-22 21:47:17,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:47:17,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:47:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:47:17,951 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:47:17,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:47:17,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286783017] [2022-07-22 21:47:17,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286783017] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:47:17,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:47:17,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 21:47:17,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392479709] [2022-07-22 21:47:17,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:47:17,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 21:47:17,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:47:17,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 21:47:17,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 21:47:17,956 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 165 [2022-07-22 21:47:17,957 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 143 transitions, 332 flow. Second operand has 5 states, 5 states have (on average 139.8) internal successors, (699), 5 states have internal predecessors, (699), 0 states have call successors, (0), 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:47:17,957 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:47:17,958 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 165 [2022-07-22 21:47:17,958 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:47:18,074 INFO L129 PetriNetUnfolder]: 118/430 cut-off events. [2022-07-22 21:47:18,074 INFO L130 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2022-07-22 21:47:18,076 INFO L84 FinitePrefix]: Finished finitePrefix Result has 743 conditions, 430 events. 118/430 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1572 event pairs, 38 based on Foata normal form. 0/380 useless extension candidates. Maximal degree in co-relation 736. Up to 126 conditions per place. [2022-07-22 21:47:18,078 INFO L132 encePairwiseOnDemand]: 158/165 looper letters, 36 selfloop transitions, 5 changer transitions 4/168 dead transitions. [2022-07-22 21:47:18,078 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 168 transitions, 491 flow [2022-07-22 21:47:18,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 21:47:18,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-07-22 21:47:18,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 864 transitions. [2022-07-22 21:47:18,081 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8727272727272727 [2022-07-22 21:47:18,085 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 864 transitions. [2022-07-22 21:47:18,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 864 transitions. [2022-07-22 21:47:18,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:47:18,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 864 transitions. [2022-07-22 21:47:18,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 144.0) internal successors, (864), 6 states have internal predecessors, (864), 0 states have call successors, (0), 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:47:18,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 165.0) internal successors, (1155), 7 states have internal predecessors, (1155), 0 states have call successors, (0), 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:47:18,092 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 165.0) internal successors, (1155), 7 states have internal predecessors, (1155), 0 states have call successors, (0), 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:47:18,093 INFO L186 Difference]: Start difference. First operand has 153 places, 143 transitions, 332 flow. Second operand 6 states and 864 transitions. [2022-07-22 21:47:18,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 168 transitions, 491 flow [2022-07-22 21:47:18,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 168 transitions, 475 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-07-22 21:47:18,100 INFO L242 Difference]: Finished difference. Result has 153 places, 145 transitions, 342 flow [2022-07-22 21:47:18,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=342, PETRI_PLACES=153, PETRI_TRANSITIONS=145} [2022-07-22 21:47:18,102 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 5 predicate places. [2022-07-22 21:47:18,103 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 145 transitions, 342 flow [2022-07-22 21:47:18,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 139.8) internal successors, (699), 5 states have internal predecessors, (699), 0 states have call successors, (0), 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:47:18,105 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:47:18,105 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] [2022-07-22 21:47:18,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 21:47:18,105 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:47:18,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:47:18,108 INFO L85 PathProgramCache]: Analyzing trace with hash 47837291, now seen corresponding path program 2 times [2022-07-22 21:47:18,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:47:18,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049624512] [2022-07-22 21:47:18,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:47:18,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:47:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:47:18,189 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:47:18,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:47:18,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049624512] [2022-07-22 21:47:18,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049624512] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:47:18,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748082529] [2022-07-22 21:47:18,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 21:47:18,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:47:18,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:47:18,192 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:47:18,194 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:47:18,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 21:47:18,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 21:47:18,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 21:47:18,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:47:18,360 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:47:18,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:47:18,402 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:47:18,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748082529] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:47:18,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:47:18,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-07-22 21:47:18,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639361029] [2022-07-22 21:47:18,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:47:18,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 21:47:18,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:47:18,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 21:47:18,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-22 21:47:18,406 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 165 [2022-07-22 21:47:18,407 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 145 transitions, 342 flow. Second operand has 9 states, 9 states have (on average 139.44444444444446) internal successors, (1255), 9 states have internal predecessors, (1255), 0 states have call successors, (0), 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:47:18,408 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:47:18,408 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 165 [2022-07-22 21:47:18,408 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:47:18,660 INFO L129 PetriNetUnfolder]: 192/587 cut-off events. [2022-07-22 21:47:18,660 INFO L130 PetriNetUnfolder]: For 174/188 co-relation queries the response was YES. [2022-07-22 21:47:18,662 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1234 conditions, 587 events. 192/587 cut-off events. For 174/188 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2542 event pairs, 11 based on Foata normal form. 12/593 useless extension candidates. Maximal degree in co-relation 1224. Up to 71 conditions per place. [2022-07-22 21:47:18,665 INFO L132 encePairwiseOnDemand]: 157/165 looper letters, 72 selfloop transitions, 31 changer transitions 1/227 dead transitions. [2022-07-22 21:47:18,666 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 227 transitions, 842 flow [2022-07-22 21:47:18,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 21:47:18,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-22 21:47:18,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2008 transitions. [2022-07-22 21:47:18,671 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8692640692640693 [2022-07-22 21:47:18,671 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2008 transitions. [2022-07-22 21:47:18,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2008 transitions. [2022-07-22 21:47:18,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:47:18,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2008 transitions. [2022-07-22 21:47:18,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 143.42857142857142) internal successors, (2008), 14 states have internal predecessors, (2008), 0 states have call successors, (0), 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:47:18,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 165.0) internal successors, (2475), 15 states have internal predecessors, (2475), 0 states have call successors, (0), 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:47:18,682 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 165.0) internal successors, (2475), 15 states have internal predecessors, (2475), 0 states have call successors, (0), 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:47:18,683 INFO L186 Difference]: Start difference. First operand has 153 places, 145 transitions, 342 flow. Second operand 14 states and 2008 transitions. [2022-07-22 21:47:18,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 227 transitions, 842 flow [2022-07-22 21:47:18,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 227 transitions, 815 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-07-22 21:47:18,688 INFO L242 Difference]: Finished difference. Result has 169 places, 177 transitions, 554 flow [2022-07-22 21:47:18,689 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=554, PETRI_PLACES=169, PETRI_TRANSITIONS=177} [2022-07-22 21:47:18,689 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 21 predicate places. [2022-07-22 21:47:18,690 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 177 transitions, 554 flow [2022-07-22 21:47:18,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 139.44444444444446) internal successors, (1255), 9 states have internal predecessors, (1255), 0 states have call successors, (0), 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:47:18,690 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:47:18,690 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] [2022-07-22 21:47:18,719 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:47:18,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:47:18,912 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:47:18,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:47:18,912 INFO L85 PathProgramCache]: Analyzing trace with hash -129739051, now seen corresponding path program 3 times [2022-07-22 21:47:18,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:47:18,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646878152] [2022-07-22 21:47:18,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:47:18,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:47:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:47:18,989 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:47:18,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:47:18,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646878152] [2022-07-22 21:47:18,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646878152] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:47:18,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:47:18,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 21:47:18,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405514371] [2022-07-22 21:47:18,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:47:18,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 21:47:18,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:47:18,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 21:47:18,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 21:47:18,993 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 165 [2022-07-22 21:47:18,994 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 177 transitions, 554 flow. Second operand has 5 states, 5 states have (on average 139.8) internal successors, (699), 5 states have internal predecessors, (699), 0 states have call successors, (0), 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:47:18,994 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:47:18,994 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 165 [2022-07-22 21:47:18,994 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:47:19,160 INFO L129 PetriNetUnfolder]: 219/686 cut-off events. [2022-07-22 21:47:19,160 INFO L130 PetriNetUnfolder]: For 789/793 co-relation queries the response was YES. [2022-07-22 21:47:19,162 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1779 conditions, 686 events. 219/686 cut-off events. For 789/793 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3390 event pairs, 74 based on Foata normal form. 7/685 useless extension candidates. Maximal degree in co-relation 1763. Up to 229 conditions per place. [2022-07-22 21:47:19,166 INFO L132 encePairwiseOnDemand]: 157/165 looper letters, 76 selfloop transitions, 18 changer transitions 7/224 dead transitions. [2022-07-22 21:47:19,166 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 224 transitions, 1003 flow [2022-07-22 21:47:19,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 21:47:19,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-07-22 21:47:19,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 883 transitions. [2022-07-22 21:47:19,169 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8919191919191919 [2022-07-22 21:47:19,170 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 883 transitions. [2022-07-22 21:47:19,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 883 transitions. [2022-07-22 21:47:19,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:47:19,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 883 transitions. [2022-07-22 21:47:19,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 147.16666666666666) internal successors, (883), 6 states have internal predecessors, (883), 0 states have call successors, (0), 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:47:19,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 165.0) internal successors, (1155), 7 states have internal predecessors, (1155), 0 states have call successors, (0), 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:47:19,176 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 165.0) internal successors, (1155), 7 states have internal predecessors, (1155), 0 states have call successors, (0), 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:47:19,176 INFO L186 Difference]: Start difference. First operand has 169 places, 177 transitions, 554 flow. Second operand 6 states and 883 transitions. [2022-07-22 21:47:19,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 224 transitions, 1003 flow [2022-07-22 21:47:19,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 224 transitions, 1001 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-07-22 21:47:19,186 INFO L242 Difference]: Finished difference. Result has 176 places, 185 transitions, 669 flow [2022-07-22 21:47:19,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=669, PETRI_PLACES=176, PETRI_TRANSITIONS=185} [2022-07-22 21:47:19,187 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 28 predicate places. [2022-07-22 21:47:19,187 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 185 transitions, 669 flow [2022-07-22 21:47:19,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 139.8) internal successors, (699), 5 states have internal predecessors, (699), 0 states have call successors, (0), 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:47:19,187 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:47:19,188 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] [2022-07-22 21:47:19,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 21:47:19,188 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:47:19,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:47:19,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1786635215, now seen corresponding path program 4 times [2022-07-22 21:47:19,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:47:19,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258798567] [2022-07-22 21:47:19,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:47:19,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:47:19,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:47:19,263 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:47:19,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:47:19,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258798567] [2022-07-22 21:47:19,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258798567] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:47:19,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275916589] [2022-07-22 21:47:19,264 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 21:47:19,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:47:19,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:47:19,266 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:47:19,291 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:47:19,364 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 21:47:19,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 21:47:19,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 21:47:19,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:47:19,431 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:47:19,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:47:19,462 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:47:19,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275916589] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:47:19,463 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:47:19,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-07-22 21:47:19,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960946965] [2022-07-22 21:47:19,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:47:19,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 21:47:19,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:47:19,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 21:47:19,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-22 21:47:19,466 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 165 [2022-07-22 21:47:19,468 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 185 transitions, 669 flow. Second operand has 11 states, 11 states have (on average 139.8181818181818) internal successors, (1538), 11 states have internal predecessors, (1538), 0 states have call successors, (0), 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:47:19,468 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:47:19,468 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 165 [2022-07-22 21:47:19,468 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:47:19,712 INFO L129 PetriNetUnfolder]: 227/773 cut-off events. [2022-07-22 21:47:19,713 INFO L130 PetriNetUnfolder]: For 1214/1218 co-relation queries the response was YES. [2022-07-22 21:47:19,715 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2037 conditions, 773 events. 227/773 cut-off events. For 1214/1218 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4173 event pairs, 39 based on Foata normal form. 12/776 useless extension candidates. Maximal degree in co-relation 2018. Up to 129 conditions per place. [2022-07-22 21:47:19,719 INFO L132 encePairwiseOnDemand]: 157/165 looper letters, 76 selfloop transitions, 50 changer transitions 1/250 dead transitions. [2022-07-22 21:47:19,719 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 250 transitions, 1253 flow [2022-07-22 21:47:19,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 21:47:19,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-22 21:47:19,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1308 transitions. [2022-07-22 21:47:19,722 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8808080808080808 [2022-07-22 21:47:19,723 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1308 transitions. [2022-07-22 21:47:19,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1308 transitions. [2022-07-22 21:47:19,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:47:19,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1308 transitions. [2022-07-22 21:47:19,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 145.33333333333334) internal successors, (1308), 9 states have internal predecessors, (1308), 0 states have call successors, (0), 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:47:19,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 165.0) internal successors, (1650), 10 states have internal predecessors, (1650), 0 states have call successors, (0), 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:47:19,729 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 165.0) internal successors, (1650), 10 states have internal predecessors, (1650), 0 states have call successors, (0), 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:47:19,729 INFO L186 Difference]: Start difference. First operand has 176 places, 185 transitions, 669 flow. Second operand 9 states and 1308 transitions. [2022-07-22 21:47:19,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 250 transitions, 1253 flow [2022-07-22 21:47:19,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 250 transitions, 1236 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-07-22 21:47:19,737 INFO L242 Difference]: Finished difference. Result has 188 places, 206 transitions, 960 flow [2022-07-22 21:47:19,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=960, PETRI_PLACES=188, PETRI_TRANSITIONS=206} [2022-07-22 21:47:19,738 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 40 predicate places. [2022-07-22 21:47:19,739 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 206 transitions, 960 flow [2022-07-22 21:47:19,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 139.8181818181818) internal successors, (1538), 11 states have internal predecessors, (1538), 0 states have call successors, (0), 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:47:19,739 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:47:19,740 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] [2022-07-22 21:47:19,769 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:47:19,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:47:19,957 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:47:19,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:47:19,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1781093399, now seen corresponding path program 1 times [2022-07-22 21:47:19,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:47:19,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954394002] [2022-07-22 21:47:19,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:47:19,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:47:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:47:20,034 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:47:20,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:47:20,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954394002] [2022-07-22 21:47:20,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954394002] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:47:20,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076853079] [2022-07-22 21:47:20,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:47:20,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:47:20,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:47:20,036 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:47:20,038 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:47:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:47:20,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 21:47:20,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:47:20,375 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:47:20,375 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 21:47:20,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076853079] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:47:20,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 21:47:20,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2022-07-22 21:47:20,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256638515] [2022-07-22 21:47:20,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:47:20,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:47:20,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:47:20,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:47:20,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-22 21:47:20,378 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 165 [2022-07-22 21:47:20,379 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 206 transitions, 960 flow. Second operand has 7 states, 7 states have (on average 125.14285714285714) internal successors, (876), 7 states have internal predecessors, (876), 0 states have call successors, (0), 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:47:20,380 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:47:20,380 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 165 [2022-07-22 21:47:20,380 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:47:20,562 INFO L129 PetriNetUnfolder]: 87/575 cut-off events. [2022-07-22 21:47:20,563 INFO L130 PetriNetUnfolder]: For 1049/1083 co-relation queries the response was YES. [2022-07-22 21:47:20,565 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1420 conditions, 575 events. 87/575 cut-off events. For 1049/1083 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2844 event pairs, 17 based on Foata normal form. 18/578 useless extension candidates. Maximal degree in co-relation 1396. Up to 101 conditions per place. [2022-07-22 21:47:20,567 INFO L132 encePairwiseOnDemand]: 155/165 looper letters, 34 selfloop transitions, 7 changer transitions 5/215 dead transitions. [2022-07-22 21:47:20,567 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 215 transitions, 1074 flow [2022-07-22 21:47:20,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 21:47:20,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-22 21:47:20,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1013 transitions. [2022-07-22 21:47:20,571 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7674242424242425 [2022-07-22 21:47:20,571 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1013 transitions. [2022-07-22 21:47:20,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1013 transitions. [2022-07-22 21:47:20,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:47:20,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1013 transitions. [2022-07-22 21:47:20,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.625) internal successors, (1013), 8 states have internal predecessors, (1013), 0 states have call successors, (0), 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:47:20,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 165.0) internal successors, (1485), 9 states have internal predecessors, (1485), 0 states have call successors, (0), 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:47:20,577 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 165.0) internal successors, (1485), 9 states have internal predecessors, (1485), 0 states have call successors, (0), 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:47:20,578 INFO L186 Difference]: Start difference. First operand has 188 places, 206 transitions, 960 flow. Second operand 8 states and 1013 transitions. [2022-07-22 21:47:20,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 215 transitions, 1074 flow [2022-07-22 21:47:20,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 215 transitions, 1050 flow, removed 12 selfloop flow, removed 0 redundant places. [2022-07-22 21:47:20,588 INFO L242 Difference]: Finished difference. Result has 197 places, 207 transitions, 962 flow [2022-07-22 21:47:20,588 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=936, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=962, PETRI_PLACES=197, PETRI_TRANSITIONS=207} [2022-07-22 21:47:20,589 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 49 predicate places. [2022-07-22 21:47:20,589 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 207 transitions, 962 flow [2022-07-22 21:47:20,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 125.14285714285714) internal successors, (876), 7 states have internal predecessors, (876), 0 states have call successors, (0), 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:47:20,590 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:47:20,590 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] [2022-07-22 21:47:20,615 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:47:20,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:47:20,803 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:47:20,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:47:20,803 INFO L85 PathProgramCache]: Analyzing trace with hash -39766882, now seen corresponding path program 1 times [2022-07-22 21:47:20,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:47:20,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189753613] [2022-07-22 21:47:20,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:47:20,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:47:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:47:20,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 21:47:20,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:47:20,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189753613] [2022-07-22 21:47:20,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189753613] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:47:20,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:47:20,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 21:47:20,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690048849] [2022-07-22 21:47:20,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:47:20,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:47:20,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:47:20,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:47:20,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:47:20,883 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 165 [2022-07-22 21:47:20,884 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 207 transitions, 962 flow. Second operand has 6 states, 6 states have (on average 139.33333333333334) internal successors, (836), 6 states have internal predecessors, (836), 0 states have call successors, (0), 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:47:20,884 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:47:20,885 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 165 [2022-07-22 21:47:20,885 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:47:21,053 INFO L129 PetriNetUnfolder]: 223/748 cut-off events. [2022-07-22 21:47:21,054 INFO L130 PetriNetUnfolder]: For 1654/1658 co-relation queries the response was YES. [2022-07-22 21:47:21,057 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2215 conditions, 748 events. 223/748 cut-off events. For 1654/1658 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3909 event pairs, 82 based on Foata normal form. 15/751 useless extension candidates. Maximal degree in co-relation 2188. Up to 274 conditions per place. [2022-07-22 21:47:21,061 INFO L132 encePairwiseOnDemand]: 157/165 looper letters, 85 selfloop transitions, 21 changer transitions 1/231 dead transitions. [2022-07-22 21:47:21,061 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 231 transitions, 1295 flow [2022-07-22 21:47:21,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 21:47:21,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-07-22 21:47:21,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 876 transitions. [2022-07-22 21:47:21,064 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8848484848484849 [2022-07-22 21:47:21,064 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 876 transitions. [2022-07-22 21:47:21,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 876 transitions. [2022-07-22 21:47:21,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:47:21,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 876 transitions. [2022-07-22 21:47:21,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 146.0) internal successors, (876), 6 states have internal predecessors, (876), 0 states have call successors, (0), 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:47:21,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 165.0) internal successors, (1155), 7 states have internal predecessors, (1155), 0 states have call successors, (0), 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:47:21,070 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 165.0) internal successors, (1155), 7 states have internal predecessors, (1155), 0 states have call successors, (0), 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:47:21,070 INFO L186 Difference]: Start difference. First operand has 197 places, 207 transitions, 962 flow. Second operand 6 states and 876 transitions. [2022-07-22 21:47:21,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 231 transitions, 1295 flow [2022-07-22 21:47:21,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 231 transitions, 1271 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-07-22 21:47:21,082 INFO L242 Difference]: Finished difference. Result has 197 places, 206 transitions, 996 flow [2022-07-22 21:47:21,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=996, PETRI_PLACES=197, PETRI_TRANSITIONS=206} [2022-07-22 21:47:21,083 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 49 predicate places. [2022-07-22 21:47:21,083 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 206 transitions, 996 flow [2022-07-22 21:47:21,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 139.33333333333334) internal successors, (836), 6 states have internal predecessors, (836), 0 states have call successors, (0), 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:47:21,084 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:47:21,084 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] [2022-07-22 21:47:21,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 21:47:21,085 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:47:21,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:47:21,085 INFO L85 PathProgramCache]: Analyzing trace with hash 17527758, now seen corresponding path program 2 times [2022-07-22 21:47:21,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:47:21,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821113744] [2022-07-22 21:47:21,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:47:21,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:47:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:47:21,148 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:47:21,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:47:21,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821113744] [2022-07-22 21:47:21,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821113744] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:47:21,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517734047] [2022-07-22 21:47:21,149 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 21:47:21,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:47:21,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:47:21,151 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:47:21,164 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:47:21,278 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 21:47:21,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 21:47:21,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 21:47:21,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:47:21,315 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:47:21,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:47:21,343 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:47:21,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517734047] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:47:21,343 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:47:21,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-07-22 21:47:21,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860153675] [2022-07-22 21:47:21,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:47:21,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 21:47:21,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:47:21,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 21:47:21,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-22 21:47:21,346 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 165 [2022-07-22 21:47:21,348 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 206 transitions, 996 flow. Second operand has 9 states, 9 states have (on average 139.44444444444446) internal successors, (1255), 9 states have internal predecessors, (1255), 0 states have call successors, (0), 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:47:21,348 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:47:21,348 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 165 [2022-07-22 21:47:21,348 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:47:21,613 INFO L129 PetriNetUnfolder]: 255/833 cut-off events. [2022-07-22 21:47:21,614 INFO L130 PetriNetUnfolder]: For 2185/2185 co-relation queries the response was YES. [2022-07-22 21:47:21,618 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2584 conditions, 833 events. 255/833 cut-off events. For 2185/2185 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4493 event pairs, 30 based on Foata normal form. 5/829 useless extension candidates. Maximal degree in co-relation 2556. Up to 107 conditions per place. [2022-07-22 21:47:21,623 INFO L132 encePairwiseOnDemand]: 157/165 looper letters, 86 selfloop transitions, 79 changer transitions 1/290 dead transitions. [2022-07-22 21:47:21,623 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 290 transitions, 1903 flow [2022-07-22 21:47:21,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 21:47:21,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-22 21:47:21,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2004 transitions. [2022-07-22 21:47:21,628 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8675324675324675 [2022-07-22 21:47:21,629 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2004 transitions. [2022-07-22 21:47:21,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2004 transitions. [2022-07-22 21:47:21,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:47:21,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2004 transitions. [2022-07-22 21:47:21,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 143.14285714285714) internal successors, (2004), 14 states have internal predecessors, (2004), 0 states have call successors, (0), 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:47:21,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 165.0) internal successors, (2475), 15 states have internal predecessors, (2475), 0 states have call successors, (0), 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:47:21,640 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 165.0) internal successors, (2475), 15 states have internal predecessors, (2475), 0 states have call successors, (0), 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:47:21,640 INFO L186 Difference]: Start difference. First operand has 197 places, 206 transitions, 996 flow. Second operand 14 states and 2004 transitions. [2022-07-22 21:47:21,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 290 transitions, 1903 flow [2022-07-22 21:47:21,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 290 transitions, 1846 flow, removed 14 selfloop flow, removed 3 redundant places. [2022-07-22 21:47:21,654 INFO L242 Difference]: Finished difference. Result has 210 places, 241 transitions, 1511 flow [2022-07-22 21:47:21,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=963, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1511, PETRI_PLACES=210, PETRI_TRANSITIONS=241} [2022-07-22 21:47:21,656 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 62 predicate places. [2022-07-22 21:47:21,656 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 241 transitions, 1511 flow [2022-07-22 21:47:21,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 139.44444444444446) internal successors, (1255), 9 states have internal predecessors, (1255), 0 states have call successors, (0), 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:47:21,657 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:47:21,658 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] [2022-07-22 21:47:21,685 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:47:21,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-22 21:47:21,872 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:47:21,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:47:21,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1151714816, now seen corresponding path program 1 times [2022-07-22 21:47:21,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:47:21,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711243917] [2022-07-22 21:47:21,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:47:21,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:47:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:47:21,939 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:47:21,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:47:21,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711243917] [2022-07-22 21:47:21,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711243917] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:47:21,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58952] [2022-07-22 21:47:21,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:47:21,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:47:21,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:47:21,942 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:47:21,943 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:47:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:47:22,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 21:47:22,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:47:22,114 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:47:22,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:47:22,148 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:47:22,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58952] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:47:22,148 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:47:22,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-07-22 21:47:22,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382691351] [2022-07-22 21:47:22,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:47:22,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 21:47:22,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:47:22,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 21:47:22,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-07-22 21:47:22,152 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 165 [2022-07-22 21:47:22,153 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 241 transitions, 1511 flow. Second operand has 11 states, 11 states have (on average 139.8181818181818) internal successors, (1538), 11 states have internal predecessors, (1538), 0 states have call successors, (0), 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:47:22,153 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:47:22,153 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 165 [2022-07-22 21:47:22,154 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:47:22,471 INFO L129 PetriNetUnfolder]: 293/955 cut-off events. [2022-07-22 21:47:22,471 INFO L130 PetriNetUnfolder]: For 3179/3179 co-relation queries the response was YES. [2022-07-22 21:47:22,476 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3150 conditions, 955 events. 293/955 cut-off events. For 3179/3179 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5527 event pairs, 37 based on Foata normal form. 6/952 useless extension candidates. Maximal degree in co-relation 3119. Up to 128 conditions per place. [2022-07-22 21:47:22,482 INFO L132 encePairwiseOnDemand]: 157/165 looper letters, 101 selfloop transitions, 78 changer transitions 1/304 dead transitions. [2022-07-22 21:47:22,482 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 304 transitions, 2232 flow [2022-07-22 21:47:22,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 21:47:22,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-22 21:47:22,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1871 transitions. [2022-07-22 21:47:22,487 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8722610722610723 [2022-07-22 21:47:22,487 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1871 transitions. [2022-07-22 21:47:22,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1871 transitions. [2022-07-22 21:47:22,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:47:22,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1871 transitions. [2022-07-22 21:47:22,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 143.92307692307693) internal successors, (1871), 13 states have internal predecessors, (1871), 0 states have call successors, (0), 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:47:22,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 165.0) internal successors, (2310), 14 states have internal predecessors, (2310), 0 states have call successors, (0), 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:47:22,497 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 165.0) internal successors, (2310), 14 states have internal predecessors, (2310), 0 states have call successors, (0), 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:47:22,497 INFO L186 Difference]: Start difference. First operand has 210 places, 241 transitions, 1511 flow. Second operand 13 states and 1871 transitions. [2022-07-22 21:47:22,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 304 transitions, 2232 flow [2022-07-22 21:47:22,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 304 transitions, 2101 flow, removed 40 selfloop flow, removed 3 redundant places. [2022-07-22 21:47:22,517 INFO L242 Difference]: Finished difference. Result has 221 places, 253 transitions, 1701 flow [2022-07-22 21:47:22,518 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=1404, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1701, PETRI_PLACES=221, PETRI_TRANSITIONS=253} [2022-07-22 21:47:22,518 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 73 predicate places. [2022-07-22 21:47:22,518 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 253 transitions, 1701 flow [2022-07-22 21:47:22,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 139.8181818181818) internal successors, (1538), 11 states have internal predecessors, (1538), 0 states have call successors, (0), 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:47:22,520 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:47:22,520 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] [2022-07-22 21:47:22,544 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:47:22,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:47:22,739 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:47:22,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:47:22,740 INFO L85 PathProgramCache]: Analyzing trace with hash 409023878, now seen corresponding path program 3 times [2022-07-22 21:47:22,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:47:22,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073834700] [2022-07-22 21:47:22,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:47:22,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:47:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:47:22,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 21:47:22,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:47:22,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073834700] [2022-07-22 21:47:22,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073834700] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:47:22,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:47:22,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 21:47:22,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282216027] [2022-07-22 21:47:22,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:47:22,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 21:47:22,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:47:22,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 21:47:22,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 21:47:22,802 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 165 [2022-07-22 21:47:22,803 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 253 transitions, 1701 flow. Second operand has 5 states, 5 states have (on average 139.8) internal successors, (699), 5 states have internal predecessors, (699), 0 states have call successors, (0), 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:47:22,803 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:47:22,803 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 165 [2022-07-22 21:47:22,803 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:47:23,004 INFO L129 PetriNetUnfolder]: 287/916 cut-off events. [2022-07-22 21:47:23,004 INFO L130 PetriNetUnfolder]: For 3271/3273 co-relation queries the response was YES. [2022-07-22 21:47:23,009 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3078 conditions, 916 events. 287/916 cut-off events. For 3271/3273 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5148 event pairs, 98 based on Foata normal form. 3/905 useless extension candidates. Maximal degree in co-relation 3047. Up to 301 conditions per place. [2022-07-22 21:47:23,014 INFO L132 encePairwiseOnDemand]: 157/165 looper letters, 107 selfloop transitions, 34 changer transitions 7/272 dead transitions. [2022-07-22 21:47:23,014 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 272 transitions, 2132 flow [2022-07-22 21:47:23,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 21:47:23,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-07-22 21:47:23,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 868 transitions. [2022-07-22 21:47:23,017 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8767676767676768 [2022-07-22 21:47:23,017 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 868 transitions. [2022-07-22 21:47:23,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 868 transitions. [2022-07-22 21:47:23,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:47:23,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 868 transitions. [2022-07-22 21:47:23,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 144.66666666666666) internal successors, (868), 6 states have internal predecessors, (868), 0 states have call successors, (0), 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:47:23,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 165.0) internal successors, (1155), 7 states have internal predecessors, (1155), 0 states have call successors, (0), 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:47:23,022 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 165.0) internal successors, (1155), 7 states have internal predecessors, (1155), 0 states have call successors, (0), 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:47:23,022 INFO L186 Difference]: Start difference. First operand has 221 places, 253 transitions, 1701 flow. Second operand 6 states and 868 transitions. [2022-07-22 21:47:23,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 272 transitions, 2132 flow [2022-07-22 21:47:23,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 272 transitions, 2122 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-22 21:47:23,042 INFO L242 Difference]: Finished difference. Result has 227 places, 252 transitions, 1751 flow [2022-07-22 21:47:23,042 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=1691, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1751, PETRI_PLACES=227, PETRI_TRANSITIONS=252} [2022-07-22 21:47:23,043 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 79 predicate places. [2022-07-22 21:47:23,043 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 252 transitions, 1751 flow [2022-07-22 21:47:23,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 139.8) internal successors, (699), 5 states have internal predecessors, (699), 0 states have call successors, (0), 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:47:23,043 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:47:23,044 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] [2022-07-22 21:47:23,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 21:47:23,044 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:47:23,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:47:23,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1010386646, now seen corresponding path program 4 times [2022-07-22 21:47:23,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:47:23,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699864752] [2022-07-22 21:47:23,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:47:23,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:47:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:47:23,108 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:47:23,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:47:23,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699864752] [2022-07-22 21:47:23,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699864752] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:47:23,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736511616] [2022-07-22 21:47:23,109 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 21:47:23,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:47:23,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:47:23,111 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:47:23,112 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:47:23,212 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 21:47:23,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 21:47:23,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 21:47:23,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:47:23,264 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:47:23,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:47:23,294 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:47:23,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736511616] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:47:23,294 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:47:23,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-07-22 21:47:23,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803760048] [2022-07-22 21:47:23,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:47:23,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 21:47:23,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:47:23,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 21:47:23,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-07-22 21:47:23,298 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 165 [2022-07-22 21:47:23,299 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 252 transitions, 1751 flow. Second operand has 11 states, 11 states have (on average 139.63636363636363) internal successors, (1536), 11 states have internal predecessors, (1536), 0 states have call successors, (0), 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:47:23,299 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:47:23,299 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 165 [2022-07-22 21:47:23,299 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:47:23,583 INFO L129 PetriNetUnfolder]: 302/932 cut-off events. [2022-07-22 21:47:23,583 INFO L130 PetriNetUnfolder]: For 3575/3575 co-relation queries the response was YES. [2022-07-22 21:47:23,587 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3258 conditions, 932 events. 302/932 cut-off events. For 3575/3575 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5136 event pairs, 68 based on Foata normal form. 5/926 useless extension candidates. Maximal degree in co-relation 3224. Up to 139 conditions per place. [2022-07-22 21:47:23,593 INFO L132 encePairwiseOnDemand]: 157/165 looper letters, 97 selfloop transitions, 83 changer transitions 1/305 dead transitions. [2022-07-22 21:47:23,593 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 305 transitions, 2420 flow [2022-07-22 21:47:23,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 21:47:23,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-22 21:47:23,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1722 transitions. [2022-07-22 21:47:23,597 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8696969696969697 [2022-07-22 21:47:23,597 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1722 transitions. [2022-07-22 21:47:23,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1722 transitions. [2022-07-22 21:47:23,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:47:23,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1722 transitions. [2022-07-22 21:47:23,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 143.5) internal successors, (1722), 12 states have internal predecessors, (1722), 0 states have call successors, (0), 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:47:23,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 165.0) internal successors, (2145), 13 states have internal predecessors, (2145), 0 states have call successors, (0), 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:47:23,606 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 165.0) internal successors, (2145), 13 states have internal predecessors, (2145), 0 states have call successors, (0), 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:47:23,606 INFO L186 Difference]: Start difference. First operand has 227 places, 252 transitions, 1751 flow. Second operand 12 states and 1722 transitions. [2022-07-22 21:47:23,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 305 transitions, 2420 flow [2022-07-22 21:47:23,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 305 transitions, 2262 flow, removed 4 selfloop flow, removed 12 redundant places. [2022-07-22 21:47:23,626 INFO L242 Difference]: Finished difference. Result has 223 places, 265 transitions, 1892 flow [2022-07-22 21:47:23,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=1569, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1892, PETRI_PLACES=223, PETRI_TRANSITIONS=265} [2022-07-22 21:47:23,627 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 75 predicate places. [2022-07-22 21:47:23,627 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 265 transitions, 1892 flow [2022-07-22 21:47:23,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 139.63636363636363) internal successors, (1536), 11 states have internal predecessors, (1536), 0 states have call successors, (0), 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:47:23,627 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:47:23,628 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] [2022-07-22 21:47:23,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-22 21:47:23,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:47:23,853 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:47:23,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:47:23,853 INFO L85 PathProgramCache]: Analyzing trace with hash 486744020, now seen corresponding path program 1 times [2022-07-22 21:47:23,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:47:23,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495286157] [2022-07-22 21:47:23,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:47:23,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:47:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:47:24,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 21:47:24,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:47:24,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495286157] [2022-07-22 21:47:24,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495286157] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:47:24,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123953346] [2022-07-22 21:47:24,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:47:24,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:47:24,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:47:24,232 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:47:24,233 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:47:24,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:47:24,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-22 21:47:24,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:47:24,601 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 34 treesize of output 10 [2022-07-22 21:47:24,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 21:47:24,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:47:24,668 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 36 treesize of output 12 [2022-07-22 21:47:24,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 21:47:24,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123953346] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:47:24,870 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:47:24,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 29 [2022-07-22 21:47:24,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145289546] [2022-07-22 21:47:24,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:47:24,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-22 21:47:24,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:47:24,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-22 21:47:24,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2022-07-22 21:47:24,875 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 165 [2022-07-22 21:47:24,877 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 265 transitions, 1892 flow. Second operand has 29 states, 29 states have (on average 80.51724137931035) internal successors, (2335), 29 states have internal predecessors, (2335), 0 states have call successors, (0), 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:47:24,877 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:47:24,877 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 165 [2022-07-22 21:47:24,877 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:47:27,758 INFO L129 PetriNetUnfolder]: 1290/4628 cut-off events. [2022-07-22 21:47:27,758 INFO L130 PetriNetUnfolder]: For 13946/14256 co-relation queries the response was YES. [2022-07-22 21:47:27,783 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15068 conditions, 4628 events. 1290/4628 cut-off events. For 13946/14256 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 45491 event pairs, 99 based on Foata normal form. 98/4621 useless extension candidates. Maximal degree in co-relation 15041. Up to 774 conditions per place. [2022-07-22 21:47:27,800 INFO L132 encePairwiseOnDemand]: 132/165 looper letters, 133 selfloop transitions, 59 changer transitions 51/429 dead transitions. [2022-07-22 21:47:27,800 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 429 transitions, 2811 flow [2022-07-22 21:47:27,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-07-22 21:47:27,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2022-07-22 21:47:27,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 4970 transitions. [2022-07-22 21:47:27,808 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.4781144781144781 [2022-07-22 21:47:27,808 INFO L72 ComplementDD]: Start complementDD. Operand 63 states and 4970 transitions. [2022-07-22 21:47:27,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 4970 transitions. [2022-07-22 21:47:27,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:47:27,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 63 states and 4970 transitions. [2022-07-22 21:47:27,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 64 states, 63 states have (on average 78.88888888888889) internal successors, (4970), 63 states have internal predecessors, (4970), 0 states have call successors, (0), 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:47:27,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 64 states, 64 states have (on average 165.0) internal successors, (10560), 64 states have internal predecessors, (10560), 0 states have call successors, (0), 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:47:27,834 INFO L81 ComplementDD]: Finished complementDD. Result has 64 states, 64 states have (on average 165.0) internal successors, (10560), 64 states have internal predecessors, (10560), 0 states have call successors, (0), 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:47:27,834 INFO L186 Difference]: Start difference. First operand has 223 places, 265 transitions, 1892 flow. Second operand 63 states and 4970 transitions. [2022-07-22 21:47:27,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 429 transitions, 2811 flow [2022-07-22 21:47:27,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 429 transitions, 2679 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-07-22 21:47:27,909 INFO L242 Difference]: Finished difference. Result has 312 places, 309 transitions, 2153 flow [2022-07-22 21:47:27,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=1760, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=2153, PETRI_PLACES=312, PETRI_TRANSITIONS=309} [2022-07-22 21:47:27,912 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 164 predicate places. [2022-07-22 21:47:27,917 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 309 transitions, 2153 flow [2022-07-22 21:47:27,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 80.51724137931035) internal successors, (2335), 29 states have internal predecessors, (2335), 0 states have call successors, (0), 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:47:27,918 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:47:27,918 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:47:27,946 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:47:28,131 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,SelfDestructingSolverStorable13 [2022-07-22 21:47:28,131 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:47:28,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:47:28,132 INFO L85 PathProgramCache]: Analyzing trace with hash 440836057, now seen corresponding path program 2 times [2022-07-22 21:47:28,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:47:28,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963455143] [2022-07-22 21:47:28,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:47:28,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:47:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:47:28,568 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 21:47:28,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:47:28,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963455143] [2022-07-22 21:47:28,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963455143] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:47:28,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388941075] [2022-07-22 21:47:28,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 21:47:28,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:47:28,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:47:28,570 INFO L229 MonitoredProcess]: Starting monitored process 10 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:47:28,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-22 21:47:28,689 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 21:47:28,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 21:47:28,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-22 21:47:28,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:47:29,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-22 21:47:29,568 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:47:29,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 21:47:29,770 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-22 21:47:29,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 36 [2022-07-22 21:47:29,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-07-22 21:47:29,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-07-22 21:47:29,877 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 21:47:29,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:47:30,763 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:47:30,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 97 [2022-07-22 21:47:30,792 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:47:30,793 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 580 treesize of output 484 [2022-07-22 21:47:30,823 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:47:30,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 460 treesize of output 404 [2022-07-22 21:47:30,849 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:47:30,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 242 treesize of output 213 [2022-07-22 21:47:33,192 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 21:47:33,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388941075] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:47:33,193 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:47:33,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 21] total 52 [2022-07-22 21:47:33,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653413496] [2022-07-22 21:47:33,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:47:33,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-22 21:47:33,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:47:33,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-22 21:47:33,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=2367, Unknown=30, NotChecked=0, Total=2652 [2022-07-22 21:47:33,198 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 165 [2022-07-22 21:47:33,201 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 309 transitions, 2153 flow. Second operand has 52 states, 52 states have (on average 73.78846153846153) internal successors, (3837), 52 states have internal predecessors, (3837), 0 states have call successors, (0), 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:47:33,201 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:47:33,201 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 165 [2022-07-22 21:47:33,201 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:48:00,958 WARN L233 SmtUtils]: Spent 5.53s on a formula simplification. DAG size of input: 74 DAG size of output: 73 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 21:48:15,388 INFO L129 PetriNetUnfolder]: 1673/5869 cut-off events. [2022-07-22 21:48:15,389 INFO L130 PetriNetUnfolder]: For 21717/22252 co-relation queries the response was YES. [2022-07-22 21:48:15,431 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20809 conditions, 5869 events. 1673/5869 cut-off events. For 21717/22252 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 62353 event pairs, 99 based on Foata normal form. 136/5908 useless extension candidates. Maximal degree in co-relation 20752. Up to 1245 conditions per place. [2022-07-22 21:48:15,454 INFO L132 encePairwiseOnDemand]: 128/165 looper letters, 97 selfloop transitions, 75 changer transitions 18/375 dead transitions. [2022-07-22 21:48:15,454 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 375 transitions, 2888 flow [2022-07-22 21:48:15,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-22 21:48:15,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2022-07-22 21:48:15,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 3087 transitions. [2022-07-22 21:48:15,462 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.44545454545454544 [2022-07-22 21:48:15,462 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 3087 transitions. [2022-07-22 21:48:15,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 3087 transitions. [2022-07-22 21:48:15,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:48:15,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 3087 transitions. [2022-07-22 21:48:15,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 73.5) internal successors, (3087), 42 states have internal predecessors, (3087), 0 states have call successors, (0), 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:48:15,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 165.0) internal successors, (7095), 43 states have internal predecessors, (7095), 0 states have call successors, (0), 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:48:15,480 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 165.0) internal successors, (7095), 43 states have internal predecessors, (7095), 0 states have call successors, (0), 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:48:15,480 INFO L186 Difference]: Start difference. First operand has 312 places, 309 transitions, 2153 flow. Second operand 42 states and 3087 transitions. [2022-07-22 21:48:15,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 375 transitions, 2888 flow [2022-07-22 21:48:15,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 375 transitions, 2746 flow, removed 57 selfloop flow, removed 23 redundant places. [2022-07-22 21:48:15,611 INFO L242 Difference]: Finished difference. Result has 327 places, 340 transitions, 2487 flow [2022-07-22 21:48:15,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=2061, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=2487, PETRI_PLACES=327, PETRI_TRANSITIONS=340} [2022-07-22 21:48:15,612 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 179 predicate places. [2022-07-22 21:48:15,612 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 340 transitions, 2487 flow [2022-07-22 21:48:15,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 73.78846153846153) internal successors, (3837), 52 states have internal predecessors, (3837), 0 states have call successors, (0), 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:48:15,613 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:48:15,614 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:48:15,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-22 21:48:15,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-22 21:48:15,817 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:48:15,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:48:15,817 INFO L85 PathProgramCache]: Analyzing trace with hash -184643575, now seen corresponding path program 3 times [2022-07-22 21:48:15,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:48:15,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141665371] [2022-07-22 21:48:15,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:48:15,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:48:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:48:17,875 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 21:48:17,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:48:17,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141665371] [2022-07-22 21:48:17,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141665371] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:48:17,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92148729] [2022-07-22 21:48:17,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 21:48:17,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:48:17,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:48:17,877 INFO L229 MonitoredProcess]: Starting monitored process 11 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:48:17,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-22 21:48:17,992 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-22 21:48:17,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 21:48:17,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-22 21:48:17,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:48:21,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 21:48:21,489 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-22 21:48:21,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 46 [2022-07-22 21:48:21,505 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 29 treesize of output 21 [2022-07-22 21:48:21,935 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-07-22 21:48:21,935 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 23 treesize of output 10 [2022-07-22 21:48:22,083 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 21:48:22,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:48:23,008 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:48:23,011 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 92 [2022-07-22 21:48:23,038 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 13 treesize of output 7 [2022-07-22 21:48:28,114 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 21:48:28,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92148729] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:48:28,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:48:28,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 45 [2022-07-22 21:48:28,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701093801] [2022-07-22 21:48:28,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:48:28,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-22 21:48:28,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:48:28,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-22 21:48:28,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1799, Unknown=25, NotChecked=0, Total=1980 [2022-07-22 21:48:28,119 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 165 [2022-07-22 21:48:28,121 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 340 transitions, 2487 flow. Second operand has 45 states, 45 states have (on average 75.44444444444444) internal successors, (3395), 45 states have internal predecessors, (3395), 0 states have call successors, (0), 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:48:28,121 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:48:28,121 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 165 [2022-07-22 21:48:28,121 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:48:38,166 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([589] L61-->L66: Formula: (let ((.cse2 (not |v_thread2_#t~short11#1_66|)) (.cse1 (select (select |v_#memory_int_97| v_~f_inv~0.base_62) (+ v_~f_inv~0.offset_62 (* v_~counter~0_134 4))))) (and (or (and (let ((.cse0 (< |v_thread2_#t~mem10#1_52| v_~n~0_32))) (or (and (not .cse0) (not |v_thread2_#t~short11#1_65|)) (and .cse0 |v_thread2_#t~short11#1_65|))) (= |v_thread2_#t~mem10#1_52| .cse1) |v_thread2_#t~short11#1_66|) (and (= |v_thread2_#t~short11#1_66| |v_thread2_#t~short11#1_65|) .cse2 (= |v_thread2Thread1of1ForFork1_#t~mem10#1_1| |v_thread2_#t~mem10#1_52|))) (= (ite (= v_~counter~0_134 (select (select |v_#memory_int_97| v_~f~0.base_58) (+ v_~f~0.offset_58 (* .cse1 4)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= v_~counter~0_133 .cse1) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (let ((.cse3 (<= 0 .cse1))) (or (and |v_thread2_#t~short11#1_66| .cse3) (and .cse2 (not .cse3)))) (not (= (ite |v_thread2_#t~short11#1_65| 1 0) 0)) (not (= (ite (and (<= 0 v_~counter~0_134) (< v_~counter~0_134 v_~n_inv~0_22)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_134, ~f_inv~0.offset=v_~f_inv~0.offset_62, ~f~0.base=v_~f~0.base_58, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_1|, #memory_int=|v_#memory_int_97|, ~f_inv~0.base=v_~f_inv~0.base_62, ~n~0=v_~n~0_32, ~f~0.offset=v_~f~0.offset_58, ~n_inv~0=v_~n_inv~0_22} OutVars{~counter~0=v_~counter~0_133, thread2Thread1of1ForFork1_#t~mem13#1=|v_thread2Thread1of1ForFork1_#t~mem13#1_1|, ~f_inv~0.offset=v_~f_inv~0.offset_62, thread2Thread1of1ForFork1_#t~short11#1=|v_thread2Thread1of1ForFork1_#t~short11#1_1|, ~f~0.base=v_~f~0.base_58, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~f_inv~0.base=v_~f_inv~0.base_62, ~f~0.offset=v_~f~0.offset_58, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_1|, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_1|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_1|, #memory_int=|v_#memory_int_97|, ~n~0=v_~n~0_32, ~n_inv~0=v_~n_inv~0_22} AuxVars[|v_thread2_#t~short11#1_65|, |v_thread2_#t~short11#1_66|, |v_thread2_#t~mem10#1_52|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~mem13#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~short11#1, thread2Thread1of1ForFork1_#t~mem14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1][259], [Black: 2555#(and (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 ~counter~0) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 3407#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 2563#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 1354#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), 90#L53true, 3390#(and (<= 1 ~N~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)), Black: 6095#(and (or (and (not (= ~f_inv~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))) (not (= ~counter~0 0))) (= ~f_inv~0.offset 0) (or (<= ~n_inv~0 1) (<= ~counter~0 0))), Black: 6644#(or (not (< ~counter~0 ~n_inv~0)) (not (<= 0 ~counter~0)) (forall ((v_ArrVal_360 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_360) ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)) 0))), Black: 6021#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 1)), Black: 5965#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 7066#(and (<= ~n_inv~0 1) (= ~f_inv~0.offset 0) (or (not (= ~f_inv~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~counter~0 0))) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))), Black: 7064#(and (exists ((~f~0.offset Int) (~f~0.base Int)) (and (= ~counter~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= (select (select |#memory_int| ~f_inv~0.base) (+ ~f_inv~0.offset (* (select (select |#memory_int| ~f~0.base) ~f~0.offset) 4))) 0))) (< (+ ~f_inv~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n_inv~0 1) (= ~f_inv~0.offset 0)), Black: 6622#(or (not (< ~counter~0 ~n_inv~0)) (not (<= 0 ~counter~0)) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))), Black: 5981#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 7058#(and (forall ((v_ArrVal_359 (Array Int Int)) (v_ArrVal_360 (Array Int Int)) (~f~0.offset Int) (~f~0.base Int)) (or (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_360) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset))) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 0) (not (= ~counter~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset))) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (<= 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)))) (not (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) ~n_inv~0)))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (forall ((v_ArrVal_359 (Array Int Int)) (v_ArrVal_360 (Array Int Int)) (~f~0.offset Int) (~f~0.base Int)) (or (not (= ~counter~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f_inv~0.base) (+ (* 4 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset))) ~f_inv~0.offset)))) (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_360) ~f_inv~0.base) (+ (* 4 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset))) ~f_inv~0.offset)) 0) (not (<= 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)))) (not (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) ~n_inv~0)))) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 6007#(and (<= ~n_inv~0 1) (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_main_#t~ret19#1.offset| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5975#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post27#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6666#(forall ((~f~0.offset Int) (~f~0.base Int)) (or (not (= ~counter~0 (select (select |#memory_int| ~f_inv~0.base) (+ ~f_inv~0.offset (* (select (select |#memory_int| ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) 4))))) (not (<= 0 (select (select |#memory_int| ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)))) (forall ((v_ArrVal_360 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_360) ~f_inv~0.base) (+ ~f_inv~0.offset (* (select (select |#memory_int| ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) 4))) 0)) (not (< (select (select |#memory_int| ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) ~n_inv~0)))), Black: 7060#(and (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((~f~0.offset Int) (~f~0.base Int)) (and (= ~counter~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= (select (select |#memory_int| ~f_inv~0.base) (+ ~f_inv~0.offset (* (select (select |#memory_int| ~f~0.base) ~f~0.offset) 4))) 0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~f_inv~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n_inv~0 1) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~f_inv~0.offset 0) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5979#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (<= ~n~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6097#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 6027#(and (= ~f_inv~0.offset 0) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset))) (= ~counter~0 0)), Black: 7062#(and (<= ~n_inv~0 1) (= ~f_inv~0.offset 0) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))), Black: 7068#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 5999#(and (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6081#(= ~counter~0 0), Black: 6009#(and (<= ~n_inv~0 1) (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~f_inv~0.offset 0) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_main_#t~ret19#1.offset| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 6019#(and (<= ~n_inv~0 1) (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~f_inv~0.offset 0) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset))) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5939#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post27#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), Black: 552#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 ~counter~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 5993#(and (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post27#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 167#(= ~counter~0 0), Black: 6005#(and (<= ~n_inv~0 1) (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5935#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 6001#(and (<= ~n_inv~0 1) (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6011#(and (<= ~n_inv~0 1) (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~f_inv~0.offset 0) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5080#(and (or (<= ~n_inv~0 1) (<= ~counter~0 0)) (or (and (= ~f_inv~0.offset 0) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))) (not (= ~counter~0 0)))), Black: 5933#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0)), Black: 5941#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), Black: 6025#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0) (<= ~n~0 1)), 4702#(< |thread1Thread1of1ForFork0_~i~0#1| ~N~0), 1809#(< |thread2Thread1of1ForFork1_~i~1#1| ~N~0), Black: 2574#(<= 1 ~N~0), Black: 4245#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 ~N~0)), Black: 575#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1348#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)), 51#L66true, Black: 576#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)), Black: 1352#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)), Black: 1350#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0)), 75#L83-4true, 5065#true, 6079#true, 162#true, Black: 1382#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 3855#(< |thread2Thread1of1ForFork1_~i~1#1| ~N~0), 7082#true]) [2022-07-22 21:48:38,167 INFO L384 tUnfolder$Statistics]: this new event has 135 ancestors and is cut-off event [2022-07-22 21:48:38,167 INFO L387 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-07-22 21:48:38,168 INFO L387 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-07-22 21:48:38,168 INFO L387 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-07-22 21:48:38,181 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([582] L47-2-->L47-3: Formula: (= (+ |v_thread1Thread1of1ForFork0_#t~post1#1_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_9|) InVars {thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_3|} OutVars{thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_3|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1][337], [Black: 2555#(and (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 ~counter~0) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 3407#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 2563#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 3402#true, Black: 6095#(and (or (and (not (= ~f_inv~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))) (not (= ~counter~0 0))) (= ~f_inv~0.offset 0) (or (<= ~n_inv~0 1) (<= ~counter~0 0))), Black: 6021#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 1)), Black: 6644#(or (not (< ~counter~0 ~n_inv~0)) (not (<= 0 ~counter~0)) (forall ((v_ArrVal_360 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_360) ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)) 0))), Black: 5965#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 7066#(and (<= ~n_inv~0 1) (= ~f_inv~0.offset 0) (or (not (= ~f_inv~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~counter~0 0))) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))), Black: 7064#(and (exists ((~f~0.offset Int) (~f~0.base Int)) (and (= ~counter~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= (select (select |#memory_int| ~f_inv~0.base) (+ ~f_inv~0.offset (* (select (select |#memory_int| ~f~0.base) ~f~0.offset) 4))) 0))) (< (+ ~f_inv~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n_inv~0 1) (= ~f_inv~0.offset 0)), Black: 5981#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6622#(or (not (< ~counter~0 ~n_inv~0)) (not (<= 0 ~counter~0)) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))), Black: 7058#(and (forall ((v_ArrVal_359 (Array Int Int)) (v_ArrVal_360 (Array Int Int)) (~f~0.offset Int) (~f~0.base Int)) (or (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_360) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset))) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 0) (not (= ~counter~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset))) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (<= 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)))) (not (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) ~n_inv~0)))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (forall ((v_ArrVal_359 (Array Int Int)) (v_ArrVal_360 (Array Int Int)) (~f~0.offset Int) (~f~0.base Int)) (or (not (= ~counter~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f_inv~0.base) (+ (* 4 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset))) ~f_inv~0.offset)))) (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_360) ~f_inv~0.base) (+ (* 4 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset))) ~f_inv~0.offset)) 0) (not (<= 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)))) (not (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) ~n_inv~0)))) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 6007#(and (<= ~n_inv~0 1) (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_main_#t~ret19#1.offset| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5975#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post27#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6666#(forall ((~f~0.offset Int) (~f~0.base Int)) (or (not (= ~counter~0 (select (select |#memory_int| ~f_inv~0.base) (+ ~f_inv~0.offset (* (select (select |#memory_int| ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) 4))))) (not (<= 0 (select (select |#memory_int| ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)))) (forall ((v_ArrVal_360 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_360) ~f_inv~0.base) (+ ~f_inv~0.offset (* (select (select |#memory_int| ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) 4))) 0)) (not (< (select (select |#memory_int| ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) ~n_inv~0)))), Black: 5979#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (<= ~n~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 577#(<= 1 ~N~0), Black: 7060#(and (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((~f~0.offset Int) (~f~0.base Int)) (and (= ~counter~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= (select (select |#memory_int| ~f_inv~0.base) (+ ~f_inv~0.offset (* (select (select |#memory_int| ~f~0.base) ~f~0.offset) 4))) 0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~f_inv~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n_inv~0 1) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~f_inv~0.offset 0) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 6097#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 7062#(and (<= ~n_inv~0 1) (= ~f_inv~0.offset 0) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))), Black: 6027#(and (= ~f_inv~0.offset 0) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset))) (= ~counter~0 0)), Black: 5999#(and (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 7068#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 6081#(= ~counter~0 0), Black: 6009#(and (<= ~n_inv~0 1) (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~f_inv~0.offset 0) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_main_#t~ret19#1.offset| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 6019#(and (<= ~n_inv~0 1) (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~f_inv~0.offset 0) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset))) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5939#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post27#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), Black: 552#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 ~counter~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 5993#(and (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post27#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 57#L60-5true, Black: 6005#(and (<= ~n_inv~0 1) (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 167#(= ~counter~0 0), Black: 5935#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 6001#(and (<= ~n_inv~0 1) (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6011#(and (<= ~n_inv~0 1) (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~f_inv~0.offset 0) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5080#(and (or (<= ~n_inv~0 1) (<= ~counter~0 0)) (or (and (= ~f_inv~0.offset 0) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))) (not (= ~counter~0 0)))), Black: 5933#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0)), Black: 5941#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), Black: 6025#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0) (<= ~n~0 1)), 1377#true, Black: 2574#(<= 1 ~N~0), Black: 4245#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 ~N~0)), Black: 575#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1348#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)), Black: 576#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)), Black: 1352#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)), Black: 1350#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0)), 3392#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork1_~i~1#1|)), 75#L83-4true, 5065#true, 6079#true, 162#true, 4240#true, Black: 1382#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 7082#true, 93#L47-3true]) [2022-07-22 21:48:38,182 INFO L384 tUnfolder$Statistics]: this new event has 136 ancestors and is cut-off event [2022-07-22 21:48:38,182 INFO L387 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-07-22 21:48:38,182 INFO L387 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-07-22 21:48:38,182 INFO L387 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-07-22 21:48:38,296 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([589] L61-->L66: Formula: (let ((.cse2 (not |v_thread2_#t~short11#1_66|)) (.cse1 (select (select |v_#memory_int_97| v_~f_inv~0.base_62) (+ v_~f_inv~0.offset_62 (* v_~counter~0_134 4))))) (and (or (and (let ((.cse0 (< |v_thread2_#t~mem10#1_52| v_~n~0_32))) (or (and (not .cse0) (not |v_thread2_#t~short11#1_65|)) (and .cse0 |v_thread2_#t~short11#1_65|))) (= |v_thread2_#t~mem10#1_52| .cse1) |v_thread2_#t~short11#1_66|) (and (= |v_thread2_#t~short11#1_66| |v_thread2_#t~short11#1_65|) .cse2 (= |v_thread2Thread1of1ForFork1_#t~mem10#1_1| |v_thread2_#t~mem10#1_52|))) (= (ite (= v_~counter~0_134 (select (select |v_#memory_int_97| v_~f~0.base_58) (+ v_~f~0.offset_58 (* .cse1 4)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= v_~counter~0_133 .cse1) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (let ((.cse3 (<= 0 .cse1))) (or (and |v_thread2_#t~short11#1_66| .cse3) (and .cse2 (not .cse3)))) (not (= (ite |v_thread2_#t~short11#1_65| 1 0) 0)) (not (= (ite (and (<= 0 v_~counter~0_134) (< v_~counter~0_134 v_~n_inv~0_22)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_134, ~f_inv~0.offset=v_~f_inv~0.offset_62, ~f~0.base=v_~f~0.base_58, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_1|, #memory_int=|v_#memory_int_97|, ~f_inv~0.base=v_~f_inv~0.base_62, ~n~0=v_~n~0_32, ~f~0.offset=v_~f~0.offset_58, ~n_inv~0=v_~n_inv~0_22} OutVars{~counter~0=v_~counter~0_133, thread2Thread1of1ForFork1_#t~mem13#1=|v_thread2Thread1of1ForFork1_#t~mem13#1_1|, ~f_inv~0.offset=v_~f_inv~0.offset_62, thread2Thread1of1ForFork1_#t~short11#1=|v_thread2Thread1of1ForFork1_#t~short11#1_1|, ~f~0.base=v_~f~0.base_58, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~f_inv~0.base=v_~f_inv~0.base_62, ~f~0.offset=v_~f~0.offset_58, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_1|, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_1|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_1|, #memory_int=|v_#memory_int_97|, ~n~0=v_~n~0_32, ~n_inv~0=v_~n_inv~0_22} AuxVars[|v_thread2_#t~short11#1_65|, |v_thread2_#t~short11#1_66|, |v_thread2_#t~mem10#1_52|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~mem13#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~short11#1, thread2Thread1of1ForFork1_#t~mem14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1][259], [Black: 2555#(and (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 ~counter~0) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 3407#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 2563#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 1354#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), 90#L53true, 3390#(and (<= 1 ~N~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)), Black: 6095#(and (or (and (not (= ~f_inv~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))) (not (= ~counter~0 0))) (= ~f_inv~0.offset 0) (or (<= ~n_inv~0 1) (<= ~counter~0 0))), Black: 6021#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 1)), Black: 6644#(or (not (< ~counter~0 ~n_inv~0)) (not (<= 0 ~counter~0)) (forall ((v_ArrVal_360 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_360) ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)) 0))), Black: 5965#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 7066#(and (<= ~n_inv~0 1) (= ~f_inv~0.offset 0) (or (not (= ~f_inv~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~counter~0 0))) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))), Black: 7064#(and (exists ((~f~0.offset Int) (~f~0.base Int)) (and (= ~counter~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= (select (select |#memory_int| ~f_inv~0.base) (+ ~f_inv~0.offset (* (select (select |#memory_int| ~f~0.base) ~f~0.offset) 4))) 0))) (< (+ ~f_inv~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n_inv~0 1) (= ~f_inv~0.offset 0)), Black: 6622#(or (not (< ~counter~0 ~n_inv~0)) (not (<= 0 ~counter~0)) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))), Black: 5981#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 7058#(and (forall ((v_ArrVal_359 (Array Int Int)) (v_ArrVal_360 (Array Int Int)) (~f~0.offset Int) (~f~0.base Int)) (or (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_360) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset))) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 0) (not (= ~counter~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset))) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (<= 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)))) (not (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) ~n_inv~0)))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (forall ((v_ArrVal_359 (Array Int Int)) (v_ArrVal_360 (Array Int Int)) (~f~0.offset Int) (~f~0.base Int)) (or (not (= ~counter~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f_inv~0.base) (+ (* 4 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset))) ~f_inv~0.offset)))) (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_360) ~f_inv~0.base) (+ (* 4 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset))) ~f_inv~0.offset)) 0) (not (<= 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)))) (not (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) ~n_inv~0)))) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 6007#(and (<= ~n_inv~0 1) (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_main_#t~ret19#1.offset| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5975#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post27#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6666#(forall ((~f~0.offset Int) (~f~0.base Int)) (or (not (= ~counter~0 (select (select |#memory_int| ~f_inv~0.base) (+ ~f_inv~0.offset (* (select (select |#memory_int| ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) 4))))) (not (<= 0 (select (select |#memory_int| ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)))) (forall ((v_ArrVal_360 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_360) ~f_inv~0.base) (+ ~f_inv~0.offset (* (select (select |#memory_int| ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) 4))) 0)) (not (< (select (select |#memory_int| ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) ~n_inv~0)))), Black: 7060#(and (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((~f~0.offset Int) (~f~0.base Int)) (and (= ~counter~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= (select (select |#memory_int| ~f_inv~0.base) (+ ~f_inv~0.offset (* (select (select |#memory_int| ~f~0.base) ~f~0.offset) 4))) 0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~f_inv~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n_inv~0 1) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~f_inv~0.offset 0) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5979#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (<= ~n~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6097#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 7062#(and (<= ~n_inv~0 1) (= ~f_inv~0.offset 0) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))), Black: 6027#(and (= ~f_inv~0.offset 0) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset))) (= ~counter~0 0)), Black: 7068#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 5999#(and (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6081#(= ~counter~0 0), 148#L84-1true, Black: 6009#(and (<= ~n_inv~0 1) (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~f_inv~0.offset 0) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_main_#t~ret19#1.offset| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 6019#(and (<= ~n_inv~0 1) (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~f_inv~0.offset 0) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset))) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5939#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post27#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), Black: 552#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 ~counter~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 5993#(and (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post27#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 167#(= ~counter~0 0), Black: 6005#(and (<= ~n_inv~0 1) (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5935#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 6001#(and (<= ~n_inv~0 1) (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6011#(and (<= ~n_inv~0 1) (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~f_inv~0.offset 0) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5080#(and (or (<= ~n_inv~0 1) (<= ~counter~0 0)) (or (and (= ~f_inv~0.offset 0) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))) (not (= ~counter~0 0)))), Black: 5933#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0)), Black: 5941#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), Black: 6025#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0) (<= ~n~0 1)), 4702#(< |thread1Thread1of1ForFork0_~i~0#1| ~N~0), 1809#(< |thread2Thread1of1ForFork1_~i~1#1| ~N~0), Black: 2574#(<= 1 ~N~0), Black: 4245#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 ~N~0)), Black: 575#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1348#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)), 51#L66true, Black: 576#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)), Black: 1352#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)), Black: 1350#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0)), 5065#true, 6079#true, 162#true, Black: 1382#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 3855#(< |thread2Thread1of1ForFork1_~i~1#1| ~N~0), 7082#true]) [2022-07-22 21:48:38,297 INFO L384 tUnfolder$Statistics]: this new event has 138 ancestors and is cut-off event [2022-07-22 21:48:38,297 INFO L387 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-07-22 21:48:38,297 INFO L387 tUnfolder$Statistics]: existing Event has 133 ancestors and is cut-off event [2022-07-22 21:48:38,297 INFO L387 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-07-22 21:48:39,008 INFO L129 PetriNetUnfolder]: 1499/5546 cut-off events. [2022-07-22 21:48:39,009 INFO L130 PetriNetUnfolder]: For 24300/25120 co-relation queries the response was YES. [2022-07-22 21:48:39,036 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21359 conditions, 5546 events. 1499/5546 cut-off events. For 24300/25120 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 58155 event pairs, 192 based on Foata normal form. 119/5538 useless extension candidates. Maximal degree in co-relation 21304. Up to 1428 conditions per place. [2022-07-22 21:48:39,056 INFO L132 encePairwiseOnDemand]: 135/165 looper letters, 113 selfloop transitions, 68 changer transitions 10/376 dead transitions. [2022-07-22 21:48:39,056 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 376 transitions, 3153 flow [2022-07-22 21:48:39,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-22 21:48:39,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-07-22 21:48:39,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2279 transitions. [2022-07-22 21:48:39,062 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.4604040404040404 [2022-07-22 21:48:39,062 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 2279 transitions. [2022-07-22 21:48:39,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 2279 transitions. [2022-07-22 21:48:39,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:48:39,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 2279 transitions. [2022-07-22 21:48:39,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 75.96666666666667) internal successors, (2279), 30 states have internal predecessors, (2279), 0 states have call successors, (0), 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:48:39,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 165.0) internal successors, (5115), 31 states have internal predecessors, (5115), 0 states have call successors, (0), 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:48:39,075 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 165.0) internal successors, (5115), 31 states have internal predecessors, (5115), 0 states have call successors, (0), 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:48:39,076 INFO L186 Difference]: Start difference. First operand has 327 places, 340 transitions, 2487 flow. Second operand 30 states and 2279 transitions. [2022-07-22 21:48:39,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 376 transitions, 3153 flow [2022-07-22 21:48:39,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 376 transitions, 2993 flow, removed 34 selfloop flow, removed 32 redundant places. [2022-07-22 21:48:39,183 INFO L242 Difference]: Finished difference. Result has 327 places, 354 transitions, 2675 flow [2022-07-22 21:48:39,183 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=2354, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2675, PETRI_PLACES=327, PETRI_TRANSITIONS=354} [2022-07-22 21:48:39,184 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 179 predicate places. [2022-07-22 21:48:39,184 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 354 transitions, 2675 flow [2022-07-22 21:48:39,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 75.44444444444444) internal successors, (3395), 45 states have internal predecessors, (3395), 0 states have call successors, (0), 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:48:39,185 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:48:39,186 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:48:39,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-22 21:48:39,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-22 21:48:39,410 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:48:39,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:48:39,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1251940155, now seen corresponding path program 4 times [2022-07-22 21:48:39,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:48:39,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340957349] [2022-07-22 21:48:39,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:48:39,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:48:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:48:41,419 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 21:48:41,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:48:41,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340957349] [2022-07-22 21:48:41,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340957349] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:48:41,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752513381] [2022-07-22 21:48:41,419 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 21:48:41,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:48:41,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:48:41,421 INFO L229 MonitoredProcess]: Starting monitored process 12 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:48:41,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-22 21:48:41,580 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 21:48:41,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 21:48:41,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-22 21:48:41,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:48:44,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-22 21:48:46,153 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:48:47,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 21:48:47,093 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-22 21:48:47,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 46 [2022-07-22 21:48:47,122 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 29 treesize of output 21 [2022-07-22 21:48:47,980 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-07-22 21:48:47,981 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 23 treesize of output 10 [2022-07-22 21:48:48,090 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 21:48:48,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:48:51,821 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:48:51,821 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 134 treesize of output 86 [2022-07-22 21:48:52,001 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:48:52,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 234 treesize of output 291 [2022-07-22 21:48:52,181 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:48:52,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 227 treesize of output 263 [2022-07-22 21:48:52,205 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 60 treesize of output 42 [2022-07-22 21:49:02,504 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 21:49:02,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752513381] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:49:02,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:49:02,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 21] total 52 [2022-07-22 21:49:02,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293400696] [2022-07-22 21:49:02,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:49:02,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-22 21:49:02,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:49:02,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-22 21:49:02,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=2394, Unknown=44, NotChecked=0, Total=2652 [2022-07-22 21:49:02,508 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 165 [2022-07-22 21:49:02,510 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 354 transitions, 2675 flow. Second operand has 52 states, 52 states have (on average 73.86538461538461) internal successors, (3841), 52 states have internal predecessors, (3841), 0 states have call successors, (0), 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:49:02,510 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:49:02,510 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 165 [2022-07-22 21:49:02,510 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:49:13,281 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (<= c_~n_inv~0 1)) (.cse2 (= c_~counter~0 0)) (.cse3 (<= c_~n_inv~0 0))) (let ((.cse0 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse4 (and .cse1 (or (and (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse2) .cse3)))) (and (or (forall ((v_ArrVal_437 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_437) c_~f_inv~0.base) (+ (* c_~counter~0 4) c_~f_inv~0.offset)) 0)) (not (< c_~counter~0 c_~n_inv~0)) (not (<= 0 c_~counter~0))) (or .cse0 (and .cse1 (or (and .cse2 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) .cse3))) (or .cse4 .cse0) (or .cse4 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|))))) is different from false [2022-07-22 21:49:14,037 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([589] L61-->L66: Formula: (let ((.cse2 (not |v_thread2_#t~short11#1_66|)) (.cse1 (select (select |v_#memory_int_97| v_~f_inv~0.base_62) (+ v_~f_inv~0.offset_62 (* v_~counter~0_134 4))))) (and (or (and (let ((.cse0 (< |v_thread2_#t~mem10#1_52| v_~n~0_32))) (or (and (not .cse0) (not |v_thread2_#t~short11#1_65|)) (and .cse0 |v_thread2_#t~short11#1_65|))) (= |v_thread2_#t~mem10#1_52| .cse1) |v_thread2_#t~short11#1_66|) (and (= |v_thread2_#t~short11#1_66| |v_thread2_#t~short11#1_65|) .cse2 (= |v_thread2Thread1of1ForFork1_#t~mem10#1_1| |v_thread2_#t~mem10#1_52|))) (= (ite (= v_~counter~0_134 (select (select |v_#memory_int_97| v_~f~0.base_58) (+ v_~f~0.offset_58 (* .cse1 4)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= v_~counter~0_133 .cse1) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (let ((.cse3 (<= 0 .cse1))) (or (and |v_thread2_#t~short11#1_66| .cse3) (and .cse2 (not .cse3)))) (not (= (ite |v_thread2_#t~short11#1_65| 1 0) 0)) (not (= (ite (and (<= 0 v_~counter~0_134) (< v_~counter~0_134 v_~n_inv~0_22)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_134, ~f_inv~0.offset=v_~f_inv~0.offset_62, ~f~0.base=v_~f~0.base_58, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_1|, #memory_int=|v_#memory_int_97|, ~f_inv~0.base=v_~f_inv~0.base_62, ~n~0=v_~n~0_32, ~f~0.offset=v_~f~0.offset_58, ~n_inv~0=v_~n_inv~0_22} OutVars{~counter~0=v_~counter~0_133, thread2Thread1of1ForFork1_#t~mem13#1=|v_thread2Thread1of1ForFork1_#t~mem13#1_1|, ~f_inv~0.offset=v_~f_inv~0.offset_62, thread2Thread1of1ForFork1_#t~short11#1=|v_thread2Thread1of1ForFork1_#t~short11#1_1|, ~f~0.base=v_~f~0.base_58, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~f_inv~0.base=v_~f_inv~0.base_62, ~f~0.offset=v_~f~0.offset_58, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_1|, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_1|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_1|, #memory_int=|v_#memory_int_97|, ~n~0=v_~n~0_32, ~n_inv~0=v_~n_inv~0_22} AuxVars[|v_thread2_#t~short11#1_65|, |v_thread2_#t~short11#1_66|, |v_thread2_#t~mem10#1_52|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~mem13#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~short11#1, thread2Thread1of1ForFork1_#t~mem14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1][270], [Black: 2555#(and (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 ~counter~0) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 3407#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 2563#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 1354#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), 90#L53true, 3390#(and (<= 1 ~N~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)), Black: 6095#(and (or (and (not (= ~f_inv~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))) (not (= ~counter~0 0))) (= ~f_inv~0.offset 0) (or (<= ~n_inv~0 1) (<= ~counter~0 0))), Black: 6644#(or (not (< ~counter~0 ~n_inv~0)) (not (<= 0 ~counter~0)) (forall ((v_ArrVal_360 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_360) ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)) 0))), Black: 6021#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 1)), Black: 5965#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 7064#(and (exists ((~f~0.offset Int) (~f~0.base Int)) (and (= ~counter~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= (select (select |#memory_int| ~f_inv~0.base) (+ ~f_inv~0.offset (* (select (select |#memory_int| ~f~0.base) ~f~0.offset) 4))) 0))) (< (+ ~f_inv~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n_inv~0 1) (= ~f_inv~0.offset 0)), Black: 6622#(or (not (< ~counter~0 ~n_inv~0)) (not (<= 0 ~counter~0)) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))), Black: 5981#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 7058#(and (forall ((v_ArrVal_359 (Array Int Int)) (v_ArrVal_360 (Array Int Int)) (~f~0.offset Int) (~f~0.base Int)) (or (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_360) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset))) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 0) (not (= ~counter~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset))) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (<= 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)))) (not (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) ~n_inv~0)))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (forall ((v_ArrVal_359 (Array Int Int)) (v_ArrVal_360 (Array Int Int)) (~f~0.offset Int) (~f~0.base Int)) (or (not (= ~counter~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f_inv~0.base) (+ (* 4 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset))) ~f_inv~0.offset)))) (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_360) ~f_inv~0.base) (+ (* 4 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset))) ~f_inv~0.offset)) 0) (not (<= 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)))) (not (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) ~n_inv~0)))) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 5975#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post27#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6666#(forall ((~f~0.offset Int) (~f~0.base Int)) (or (not (= ~counter~0 (select (select |#memory_int| ~f_inv~0.base) (+ ~f_inv~0.offset (* (select (select |#memory_int| ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) 4))))) (not (<= 0 (select (select |#memory_int| ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)))) (forall ((v_ArrVal_360 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_360) ~f_inv~0.base) (+ ~f_inv~0.offset (* (select (select |#memory_int| ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) 4))) 0)) (not (< (select (select |#memory_int| ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) ~n_inv~0)))), Black: 7060#(and (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((~f~0.offset Int) (~f~0.base Int)) (and (= ~counter~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= (select (select |#memory_int| ~f_inv~0.base) (+ ~f_inv~0.offset (* (select (select |#memory_int| ~f~0.base) ~f~0.offset) 4))) 0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~f_inv~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n_inv~0 1) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~f_inv~0.offset 0) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5979#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (<= ~n~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6027#(and (= ~f_inv~0.offset 0) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset))) (= ~counter~0 0)), Black: 7062#(and (<= ~n_inv~0 1) (= ~f_inv~0.offset 0) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))), Black: 5999#(and (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6081#(= ~counter~0 0), Black: 6019#(and (<= ~n_inv~0 1) (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~f_inv~0.offset 0) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset))) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5939#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post27#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), Black: 552#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 ~counter~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 5993#(and (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post27#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 167#(= ~counter~0 0), Black: 5935#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 6011#(and (<= ~n_inv~0 1) (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~f_inv~0.offset 0) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5080#(and (or (<= ~n_inv~0 1) (<= ~counter~0 0)) (or (and (= ~f_inv~0.offset 0) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))) (not (= ~counter~0 0)))), Black: 5933#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0)), Black: 5941#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), Black: 6025#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0) (<= ~n~0 1)), 4702#(< |thread1Thread1of1ForFork0_~i~0#1| ~N~0), 1809#(< |thread2Thread1of1ForFork1_~i~1#1| ~N~0), Black: 2574#(<= 1 ~N~0), Black: 4245#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 ~N~0)), Black: 575#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1348#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)), 51#L66true, Black: 576#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)), Black: 1352#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)), Black: 1350#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0)), 75#L83-4true, 5065#true, 6079#true, 8058#true, 162#true, Black: 1382#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 3855#(< |thread2Thread1of1ForFork1_~i~1#1| ~N~0), Black: 8050#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 7084#(= ~counter~0 0), Black: 8038#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~f_inv~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n_inv~0 1) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~f_inv~0.offset 0) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 8048#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8044#(and (<= ~n_inv~0 1) (exists ((v_arrayElimCell_17 Int)) (and (<= ~counter~0 v_arrayElimCell_17) (< v_arrayElimCell_17 ~n_inv~0) (= (select (select |#memory_int| ~f_inv~0.base) (+ ~f_inv~0.offset (* 4 v_arrayElimCell_17))) 0) (<= 0 v_arrayElimCell_17))) (= ~f_inv~0.offset 0)), Black: 7629#(or (not (< ~counter~0 ~n_inv~0)) (not (<= 0 ~counter~0)) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))), 7082#true]) [2022-07-22 21:49:14,038 INFO L384 tUnfolder$Statistics]: this new event has 135 ancestors and is cut-off event [2022-07-22 21:49:14,038 INFO L387 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-07-22 21:49:14,038 INFO L387 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-07-22 21:49:14,038 INFO L387 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-07-22 21:49:14,047 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([582] L47-2-->L47-3: Formula: (= (+ |v_thread1Thread1of1ForFork0_#t~post1#1_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_9|) InVars {thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_3|} OutVars{thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_3|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1][375], [Black: 2555#(and (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 ~counter~0) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 3407#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 2563#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 3402#true, Black: 6095#(and (or (and (not (= ~f_inv~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))) (not (= ~counter~0 0))) (= ~f_inv~0.offset 0) (or (<= ~n_inv~0 1) (<= ~counter~0 0))), Black: 6021#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 1)), Black: 6644#(or (not (< ~counter~0 ~n_inv~0)) (not (<= 0 ~counter~0)) (forall ((v_ArrVal_360 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_360) ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)) 0))), Black: 5965#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 7064#(and (exists ((~f~0.offset Int) (~f~0.base Int)) (and (= ~counter~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= (select (select |#memory_int| ~f_inv~0.base) (+ ~f_inv~0.offset (* (select (select |#memory_int| ~f~0.base) ~f~0.offset) 4))) 0))) (< (+ ~f_inv~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n_inv~0 1) (= ~f_inv~0.offset 0)), Black: 5981#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6622#(or (not (< ~counter~0 ~n_inv~0)) (not (<= 0 ~counter~0)) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))), Black: 7058#(and (forall ((v_ArrVal_359 (Array Int Int)) (v_ArrVal_360 (Array Int Int)) (~f~0.offset Int) (~f~0.base Int)) (or (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_360) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset))) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 0) (not (= ~counter~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset))) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (<= 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)))) (not (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) ~n_inv~0)))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (forall ((v_ArrVal_359 (Array Int Int)) (v_ArrVal_360 (Array Int Int)) (~f~0.offset Int) (~f~0.base Int)) (or (not (= ~counter~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f_inv~0.base) (+ (* 4 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset))) ~f_inv~0.offset)))) (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_360) ~f_inv~0.base) (+ (* 4 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset))) ~f_inv~0.offset)) 0) (not (<= 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)))) (not (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) ~n_inv~0)))) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 5975#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post27#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6666#(forall ((~f~0.offset Int) (~f~0.base Int)) (or (not (= ~counter~0 (select (select |#memory_int| ~f_inv~0.base) (+ ~f_inv~0.offset (* (select (select |#memory_int| ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) 4))))) (not (<= 0 (select (select |#memory_int| ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)))) (forall ((v_ArrVal_360 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_360) ~f_inv~0.base) (+ ~f_inv~0.offset (* (select (select |#memory_int| ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) 4))) 0)) (not (< (select (select |#memory_int| ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) ~n_inv~0)))), 577#(<= 1 ~N~0), Black: 5979#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (<= ~n~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 7060#(and (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((~f~0.offset Int) (~f~0.base Int)) (and (= ~counter~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= (select (select |#memory_int| ~f_inv~0.base) (+ ~f_inv~0.offset (* (select (select |#memory_int| ~f~0.base) ~f~0.offset) 4))) 0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~f_inv~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n_inv~0 1) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~f_inv~0.offset 0) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 7062#(and (<= ~n_inv~0 1) (= ~f_inv~0.offset 0) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))), Black: 6027#(and (= ~f_inv~0.offset 0) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset))) (= ~counter~0 0)), Black: 5999#(and (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6081#(= ~counter~0 0), Black: 6019#(and (<= ~n_inv~0 1) (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~f_inv~0.offset 0) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset))) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5939#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post27#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), Black: 552#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 ~counter~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 5993#(and (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post27#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 57#L60-5true, Black: 167#(= ~counter~0 0), Black: 5935#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 6011#(and (<= ~n_inv~0 1) (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~f_inv~0.offset 0) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5080#(and (or (<= ~n_inv~0 1) (<= ~counter~0 0)) (or (and (= ~f_inv~0.offset 0) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))) (not (= ~counter~0 0)))), Black: 5933#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0)), Black: 5941#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), Black: 6025#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0) (<= ~n~0 1)), 1377#true, Black: 2574#(<= 1 ~N~0), Black: 4245#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 ~N~0)), Black: 575#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1348#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)), Black: 576#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)), Black: 1352#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)), Black: 1350#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0)), 3392#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork1_~i~1#1|)), 75#L83-4true, 5065#true, 6079#true, 8058#true, 162#true, 4240#true, Black: 1382#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 8050#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 7084#(= ~counter~0 0), Black: 8038#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~f_inv~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n_inv~0 1) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~f_inv~0.offset 0) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 8048#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8044#(and (<= ~n_inv~0 1) (exists ((v_arrayElimCell_17 Int)) (and (<= ~counter~0 v_arrayElimCell_17) (< v_arrayElimCell_17 ~n_inv~0) (= (select (select |#memory_int| ~f_inv~0.base) (+ ~f_inv~0.offset (* 4 v_arrayElimCell_17))) 0) (<= 0 v_arrayElimCell_17))) (= ~f_inv~0.offset 0)), Black: 7629#(or (not (< ~counter~0 ~n_inv~0)) (not (<= 0 ~counter~0)) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))), 7082#true, 93#L47-3true]) [2022-07-22 21:49:14,047 INFO L384 tUnfolder$Statistics]: this new event has 136 ancestors and is cut-off event [2022-07-22 21:49:14,047 INFO L387 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-07-22 21:49:14,047 INFO L387 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-07-22 21:49:14,047 INFO L387 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-07-22 21:49:14,244 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([589] L61-->L66: Formula: (let ((.cse2 (not |v_thread2_#t~short11#1_66|)) (.cse1 (select (select |v_#memory_int_97| v_~f_inv~0.base_62) (+ v_~f_inv~0.offset_62 (* v_~counter~0_134 4))))) (and (or (and (let ((.cse0 (< |v_thread2_#t~mem10#1_52| v_~n~0_32))) (or (and (not .cse0) (not |v_thread2_#t~short11#1_65|)) (and .cse0 |v_thread2_#t~short11#1_65|))) (= |v_thread2_#t~mem10#1_52| .cse1) |v_thread2_#t~short11#1_66|) (and (= |v_thread2_#t~short11#1_66| |v_thread2_#t~short11#1_65|) .cse2 (= |v_thread2Thread1of1ForFork1_#t~mem10#1_1| |v_thread2_#t~mem10#1_52|))) (= (ite (= v_~counter~0_134 (select (select |v_#memory_int_97| v_~f~0.base_58) (+ v_~f~0.offset_58 (* .cse1 4)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= v_~counter~0_133 .cse1) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (let ((.cse3 (<= 0 .cse1))) (or (and |v_thread2_#t~short11#1_66| .cse3) (and .cse2 (not .cse3)))) (not (= (ite |v_thread2_#t~short11#1_65| 1 0) 0)) (not (= (ite (and (<= 0 v_~counter~0_134) (< v_~counter~0_134 v_~n_inv~0_22)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_134, ~f_inv~0.offset=v_~f_inv~0.offset_62, ~f~0.base=v_~f~0.base_58, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_1|, #memory_int=|v_#memory_int_97|, ~f_inv~0.base=v_~f_inv~0.base_62, ~n~0=v_~n~0_32, ~f~0.offset=v_~f~0.offset_58, ~n_inv~0=v_~n_inv~0_22} OutVars{~counter~0=v_~counter~0_133, thread2Thread1of1ForFork1_#t~mem13#1=|v_thread2Thread1of1ForFork1_#t~mem13#1_1|, ~f_inv~0.offset=v_~f_inv~0.offset_62, thread2Thread1of1ForFork1_#t~short11#1=|v_thread2Thread1of1ForFork1_#t~short11#1_1|, ~f~0.base=v_~f~0.base_58, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~f_inv~0.base=v_~f_inv~0.base_62, ~f~0.offset=v_~f~0.offset_58, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_1|, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_1|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_1|, #memory_int=|v_#memory_int_97|, ~n~0=v_~n~0_32, ~n_inv~0=v_~n_inv~0_22} AuxVars[|v_thread2_#t~short11#1_65|, |v_thread2_#t~short11#1_66|, |v_thread2_#t~mem10#1_52|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~mem13#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~short11#1, thread2Thread1of1ForFork1_#t~mem14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1][270], [Black: 2555#(and (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 ~counter~0) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 3407#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 2563#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 1354#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), 90#L53true, 3390#(and (<= 1 ~N~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)), Black: 6095#(and (or (and (not (= ~f_inv~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))) (not (= ~counter~0 0))) (= ~f_inv~0.offset 0) (or (<= ~n_inv~0 1) (<= ~counter~0 0))), Black: 6644#(or (not (< ~counter~0 ~n_inv~0)) (not (<= 0 ~counter~0)) (forall ((v_ArrVal_360 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_360) ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)) 0))), Black: 6021#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 1)), Black: 5965#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 7064#(and (exists ((~f~0.offset Int) (~f~0.base Int)) (and (= ~counter~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= (select (select |#memory_int| ~f_inv~0.base) (+ ~f_inv~0.offset (* (select (select |#memory_int| ~f~0.base) ~f~0.offset) 4))) 0))) (< (+ ~f_inv~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n_inv~0 1) (= ~f_inv~0.offset 0)), Black: 5981#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6622#(or (not (< ~counter~0 ~n_inv~0)) (not (<= 0 ~counter~0)) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))), Black: 7058#(and (forall ((v_ArrVal_359 (Array Int Int)) (v_ArrVal_360 (Array Int Int)) (~f~0.offset Int) (~f~0.base Int)) (or (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_360) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset))) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 0) (not (= ~counter~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset))) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (<= 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)))) (not (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) ~n_inv~0)))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (forall ((v_ArrVal_359 (Array Int Int)) (v_ArrVal_360 (Array Int Int)) (~f~0.offset Int) (~f~0.base Int)) (or (not (= ~counter~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f_inv~0.base) (+ (* 4 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset))) ~f_inv~0.offset)))) (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_360) ~f_inv~0.base) (+ (* 4 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset))) ~f_inv~0.offset)) 0) (not (<= 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)))) (not (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) ~n_inv~0)))) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 5975#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post27#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6666#(forall ((~f~0.offset Int) (~f~0.base Int)) (or (not (= ~counter~0 (select (select |#memory_int| ~f_inv~0.base) (+ ~f_inv~0.offset (* (select (select |#memory_int| ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) 4))))) (not (<= 0 (select (select |#memory_int| ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)))) (forall ((v_ArrVal_360 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_360) ~f_inv~0.base) (+ ~f_inv~0.offset (* (select (select |#memory_int| ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) 4))) 0)) (not (< (select (select |#memory_int| ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) ~n_inv~0)))), Black: 7060#(and (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((~f~0.offset Int) (~f~0.base Int)) (and (= ~counter~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= (select (select |#memory_int| ~f_inv~0.base) (+ ~f_inv~0.offset (* (select (select |#memory_int| ~f~0.base) ~f~0.offset) 4))) 0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~f_inv~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n_inv~0 1) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~f_inv~0.offset 0) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5979#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (<= ~n~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 7062#(and (<= ~n_inv~0 1) (= ~f_inv~0.offset 0) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))), Black: 6027#(and (= ~f_inv~0.offset 0) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset))) (= ~counter~0 0)), Black: 5999#(and (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6081#(= ~counter~0 0), 148#L84-1true, Black: 6019#(and (<= ~n_inv~0 1) (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~f_inv~0.offset 0) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset))) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5939#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post27#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), Black: 552#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 ~counter~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 5993#(and (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post27#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 167#(= ~counter~0 0), Black: 5935#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 6011#(and (<= ~n_inv~0 1) (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~f_inv~0.offset 0) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5080#(and (or (<= ~n_inv~0 1) (<= ~counter~0 0)) (or (and (= ~f_inv~0.offset 0) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))) (not (= ~counter~0 0)))), Black: 5933#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0)), Black: 5941#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), Black: 6025#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0) (<= ~n~0 1)), 4702#(< |thread1Thread1of1ForFork0_~i~0#1| ~N~0), 1809#(< |thread2Thread1of1ForFork1_~i~1#1| ~N~0), Black: 2574#(<= 1 ~N~0), Black: 4245#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 ~N~0)), Black: 575#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1348#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)), 51#L66true, Black: 576#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)), Black: 1352#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)), Black: 1350#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0)), 5065#true, 6079#true, 8058#true, 162#true, Black: 1382#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 3855#(< |thread2Thread1of1ForFork1_~i~1#1| ~N~0), Black: 8050#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 7084#(= ~counter~0 0), Black: 8038#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~f_inv~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n_inv~0 1) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~f_inv~0.offset 0) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 8048#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8044#(and (<= ~n_inv~0 1) (exists ((v_arrayElimCell_17 Int)) (and (<= ~counter~0 v_arrayElimCell_17) (< v_arrayElimCell_17 ~n_inv~0) (= (select (select |#memory_int| ~f_inv~0.base) (+ ~f_inv~0.offset (* 4 v_arrayElimCell_17))) 0) (<= 0 v_arrayElimCell_17))) (= ~f_inv~0.offset 0)), Black: 7629#(or (not (< ~counter~0 ~n_inv~0)) (not (<= 0 ~counter~0)) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))), 7082#true]) [2022-07-22 21:49:14,244 INFO L384 tUnfolder$Statistics]: this new event has 138 ancestors and is cut-off event [2022-07-22 21:49:14,244 INFO L387 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-07-22 21:49:14,244 INFO L387 tUnfolder$Statistics]: existing Event has 133 ancestors and is cut-off event [2022-07-22 21:49:14,244 INFO L387 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-07-22 21:49:15,540 INFO L129 PetriNetUnfolder]: 2625/9645 cut-off events. [2022-07-22 21:49:15,541 INFO L130 PetriNetUnfolder]: For 46854/48305 co-relation queries the response was YES. [2022-07-22 21:49:15,598 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38077 conditions, 9645 events. 2625/9645 cut-off events. For 46854/48305 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 110746 event pairs, 65 based on Foata normal form. 294/9798 useless extension candidates. Maximal degree in co-relation 38022. Up to 1638 conditions per place. [2022-07-22 21:49:15,640 INFO L132 encePairwiseOnDemand]: 135/165 looper letters, 146 selfloop transitions, 106 changer transitions 14/451 dead transitions. [2022-07-22 21:49:15,640 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 451 transitions, 4140 flow [2022-07-22 21:49:15,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-22 21:49:15,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-07-22 21:49:15,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 2618 transitions. [2022-07-22 21:49:15,644 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.4533333333333333 [2022-07-22 21:49:15,644 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 2618 transitions. [2022-07-22 21:49:15,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 2618 transitions. [2022-07-22 21:49:15,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:49:15,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 2618 transitions. [2022-07-22 21:49:15,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 74.8) internal successors, (2618), 35 states have internal predecessors, (2618), 0 states have call successors, (0), 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:49:15,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 165.0) internal successors, (5940), 36 states have internal predecessors, (5940), 0 states have call successors, (0), 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:49:15,655 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 165.0) internal successors, (5940), 36 states have internal predecessors, (5940), 0 states have call successors, (0), 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:49:15,655 INFO L186 Difference]: Start difference. First operand has 327 places, 354 transitions, 2675 flow. Second operand 35 states and 2618 transitions. [2022-07-22 21:49:15,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 451 transitions, 4140 flow [2022-07-22 21:49:15,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 451 transitions, 3986 flow, removed 42 selfloop flow, removed 21 redundant places. [2022-07-22 21:49:15,975 INFO L242 Difference]: Finished difference. Result has 346 places, 404 transitions, 3447 flow [2022-07-22 21:49:15,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=2555, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=3447, PETRI_PLACES=346, PETRI_TRANSITIONS=404} [2022-07-22 21:49:15,976 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 198 predicate places. [2022-07-22 21:49:15,976 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 404 transitions, 3447 flow [2022-07-22 21:49:15,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 73.86538461538461) internal successors, (3841), 52 states have internal predecessors, (3841), 0 states have call successors, (0), 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:49:15,977 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:49:15,978 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:49:15,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-22 21:49:16,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-22 21:49:16,187 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:49:16,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:49:16,188 INFO L85 PathProgramCache]: Analyzing trace with hash -116099293, now seen corresponding path program 5 times [2022-07-22 21:49:16,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:49:16,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820413482] [2022-07-22 21:49:16,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:49:16,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:49:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:49:16,846 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 21:49:16,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:49:16,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820413482] [2022-07-22 21:49:16,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820413482] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:49:16,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94902278] [2022-07-22 21:49:16,847 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 21:49:16,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:49:16,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:49:16,849 INFO L229 MonitoredProcess]: Starting monitored process 13 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:49:16,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-22 21:49:16,968 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-07-22 21:49:16,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 21:49:16,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-22 21:49:16,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:49:17,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2022-07-22 21:49:17,854 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 21:49:17,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:49:18,009 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 36 treesize of output 12 [2022-07-22 21:49:18,992 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 21:49:18,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94902278] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:49:18,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:49:18,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 20 [2022-07-22 21:49:18,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444444914] [2022-07-22 21:49:18,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:49:18,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-22 21:49:18,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:49:18,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-22 21:49:18,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-07-22 21:49:18,996 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 165 [2022-07-22 21:49:18,997 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 404 transitions, 3447 flow. Second operand has 20 states, 20 states have (on average 95.35) internal successors, (1907), 20 states have internal predecessors, (1907), 0 states have call successors, (0), 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:49:18,997 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:49:18,997 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 165 [2022-07-22 21:49:18,997 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:49:21,725 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([589] L61-->L66: Formula: (let ((.cse2 (not |v_thread2_#t~short11#1_66|)) (.cse1 (select (select |v_#memory_int_97| v_~f_inv~0.base_62) (+ v_~f_inv~0.offset_62 (* v_~counter~0_134 4))))) (and (or (and (let ((.cse0 (< |v_thread2_#t~mem10#1_52| v_~n~0_32))) (or (and (not .cse0) (not |v_thread2_#t~short11#1_65|)) (and .cse0 |v_thread2_#t~short11#1_65|))) (= |v_thread2_#t~mem10#1_52| .cse1) |v_thread2_#t~short11#1_66|) (and (= |v_thread2_#t~short11#1_66| |v_thread2_#t~short11#1_65|) .cse2 (= |v_thread2Thread1of1ForFork1_#t~mem10#1_1| |v_thread2_#t~mem10#1_52|))) (= (ite (= v_~counter~0_134 (select (select |v_#memory_int_97| v_~f~0.base_58) (+ v_~f~0.offset_58 (* .cse1 4)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= v_~counter~0_133 .cse1) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (let ((.cse3 (<= 0 .cse1))) (or (and |v_thread2_#t~short11#1_66| .cse3) (and .cse2 (not .cse3)))) (not (= (ite |v_thread2_#t~short11#1_65| 1 0) 0)) (not (= (ite (and (<= 0 v_~counter~0_134) (< v_~counter~0_134 v_~n_inv~0_22)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_134, ~f_inv~0.offset=v_~f_inv~0.offset_62, ~f~0.base=v_~f~0.base_58, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_1|, #memory_int=|v_#memory_int_97|, ~f_inv~0.base=v_~f_inv~0.base_62, ~n~0=v_~n~0_32, ~f~0.offset=v_~f~0.offset_58, ~n_inv~0=v_~n_inv~0_22} OutVars{~counter~0=v_~counter~0_133, thread2Thread1of1ForFork1_#t~mem13#1=|v_thread2Thread1of1ForFork1_#t~mem13#1_1|, ~f_inv~0.offset=v_~f_inv~0.offset_62, thread2Thread1of1ForFork1_#t~short11#1=|v_thread2Thread1of1ForFork1_#t~short11#1_1|, ~f~0.base=v_~f~0.base_58, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~f_inv~0.base=v_~f_inv~0.base_62, ~f~0.offset=v_~f~0.offset_58, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_1|, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_1|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_1|, #memory_int=|v_#memory_int_97|, ~n~0=v_~n~0_32, ~n_inv~0=v_~n_inv~0_22} AuxVars[|v_thread2_#t~short11#1_65|, |v_thread2_#t~short11#1_66|, |v_thread2_#t~mem10#1_52|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~mem13#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~short11#1, thread2Thread1of1ForFork1_#t~mem14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1][296], [Black: 2555#(and (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 ~counter~0) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 3407#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 2563#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 1354#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), 90#L53true, 3390#(and (<= 1 ~N~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)), Black: 6095#(and (or (and (not (= ~f_inv~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))) (not (= ~counter~0 0))) (= ~f_inv~0.offset 0) (or (<= ~n_inv~0 1) (<= ~counter~0 0))), Black: 6021#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 1)), Black: 5965#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 7064#(and (exists ((~f~0.offset Int) (~f~0.base Int)) (and (= ~counter~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= (select (select |#memory_int| ~f_inv~0.base) (+ ~f_inv~0.offset (* (select (select |#memory_int| ~f~0.base) ~f~0.offset) 4))) 0))) (< (+ ~f_inv~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n_inv~0 1) (= ~f_inv~0.offset 0)), Black: 6622#(or (not (< ~counter~0 ~n_inv~0)) (not (<= 0 ~counter~0)) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))), Black: 5981#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 7058#(and (forall ((v_ArrVal_359 (Array Int Int)) (v_ArrVal_360 (Array Int Int)) (~f~0.offset Int) (~f~0.base Int)) (or (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_360) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset))) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 0) (not (= ~counter~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset))) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (<= 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)))) (not (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) ~n_inv~0)))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (forall ((v_ArrVal_359 (Array Int Int)) (v_ArrVal_360 (Array Int Int)) (~f~0.offset Int) (~f~0.base Int)) (or (not (= ~counter~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f_inv~0.base) (+ (* 4 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset))) ~f_inv~0.offset)))) (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_360) ~f_inv~0.base) (+ (* 4 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset))) ~f_inv~0.offset)) 0) (not (<= 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)))) (not (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) ~n_inv~0)))) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 5975#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post27#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6666#(forall ((~f~0.offset Int) (~f~0.base Int)) (or (not (= ~counter~0 (select (select |#memory_int| ~f_inv~0.base) (+ ~f_inv~0.offset (* (select (select |#memory_int| ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) 4))))) (not (<= 0 (select (select |#memory_int| ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)))) (forall ((v_ArrVal_360 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_360) ~f_inv~0.base) (+ ~f_inv~0.offset (* (select (select |#memory_int| ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) 4))) 0)) (not (< (select (select |#memory_int| ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) ~n_inv~0)))), Black: 5979#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (<= ~n~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 7060#(and (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((~f~0.offset Int) (~f~0.base Int)) (and (= ~counter~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= (select (select |#memory_int| ~f_inv~0.base) (+ ~f_inv~0.offset (* (select (select |#memory_int| ~f~0.base) ~f~0.offset) 4))) 0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~f_inv~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n_inv~0 1) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~f_inv~0.offset 0) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 7062#(and (<= ~n_inv~0 1) (= ~f_inv~0.offset 0) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))), Black: 6027#(and (= ~f_inv~0.offset 0) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset))) (= ~counter~0 0)), Black: 5999#(and (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6081#(= ~counter~0 0), Black: 6019#(and (<= ~n_inv~0 1) (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~f_inv~0.offset 0) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset))) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5939#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post27#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), Black: 552#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 ~counter~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 5993#(and (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post27#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 167#(= ~counter~0 0), Black: 5935#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 9972#(and (<= ~n_inv~0 1) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), Black: 6011#(and (<= ~n_inv~0 1) (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~f_inv~0.offset 0) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5080#(and (or (<= ~n_inv~0 1) (<= ~counter~0 0)) (or (and (= ~f_inv~0.offset 0) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))) (not (= ~counter~0 0)))), Black: 5933#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0)), Black: 5941#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), Black: 6025#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0) (<= ~n~0 1)), 4702#(< |thread1Thread1of1ForFork0_~i~0#1| ~N~0), 1809#(< |thread2Thread1of1ForFork1_~i~1#1| ~N~0), Black: 2574#(<= 1 ~N~0), Black: 4245#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 ~N~0)), Black: 575#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 51#L66true, Black: 1348#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)), Black: 576#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)), Black: 1352#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)), Black: 9024#(and (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~counter~0 0)) (<= ~n_inv~0 0)) (<= ~n_inv~0 1))) (or (not (< ~counter~0 ~n_inv~0)) (not (<= 0 ~counter~0)) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))) (or (and (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~counter~0 0)) (<= ~n_inv~0 0)) (<= ~n_inv~0 1)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|))), Black: 1350#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0)), Black: 9041#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9043#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8580#(or (not (< ~counter~0 ~n_inv~0)) (not (<= 0 ~counter~0)) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))), Black: 8060#(= ~counter~0 0), Black: 9039#(and (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (<= ~n_inv~0 1) (or (and (= ~counter~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n_inv~0 0)))) (or (forall ((v_ArrVal_437 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_437) ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)) 0)) (not (< ~counter~0 ~n_inv~0)) (not (<= 0 ~counter~0))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~counter~0 0)) (<= ~n_inv~0 0)) (<= ~n_inv~0 1))) (or (and (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~counter~0 0)) (<= ~n_inv~0 0)) (<= ~n_inv~0 1)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|))), Black: 9032#(and (or (not (< ~counter~0 ~n_inv~0)) (not (<= 0 ~counter~0)) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))) (or (and (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~counter~0 0)) (<= ~n_inv~0 0)) (<= ~n_inv~0 1)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|))), Black: 9026#(and (or (= ~f_inv~0.offset 0) (<= (+ ~counter~0 1) 0)) (<= ~n_inv~0 1) (exists ((v_arrayElimCell_26 Int)) (and (<= ~counter~0 v_arrayElimCell_26) (<= 0 v_arrayElimCell_26) (< v_arrayElimCell_26 ~n_inv~0) (= (select (select |#memory_int| ~f_inv~0.base) (+ ~f_inv~0.offset (* 4 v_arrayElimCell_26))) 0)))), 75#L83-4true, 5065#true, 6079#true, 8058#true, 162#true, Black: 1382#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 3855#(< |thread2Thread1of1ForFork1_~i~1#1| ~N~0), Black: 7084#(= ~counter~0 0), Black: 8038#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~f_inv~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n_inv~0 1) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~f_inv~0.offset 0) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 8044#(and (<= ~n_inv~0 1) (exists ((v_arrayElimCell_17 Int)) (and (<= ~counter~0 v_arrayElimCell_17) (< v_arrayElimCell_17 ~n_inv~0) (= (select (select |#memory_int| ~f_inv~0.base) (+ ~f_inv~0.offset (* 4 v_arrayElimCell_17))) 0) (<= 0 v_arrayElimCell_17))) (= ~f_inv~0.offset 0)), Black: 7629#(or (not (< ~counter~0 ~n_inv~0)) (not (<= 0 ~counter~0)) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))), 7082#true]) [2022-07-22 21:49:21,725 INFO L384 tUnfolder$Statistics]: this new event has 135 ancestors and is cut-off event [2022-07-22 21:49:21,725 INFO L387 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-07-22 21:49:21,725 INFO L387 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-07-22 21:49:21,725 INFO L387 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-07-22 21:49:21,757 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([582] L47-2-->L47-3: Formula: (= (+ |v_thread1Thread1of1ForFork0_#t~post1#1_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_9|) InVars {thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_3|} OutVars{thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_3|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1][369], [Black: 2555#(and (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 ~counter~0) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 3407#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 2563#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 3402#true, Black: 6095#(and (or (and (not (= ~f_inv~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))) (not (= ~counter~0 0))) (= ~f_inv~0.offset 0) (or (<= ~n_inv~0 1) (<= ~counter~0 0))), Black: 6021#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 1)), Black: 5965#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 7064#(and (exists ((~f~0.offset Int) (~f~0.base Int)) (and (= ~counter~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= (select (select |#memory_int| ~f_inv~0.base) (+ ~f_inv~0.offset (* (select (select |#memory_int| ~f~0.base) ~f~0.offset) 4))) 0))) (< (+ ~f_inv~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n_inv~0 1) (= ~f_inv~0.offset 0)), Black: 6622#(or (not (< ~counter~0 ~n_inv~0)) (not (<= 0 ~counter~0)) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))), Black: 5981#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 7058#(and (forall ((v_ArrVal_359 (Array Int Int)) (v_ArrVal_360 (Array Int Int)) (~f~0.offset Int) (~f~0.base Int)) (or (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_360) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset))) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 0) (not (= ~counter~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset))) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (<= 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)))) (not (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) ~n_inv~0)))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (forall ((v_ArrVal_359 (Array Int Int)) (v_ArrVal_360 (Array Int Int)) (~f~0.offset Int) (~f~0.base Int)) (or (not (= ~counter~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f_inv~0.base) (+ (* 4 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset))) ~f_inv~0.offset)))) (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_360) ~f_inv~0.base) (+ (* 4 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset))) ~f_inv~0.offset)) 0) (not (<= 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)))) (not (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) ~n_inv~0)))) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 5975#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post27#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6666#(forall ((~f~0.offset Int) (~f~0.base Int)) (or (not (= ~counter~0 (select (select |#memory_int| ~f_inv~0.base) (+ ~f_inv~0.offset (* (select (select |#memory_int| ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) 4))))) (not (<= 0 (select (select |#memory_int| ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)))) (forall ((v_ArrVal_360 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_360) ~f_inv~0.base) (+ ~f_inv~0.offset (* (select (select |#memory_int| ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) 4))) 0)) (not (< (select (select |#memory_int| ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) ~n_inv~0)))), 577#(<= 1 ~N~0), Black: 5979#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (<= ~n~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 7060#(and (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((~f~0.offset Int) (~f~0.base Int)) (and (= ~counter~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= (select (select |#memory_int| ~f_inv~0.base) (+ ~f_inv~0.offset (* (select (select |#memory_int| ~f~0.base) ~f~0.offset) 4))) 0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~f_inv~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n_inv~0 1) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~f_inv~0.offset 0) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 6027#(and (= ~f_inv~0.offset 0) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset))) (= ~counter~0 0)), Black: 7062#(and (<= ~n_inv~0 1) (= ~f_inv~0.offset 0) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))), Black: 5999#(and (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6081#(= ~counter~0 0), Black: 6019#(and (<= ~n_inv~0 1) (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~f_inv~0.offset 0) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset))) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5939#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post27#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), Black: 552#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 ~counter~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 5993#(and (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post27#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 57#L60-5true, Black: 167#(= ~counter~0 0), Black: 5935#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 9966#(and (<= ~n_inv~0 1) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), Black: 6011#(and (<= ~n_inv~0 1) (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~f_inv~0.offset 0) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5080#(and (or (<= ~n_inv~0 1) (<= ~counter~0 0)) (or (and (= ~f_inv~0.offset 0) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))) (not (= ~counter~0 0)))), Black: 5933#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0)), Black: 5941#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), Black: 6025#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0) (<= ~n~0 1)), 1377#true, Black: 2574#(<= 1 ~N~0), Black: 4245#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 ~N~0)), Black: 575#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1348#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)), Black: 576#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)), Black: 1352#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)), Black: 9024#(and (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~counter~0 0)) (<= ~n_inv~0 0)) (<= ~n_inv~0 1))) (or (not (< ~counter~0 ~n_inv~0)) (not (<= 0 ~counter~0)) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))) (or (and (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~counter~0 0)) (<= ~n_inv~0 0)) (<= ~n_inv~0 1)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|))), Black: 9041#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1350#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0)), Black: 9043#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 3392#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork1_~i~1#1|)), Black: 8580#(or (not (< ~counter~0 ~n_inv~0)) (not (<= 0 ~counter~0)) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))), Black: 8060#(= ~counter~0 0), Black: 9039#(and (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (<= ~n_inv~0 1) (or (and (= ~counter~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n_inv~0 0)))) (or (forall ((v_ArrVal_437 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_437) ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)) 0)) (not (< ~counter~0 ~n_inv~0)) (not (<= 0 ~counter~0))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~counter~0 0)) (<= ~n_inv~0 0)) (<= ~n_inv~0 1))) (or (and (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~counter~0 0)) (<= ~n_inv~0 0)) (<= ~n_inv~0 1)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|))), Black: 9032#(and (or (not (< ~counter~0 ~n_inv~0)) (not (<= 0 ~counter~0)) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))) (or (and (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~counter~0 0)) (<= ~n_inv~0 0)) (<= ~n_inv~0 1)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|))), Black: 9026#(and (or (= ~f_inv~0.offset 0) (<= (+ ~counter~0 1) 0)) (<= ~n_inv~0 1) (exists ((v_arrayElimCell_26 Int)) (and (<= ~counter~0 v_arrayElimCell_26) (<= 0 v_arrayElimCell_26) (< v_arrayElimCell_26 ~n_inv~0) (= (select (select |#memory_int| ~f_inv~0.base) (+ ~f_inv~0.offset (* 4 v_arrayElimCell_26))) 0)))), 75#L83-4true, 5065#true, 6079#true, 8058#true, 162#true, 4240#true, Black: 1382#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 7084#(= ~counter~0 0), Black: 8038#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~f_inv~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n_inv~0 1) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~f_inv~0.offset 0) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 8044#(and (<= ~n_inv~0 1) (exists ((v_arrayElimCell_17 Int)) (and (<= ~counter~0 v_arrayElimCell_17) (< v_arrayElimCell_17 ~n_inv~0) (= (select (select |#memory_int| ~f_inv~0.base) (+ ~f_inv~0.offset (* 4 v_arrayElimCell_17))) 0) (<= 0 v_arrayElimCell_17))) (= ~f_inv~0.offset 0)), Black: 7629#(or (not (< ~counter~0 ~n_inv~0)) (not (<= 0 ~counter~0)) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))), 7082#true, 93#L47-3true]) [2022-07-22 21:49:21,758 INFO L384 tUnfolder$Statistics]: this new event has 136 ancestors and is cut-off event [2022-07-22 21:49:21,758 INFO L387 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-07-22 21:49:21,758 INFO L387 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-07-22 21:49:21,758 INFO L387 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-07-22 21:49:21,979 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([589] L61-->L66: Formula: (let ((.cse2 (not |v_thread2_#t~short11#1_66|)) (.cse1 (select (select |v_#memory_int_97| v_~f_inv~0.base_62) (+ v_~f_inv~0.offset_62 (* v_~counter~0_134 4))))) (and (or (and (let ((.cse0 (< |v_thread2_#t~mem10#1_52| v_~n~0_32))) (or (and (not .cse0) (not |v_thread2_#t~short11#1_65|)) (and .cse0 |v_thread2_#t~short11#1_65|))) (= |v_thread2_#t~mem10#1_52| .cse1) |v_thread2_#t~short11#1_66|) (and (= |v_thread2_#t~short11#1_66| |v_thread2_#t~short11#1_65|) .cse2 (= |v_thread2Thread1of1ForFork1_#t~mem10#1_1| |v_thread2_#t~mem10#1_52|))) (= (ite (= v_~counter~0_134 (select (select |v_#memory_int_97| v_~f~0.base_58) (+ v_~f~0.offset_58 (* .cse1 4)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= v_~counter~0_133 .cse1) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (let ((.cse3 (<= 0 .cse1))) (or (and |v_thread2_#t~short11#1_66| .cse3) (and .cse2 (not .cse3)))) (not (= (ite |v_thread2_#t~short11#1_65| 1 0) 0)) (not (= (ite (and (<= 0 v_~counter~0_134) (< v_~counter~0_134 v_~n_inv~0_22)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_134, ~f_inv~0.offset=v_~f_inv~0.offset_62, ~f~0.base=v_~f~0.base_58, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_1|, #memory_int=|v_#memory_int_97|, ~f_inv~0.base=v_~f_inv~0.base_62, ~n~0=v_~n~0_32, ~f~0.offset=v_~f~0.offset_58, ~n_inv~0=v_~n_inv~0_22} OutVars{~counter~0=v_~counter~0_133, thread2Thread1of1ForFork1_#t~mem13#1=|v_thread2Thread1of1ForFork1_#t~mem13#1_1|, ~f_inv~0.offset=v_~f_inv~0.offset_62, thread2Thread1of1ForFork1_#t~short11#1=|v_thread2Thread1of1ForFork1_#t~short11#1_1|, ~f~0.base=v_~f~0.base_58, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~f_inv~0.base=v_~f_inv~0.base_62, ~f~0.offset=v_~f~0.offset_58, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_1|, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_1|, thread2Thread1of1ForFork1_#t~mem12#1=|v_thread2Thread1of1ForFork1_#t~mem12#1_1|, #memory_int=|v_#memory_int_97|, ~n~0=v_~n~0_32, ~n_inv~0=v_~n_inv~0_22} AuxVars[|v_thread2_#t~short11#1_65|, |v_thread2_#t~short11#1_66|, |v_thread2_#t~mem10#1_52|] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~mem13#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~short11#1, thread2Thread1of1ForFork1_#t~mem14#1, thread2Thread1of1ForFork1_#t~mem12#1, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1][296], [Black: 2555#(and (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 ~counter~0) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 3407#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 2563#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 1354#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), 3390#(and (<= 1 ~N~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)), 90#L53true, Black: 6095#(and (or (and (not (= ~f_inv~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))) (not (= ~counter~0 0))) (= ~f_inv~0.offset 0) (or (<= ~n_inv~0 1) (<= ~counter~0 0))), Black: 6021#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 1)), Black: 5965#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 7064#(and (exists ((~f~0.offset Int) (~f~0.base Int)) (and (= ~counter~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= (select (select |#memory_int| ~f_inv~0.base) (+ ~f_inv~0.offset (* (select (select |#memory_int| ~f~0.base) ~f~0.offset) 4))) 0))) (< (+ ~f_inv~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n_inv~0 1) (= ~f_inv~0.offset 0)), Black: 6622#(or (not (< ~counter~0 ~n_inv~0)) (not (<= 0 ~counter~0)) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))), Black: 5981#(and (or (< |ULTIMATE.start_create_fresh_int_array_~i~2#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 7058#(and (forall ((v_ArrVal_359 (Array Int Int)) (v_ArrVal_360 (Array Int Int)) (~f~0.offset Int) (~f~0.base Int)) (or (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_360) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset))) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 0) (not (= ~counter~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset))) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (<= 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)))) (not (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) ~n_inv~0)))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (forall ((v_ArrVal_359 (Array Int Int)) (v_ArrVal_360 (Array Int Int)) (~f~0.offset Int) (~f~0.base Int)) (or (not (= ~counter~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f_inv~0.base) (+ (* 4 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset))) ~f_inv~0.offset)))) (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_360) ~f_inv~0.base) (+ (* 4 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset))) ~f_inv~0.offset)) 0) (not (<= 0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)))) (not (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_359) ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) ~n_inv~0)))) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 5975#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_#t~post27#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6666#(forall ((~f~0.offset Int) (~f~0.base Int)) (or (not (= ~counter~0 (select (select |#memory_int| ~f_inv~0.base) (+ ~f_inv~0.offset (* (select (select |#memory_int| ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) 4))))) (not (<= 0 (select (select |#memory_int| ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)))) (forall ((v_ArrVal_360 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_360) ~f_inv~0.base) (+ ~f_inv~0.offset (* (select (select |#memory_int| ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) 4))) 0)) (not (< (select (select |#memory_int| ~f~0.base) (+ (* ~counter~0 4) ~f~0.offset)) ~n_inv~0)))), Black: 7060#(and (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((~f~0.offset Int) (~f~0.base Int)) (and (= ~counter~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= (select (select |#memory_int| ~f_inv~0.base) (+ ~f_inv~0.offset (* (select (select |#memory_int| ~f~0.base) ~f~0.offset) 4))) 0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~f_inv~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n_inv~0 1) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~f_inv~0.offset 0) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5979#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (<= ~n~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 7062#(and (<= ~n_inv~0 1) (= ~f_inv~0.offset 0) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))), Black: 6027#(and (= ~f_inv~0.offset 0) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset))) (= ~counter~0 0)), Black: 5999#(and (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6081#(= ~counter~0 0), 148#L84-1true, Black: 6019#(and (<= ~n_inv~0 1) (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~f_inv~0.offset 0) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset))) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5939#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post27#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), Black: 552#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 ~counter~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 5993#(and (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_#t~post27#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 167#(= ~counter~0 0), Black: 5935#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 9972#(and (<= ~n_inv~0 1) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), Black: 6011#(and (<= ~n_inv~0 1) (<= (+ ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~i~2#1|) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~f_inv~0.offset 0) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5080#(and (or (<= ~n_inv~0 1) (<= ~counter~0 0)) (or (and (= ~f_inv~0.offset 0) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))) (not (= ~counter~0 0)))), Black: 5933#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0)), Black: 5941#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), Black: 6025#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~counter~0 0) (<= ~n~0 1)), 4702#(< |thread1Thread1of1ForFork0_~i~0#1| ~N~0), 1809#(< |thread2Thread1of1ForFork1_~i~1#1| ~N~0), Black: 2574#(<= 1 ~N~0), Black: 4245#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 ~N~0)), Black: 575#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1348#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)), 51#L66true, Black: 576#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)), Black: 1352#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)), Black: 9024#(and (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_inv~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~counter~0 0)) (<= ~n_inv~0 0)) (<= ~n_inv~0 1))) (or (not (< ~counter~0 ~n_inv~0)) (not (<= 0 ~counter~0)) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))) (or (and (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~counter~0 0)) (<= ~n_inv~0 0)) (<= ~n_inv~0 1)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|))), Black: 1350#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0)), Black: 9041#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 9043#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 8580#(or (not (< ~counter~0 ~n_inv~0)) (not (<= 0 ~counter~0)) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))), Black: 8060#(= ~counter~0 0), Black: 9039#(and (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (<= ~n_inv~0 1) (or (and (= ~counter~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (<= ~n_inv~0 0)))) (or (forall ((v_ArrVal_437 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_437) ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)) 0)) (not (< ~counter~0 ~n_inv~0)) (not (<= 0 ~counter~0))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~counter~0 0)) (<= ~n_inv~0 0)) (<= ~n_inv~0 1))) (or (and (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~counter~0 0)) (<= ~n_inv~0 0)) (<= ~n_inv~0 1)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|))), Black: 9032#(and (or (not (< ~counter~0 ~n_inv~0)) (not (<= 0 ~counter~0)) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))) (or (and (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~counter~0 0)) (<= ~n_inv~0 0)) (<= ~n_inv~0 1)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|))), Black: 9026#(and (or (= ~f_inv~0.offset 0) (<= (+ ~counter~0 1) 0)) (<= ~n_inv~0 1) (exists ((v_arrayElimCell_26 Int)) (and (<= ~counter~0 v_arrayElimCell_26) (<= 0 v_arrayElimCell_26) (< v_arrayElimCell_26 ~n_inv~0) (= (select (select |#memory_int| ~f_inv~0.base) (+ ~f_inv~0.offset (* 4 v_arrayElimCell_26))) 0)))), 5065#true, 6079#true, 8058#true, 162#true, Black: 1382#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 3855#(< |thread2Thread1of1ForFork1_~i~1#1| ~N~0), Black: 7084#(= ~counter~0 0), Black: 8038#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~f_inv~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n_inv~0 1) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~f_inv~0.offset 0) (<= ~n_inv~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~counter~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 8044#(and (<= ~n_inv~0 1) (exists ((v_arrayElimCell_17 Int)) (and (<= ~counter~0 v_arrayElimCell_17) (< v_arrayElimCell_17 ~n_inv~0) (= (select (select |#memory_int| ~f_inv~0.base) (+ ~f_inv~0.offset (* 4 v_arrayElimCell_17))) 0) (<= 0 v_arrayElimCell_17))) (= ~f_inv~0.offset 0)), Black: 7629#(or (not (< ~counter~0 ~n_inv~0)) (not (<= 0 ~counter~0)) (= 0 (select (select |#memory_int| ~f_inv~0.base) (+ (* ~counter~0 4) ~f_inv~0.offset)))), 7082#true]) [2022-07-22 21:49:21,979 INFO L384 tUnfolder$Statistics]: this new event has 138 ancestors and is cut-off event [2022-07-22 21:49:21,979 INFO L387 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-07-22 21:49:21,979 INFO L387 tUnfolder$Statistics]: existing Event has 133 ancestors and is cut-off event [2022-07-22 21:49:21,979 INFO L387 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-07-22 21:49:23,394 INFO L129 PetriNetUnfolder]: 3117/11719 cut-off events. [2022-07-22 21:49:23,395 INFO L130 PetriNetUnfolder]: For 72371/74638 co-relation queries the response was YES. [2022-07-22 21:49:23,471 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49172 conditions, 11719 events. 3117/11719 cut-off events. For 72371/74638 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 140030 event pairs, 144 based on Foata normal form. 406/11962 useless extension candidates. Maximal degree in co-relation 49111. Up to 1688 conditions per place. [2022-07-22 21:49:23,524 INFO L132 encePairwiseOnDemand]: 147/165 looper letters, 175 selfloop transitions, 67 changer transitions 9/459 dead transitions. [2022-07-22 21:49:23,524 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 459 transitions, 4462 flow [2022-07-22 21:49:23,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-22 21:49:23,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-07-22 21:49:23,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1935 transitions. [2022-07-22 21:49:23,528 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.5863636363636363 [2022-07-22 21:49:23,528 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1935 transitions. [2022-07-22 21:49:23,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1935 transitions. [2022-07-22 21:49:23,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:49:23,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1935 transitions. [2022-07-22 21:49:23,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 96.75) internal successors, (1935), 20 states have internal predecessors, (1935), 0 states have call successors, (0), 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:49:23,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 165.0) internal successors, (3465), 21 states have internal predecessors, (3465), 0 states have call successors, (0), 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:49:23,534 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 165.0) internal successors, (3465), 21 states have internal predecessors, (3465), 0 states have call successors, (0), 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:49:23,535 INFO L186 Difference]: Start difference. First operand has 346 places, 404 transitions, 3447 flow. Second operand 20 states and 1935 transitions. [2022-07-22 21:49:23,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 459 transitions, 4462 flow [2022-07-22 21:49:23,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 459 transitions, 4204 flow, removed 88 selfloop flow, removed 25 redundant places. [2022-07-22 21:49:23,939 INFO L242 Difference]: Finished difference. Result has 346 places, 417 transitions, 3646 flow [2022-07-22 21:49:23,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=3221, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3646, PETRI_PLACES=346, PETRI_TRANSITIONS=417} [2022-07-22 21:49:23,940 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 198 predicate places. [2022-07-22 21:49:23,940 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 417 transitions, 3646 flow [2022-07-22 21:49:23,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 95.35) internal successors, (1907), 20 states have internal predecessors, (1907), 0 states have call successors, (0), 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:49:23,940 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:49:23,941 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:23,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-22 21:49:24,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-22 21:49:24,141 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:49:24,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:49:24,142 INFO L85 PathProgramCache]: Analyzing trace with hash 676194937, now seen corresponding path program 6 times [2022-07-22 21:49:24,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:49:24,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096432178] [2022-07-22 21:49:24,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:49:24,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:49:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:49:24,502 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-22 21:49:24,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:49:24,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096432178] [2022-07-22 21:49:24,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096432178] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:49:24,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781754292] [2022-07-22 21:49:24,503 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-22 21:49:24,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:49:24,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:49:24,505 INFO L229 MonitoredProcess]: Starting monitored process 14 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:49:24,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-22 21:49:24,620 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-07-22 21:49:24,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 21:49:24,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 21:49:24,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:49:25,371 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-22 21:49:25,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:49:25,737 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-22 21:49:25,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781754292] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:49:25,738 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:49:25,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2022-07-22 21:49:25,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063959730] [2022-07-22 21:49:25,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:49:25,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-22 21:49:25,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:49:25,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-22 21:49:25,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-07-22 21:49:25,741 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 165 [2022-07-22 21:49:25,742 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 417 transitions, 3646 flow. Second operand has 19 states, 19 states have (on average 137.73684210526315) internal successors, (2617), 19 states have internal predecessors, (2617), 0 states have call successors, (0), 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:49:25,742 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:49:25,743 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 165 [2022-07-22 21:49:25,743 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:49:38,601 INFO L129 PetriNetUnfolder]: 14561/35912 cut-off events. [2022-07-22 21:49:38,601 INFO L130 PetriNetUnfolder]: For 218768/221216 co-relation queries the response was YES. [2022-07-22 21:49:39,009 INFO L84 FinitePrefix]: Finished finitePrefix Result has 161421 conditions, 35912 events. 14561/35912 cut-off events. For 218768/221216 co-relation queries the response was YES. Maximal size of possible extension queue 1459. Compared 412801 event pairs, 2561 based on Foata normal form. 319/35275 useless extension candidates. Maximal degree in co-relation 161354. Up to 8448 conditions per place. [2022-07-22 21:49:39,152 INFO L132 encePairwiseOnDemand]: 153/165 looper letters, 930 selfloop transitions, 215 changer transitions 30/1340 dead transitions. [2022-07-22 21:49:39,152 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 1340 transitions, 16897 flow [2022-07-22 21:49:39,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-07-22 21:49:39,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2022-07-22 21:49:39,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 7023 transitions. [2022-07-22 21:49:39,160 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8512727272727273 [2022-07-22 21:49:39,160 INFO L72 ComplementDD]: Start complementDD. Operand 50 states and 7023 transitions. [2022-07-22 21:49:39,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 7023 transitions. [2022-07-22 21:49:39,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:49:39,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 7023 transitions. [2022-07-22 21:49:39,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 51 states, 50 states have (on average 140.46) internal successors, (7023), 50 states have internal predecessors, (7023), 0 states have call successors, (0), 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:49:39,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 51 states, 51 states have (on average 165.0) internal successors, (8415), 51 states have internal predecessors, (8415), 0 states have call successors, (0), 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:49:39,181 INFO L81 ComplementDD]: Finished complementDD. Result has 51 states, 51 states have (on average 165.0) internal successors, (8415), 51 states have internal predecessors, (8415), 0 states have call successors, (0), 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:49:39,181 INFO L186 Difference]: Start difference. First operand has 346 places, 417 transitions, 3646 flow. Second operand 50 states and 7023 transitions. [2022-07-22 21:49:39,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 1340 transitions, 16897 flow [2022-07-22 21:49:40,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 1340 transitions, 16316 flow, removed 269 selfloop flow, removed 14 redundant places. [2022-07-22 21:49:40,743 INFO L242 Difference]: Finished difference. Result has 393 places, 596 transitions, 5553 flow [2022-07-22 21:49:40,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=3553, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=5553, PETRI_PLACES=393, PETRI_TRANSITIONS=596} [2022-07-22 21:49:40,744 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 245 predicate places. [2022-07-22 21:49:40,744 INFO L495 AbstractCegarLoop]: Abstraction has has 393 places, 596 transitions, 5553 flow [2022-07-22 21:49:40,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 137.73684210526315) internal successors, (2617), 19 states have internal predecessors, (2617), 0 states have call successors, (0), 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:49:40,744 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:49:40,744 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:40,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-22 21:49:40,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:49:40,945 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:49:40,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:49:40,946 INFO L85 PathProgramCache]: Analyzing trace with hash 257293073, now seen corresponding path program 7 times [2022-07-22 21:49:40,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:49:40,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916339897] [2022-07-22 21:49:40,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:49:40,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:49:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:49:41,328 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-22 21:49:41,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:49:41,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916339897] [2022-07-22 21:49:41,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916339897] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:49:41,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796108852] [2022-07-22 21:49:41,329 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-22 21:49:41,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:49:41,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:49:41,330 INFO L229 MonitoredProcess]: Starting monitored process 15 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:49:41,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-22 21:49:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:49:41,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 21:49:41,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:49:42,219 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-22 21:49:42,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:49:42,794 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-22 21:49:42,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796108852] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:49:42,794 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:49:42,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2022-07-22 21:49:42,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725884108] [2022-07-22 21:49:42,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:49:42,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-22 21:49:42,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:49:42,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-22 21:49:42,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2022-07-22 21:49:42,797 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 165 [2022-07-22 21:49:42,798 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 596 transitions, 5553 flow. Second operand has 21 states, 21 states have (on average 137.47619047619048) internal successors, (2887), 21 states have internal predecessors, (2887), 0 states have call successors, (0), 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:49:42,799 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:49:42,799 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 165 [2022-07-22 21:49:42,799 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:49:53,907 INFO L129 PetriNetUnfolder]: 13790/35012 cut-off events. [2022-07-22 21:49:53,907 INFO L130 PetriNetUnfolder]: For 266447/269084 co-relation queries the response was YES. [2022-07-22 21:49:54,472 INFO L84 FinitePrefix]: Finished finitePrefix Result has 181755 conditions, 35012 events. 13790/35012 cut-off events. For 266447/269084 co-relation queries the response was YES. Maximal size of possible extension queue 1473. Compared 407405 event pairs, 3273 based on Foata normal form. 126/34093 useless extension candidates. Maximal degree in co-relation 181676. Up to 18497 conditions per place. [2022-07-22 21:49:54,640 INFO L132 encePairwiseOnDemand]: 153/165 looper letters, 541 selfloop transitions, 148 changer transitions 46/900 dead transitions. [2022-07-22 21:49:54,640 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 900 transitions, 10471 flow [2022-07-22 21:49:54,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-22 21:49:54,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-07-22 21:49:54,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3343 transitions. [2022-07-22 21:49:54,643 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8441919191919192 [2022-07-22 21:49:54,643 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 3343 transitions. [2022-07-22 21:49:54,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 3343 transitions. [2022-07-22 21:49:54,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:49:54,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 3343 transitions. [2022-07-22 21:49:54,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 139.29166666666666) internal successors, (3343), 24 states have internal predecessors, (3343), 0 states have call successors, (0), 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:49:54,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 165.0) internal successors, (4125), 25 states have internal predecessors, (4125), 0 states have call successors, (0), 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:49:54,649 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 165.0) internal successors, (4125), 25 states have internal predecessors, (4125), 0 states have call successors, (0), 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:49:54,650 INFO L186 Difference]: Start difference. First operand has 393 places, 596 transitions, 5553 flow. Second operand 24 states and 3343 transitions. [2022-07-22 21:49:54,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 900 transitions, 10471 flow [2022-07-22 21:49:57,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 900 transitions, 9995 flow, removed 156 selfloop flow, removed 12 redundant places. [2022-07-22 21:49:57,505 INFO L242 Difference]: Finished difference. Result has 414 places, 637 transitions, 5932 flow [2022-07-22 21:49:57,506 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=5177, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=596, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=5932, PETRI_PLACES=414, PETRI_TRANSITIONS=637} [2022-07-22 21:49:57,507 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 266 predicate places. [2022-07-22 21:49:57,507 INFO L495 AbstractCegarLoop]: Abstraction has has 414 places, 637 transitions, 5932 flow [2022-07-22 21:49:57,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 137.47619047619048) internal successors, (2887), 21 states have internal predecessors, (2887), 0 states have call successors, (0), 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:49:57,507 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:49:57,508 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:57,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-07-22 21:49:57,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:49:57,714 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:49:57,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:49:57,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1903108831, now seen corresponding path program 8 times [2022-07-22 21:49:57,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:49:57,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755812166] [2022-07-22 21:49:57,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:49:57,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:49:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:49:58,072 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-22 21:49:58,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:49:58,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755812166] [2022-07-22 21:49:58,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755812166] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:49:58,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089109659] [2022-07-22 21:49:58,072 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 21:49:58,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:49:58,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:49:58,073 INFO L229 MonitoredProcess]: Starting monitored process 16 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:49:58,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-22 21:49:58,199 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 21:49:58,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 21:49:58,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 21:49:58,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:49:58,951 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-22 21:49:58,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:49:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-22 21:49:59,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089109659] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:49:59,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:49:59,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2022-07-22 21:49:59,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821346839] [2022-07-22 21:49:59,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:49:59,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-22 21:49:59,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:49:59,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-22 21:49:59,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-07-22 21:49:59,313 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 165 [2022-07-22 21:49:59,314 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 637 transitions, 5932 flow. Second operand has 19 states, 19 states have (on average 137.57894736842104) internal successors, (2614), 19 states have internal predecessors, (2614), 0 states have call successors, (0), 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:49:59,314 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:49:59,314 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 165 [2022-07-22 21:49:59,314 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:50:11,656 INFO L129 PetriNetUnfolder]: 14227/37203 cut-off events. [2022-07-22 21:50:11,657 INFO L130 PetriNetUnfolder]: For 258984/260454 co-relation queries the response was YES. [2022-07-22 21:50:12,682 INFO L84 FinitePrefix]: Finished finitePrefix Result has 189714 conditions, 37203 events. 14227/37203 cut-off events. For 258984/260454 co-relation queries the response was YES. Maximal size of possible extension queue 1530. Compared 446450 event pairs, 2322 based on Foata normal form. 159/36404 useless extension candidates. Maximal degree in co-relation 189633. Up to 10315 conditions per place. [2022-07-22 21:50:12,878 INFO L132 encePairwiseOnDemand]: 153/165 looper letters, 1004 selfloop transitions, 241 changer transitions 12/1422 dead transitions. [2022-07-22 21:50:12,878 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 1422 transitions, 18102 flow [2022-07-22 21:50:12,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-07-22 21:50:12,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2022-07-22 21:50:12,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 6734 transitions. [2022-07-22 21:50:12,884 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8502525252525253 [2022-07-22 21:50:12,884 INFO L72 ComplementDD]: Start complementDD. Operand 48 states and 6734 transitions. [2022-07-22 21:50:12,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 6734 transitions. [2022-07-22 21:50:12,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:50:12,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 6734 transitions. [2022-07-22 21:50:12,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 49 states, 48 states have (on average 140.29166666666666) internal successors, (6734), 48 states have internal predecessors, (6734), 0 states have call successors, (0), 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:50:12,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 49 states, 49 states have (on average 165.0) internal successors, (8085), 49 states have internal predecessors, (8085), 0 states have call successors, (0), 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:50:12,902 INFO L81 ComplementDD]: Finished complementDD. Result has 49 states, 49 states have (on average 165.0) internal successors, (8085), 49 states have internal predecessors, (8085), 0 states have call successors, (0), 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:50:12,902 INFO L186 Difference]: Start difference. First operand has 414 places, 637 transitions, 5932 flow. Second operand 48 states and 6734 transitions. [2022-07-22 21:50:12,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 1422 transitions, 18102 flow [2022-07-22 21:50:17,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 1422 transitions, 17869 flow, removed 18 selfloop flow, removed 4 redundant places. [2022-07-22 21:50:17,080 INFO L242 Difference]: Finished difference. Result has 465 places, 675 transitions, 6858 flow [2022-07-22 21:50:17,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=5857, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=637, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=210, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=6858, PETRI_PLACES=465, PETRI_TRANSITIONS=675} [2022-07-22 21:50:17,081 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, 317 predicate places. [2022-07-22 21:50:17,082 INFO L495 AbstractCegarLoop]: Abstraction has has 465 places, 675 transitions, 6858 flow [2022-07-22 21:50:17,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 137.57894736842104) internal successors, (2614), 19 states have internal predecessors, (2614), 0 states have call successors, (0), 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:50:17,082 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:50:17,083 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:17,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-22 21:50:17,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:50:17,299 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-22 21:50:17,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:50:17,300 INFO L85 PathProgramCache]: Analyzing trace with hash 2127835143, now seen corresponding path program 9 times [2022-07-22 21:50:17,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:50:17,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265549409] [2022-07-22 21:50:17,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:50:17,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:50:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:50:17,700 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-22 21:50:17,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:50:17,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265549409] [2022-07-22 21:50:17,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265549409] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:50:17,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492396523] [2022-07-22 21:50:17,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 21:50:17,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:50:17,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:50:17,701 INFO L229 MonitoredProcess]: Starting monitored process 17 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:50:17,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-22 21:50:17,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-22 21:50:17,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 21:50:17,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 21:50:17,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:50:18,654 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-22 21:50:18,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:50:19,293 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-22 21:50:19,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492396523] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:50:19,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:50:19,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2022-07-22 21:50:19,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799596778] [2022-07-22 21:50:19,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:50:19,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-22 21:50:19,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:50:19,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-22 21:50:19,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2022-07-22 21:50:19,296 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 165 [2022-07-22 21:50:19,297 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 465 places, 675 transitions, 6858 flow. Second operand has 21 states, 21 states have (on average 137.47619047619048) internal successors, (2887), 21 states have internal predecessors, (2887), 0 states have call successors, (0), 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:50:19,298 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:50:19,298 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 165 [2022-07-22 21:50:19,298 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand