/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-array-int-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 17:02:27,063 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 17:02:27,065 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 17:02:27,098 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 17:02:27,101 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 17:02:27,104 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 17:02:27,109 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 17:02:27,113 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 17:02:27,118 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 17:02:27,118 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 17:02:27,119 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 17:02:27,120 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 17:02:27,120 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 17:02:27,121 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 17:02:27,122 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 17:02:27,123 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 17:02:27,123 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 17:02:27,124 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 17:02:27,125 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 17:02:27,129 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 17:02:27,130 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 17:02:27,131 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 17:02:27,132 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 17:02:27,133 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 17:02:27,136 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 17:02:27,136 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 17:02:27,137 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 17:02:27,137 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 17:02:27,138 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 17:02:27,139 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 17:02:27,139 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 17:02:27,139 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 17:02:27,140 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 17:02:27,141 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 17:02:27,141 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 17:02:27,142 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 17:02:27,142 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 17:02:27,142 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 17:02:27,143 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 17:02:27,145 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 17:02:27,147 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 17:02:27,148 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-06 17:02:27,182 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 17:02:27,182 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 17:02:27,183 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-06 17:02:27,183 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-06 17:02:27,184 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 17:02:27,185 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 17:02:27,185 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 17:02:27,185 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 17:02:27,185 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 17:02:27,185 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 17:02:27,186 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 17:02:27,186 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 17:02:27,186 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 17:02:27,186 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 17:02:27,186 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 17:02:27,187 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 17:02:27,187 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 17:02:27,187 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 17:02:27,187 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 17:02:27,187 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 17:02:27,187 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 17:02:27,187 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 17:02:27,188 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 17:02:27,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 17:02:27,188 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 17:02:27,188 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 17:02:27,188 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 17:02:27,188 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 17:02:27,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 17:02:27,189 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-06 17:02:27,189 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-06 17:02:27,189 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.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 17:02:27,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 17:02:27,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 17:02:27,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 17:02:27,529 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 17:02:27,530 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 17:02:27,532 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-array-int-trans.wvr.c [2022-12-06 17:02:28,720 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 17:02:28,960 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 17:02:28,960 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-trans.wvr.c [2022-12-06 17:02:28,965 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1b304308/3672c5b460c7424ab9642b3df88e59cc/FLAG7a9401c4d [2022-12-06 17:02:28,978 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1b304308/3672c5b460c7424ab9642b3df88e59cc [2022-12-06 17:02:28,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 17:02:28,981 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 17:02:28,982 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 17:02:28,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 17:02:28,984 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 17:02:28,985 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:02:28" (1/1) ... [2022-12-06 17:02:28,985 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e3ebc72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:02:28, skipping insertion in model container [2022-12-06 17:02:28,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:02:28" (1/1) ... [2022-12-06 17:02:28,991 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 17:02:29,016 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 17:02:29,147 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-trans.wvr.c[2728,2741] [2022-12-06 17:02:29,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 17:02:29,162 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 17:02:29,182 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-trans.wvr.c[2728,2741] [2022-12-06 17:02:29,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 17:02:29,198 INFO L208 MainTranslator]: Completed translation [2022-12-06 17:02:29,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:02:29 WrapperNode [2022-12-06 17:02:29,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 17:02:29,199 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 17:02:29,200 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 17:02:29,200 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 17:02:29,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:02:29" (1/1) ... [2022-12-06 17:02:29,222 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:02:29" (1/1) ... [2022-12-06 17:02:29,265 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 13, calls inlined = 21, statements flattened = 277 [2022-12-06 17:02:29,265 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 17:02:29,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 17:02:29,266 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 17:02:29,266 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 17:02:29,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:02:29" (1/1) ... [2022-12-06 17:02:29,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:02:29" (1/1) ... [2022-12-06 17:02:29,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:02:29" (1/1) ... [2022-12-06 17:02:29,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:02:29" (1/1) ... [2022-12-06 17:02:29,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:02:29" (1/1) ... [2022-12-06 17:02:29,309 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:02:29" (1/1) ... [2022-12-06 17:02:29,310 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:02:29" (1/1) ... [2022-12-06 17:02:29,312 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:02:29" (1/1) ... [2022-12-06 17:02:29,314 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 17:02:29,315 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 17:02:29,315 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 17:02:29,315 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 17:02:29,316 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:02:29" (1/1) ... [2022-12-06 17:02:29,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 17:02:29,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:02:29,356 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-12-06 17:02:29,386 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-12-06 17:02:29,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 17:02:29,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 17:02:29,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 17:02:29,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 17:02:29,403 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 17:02:29,403 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 17:02:29,403 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 17:02:29,403 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 17:02:29,403 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 17:02:29,403 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 17:02:29,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 17:02:29,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 17:02:29,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 17:02:29,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 17:02:29,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 17:02:29,406 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 17:02:29,567 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 17:02:29,569 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 17:02:29,956 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 17:02:29,969 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 17:02:29,970 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 17:02:29,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:02:29 BoogieIcfgContainer [2022-12-06 17:02:29,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 17:02:29,974 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 17:02:29,974 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 17:02:29,977 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 17:02:29,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:02:28" (1/3) ... [2022-12-06 17:02:29,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f8f7d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:02:29, skipping insertion in model container [2022-12-06 17:02:29,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:02:29" (2/3) ... [2022-12-06 17:02:29,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f8f7d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:02:29, skipping insertion in model container [2022-12-06 17:02:29,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:02:29" (3/3) ... [2022-12-06 17:02:29,979 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-array-int-trans.wvr.c [2022-12-06 17:02:29,997 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 17:02:29,997 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 17:02:29,997 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 17:02:30,105 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 17:02:30,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 294 places, 312 transitions, 648 flow [2022-12-06 17:02:30,369 INFO L130 PetriNetUnfolder]: 28/309 cut-off events. [2022-12-06 17:02:30,369 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 17:02:30,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 309 events. 28/309 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 508 event pairs, 0 based on Foata normal form. 0/280 useless extension candidates. Maximal degree in co-relation 239. Up to 3 conditions per place. [2022-12-06 17:02:30,378 INFO L82 GeneralOperation]: Start removeDead. Operand has 294 places, 312 transitions, 648 flow [2022-12-06 17:02:30,389 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 281 places, 299 transitions, 616 flow [2022-12-06 17:02:30,397 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 17:02:30,403 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=false, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6b414a35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 17:02:30,403 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 17:02:30,464 INFO L130 PetriNetUnfolder]: 28/298 cut-off events. [2022-12-06 17:02:30,464 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 17:02:30,465 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:02:30,465 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:02:30,466 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:02:30,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:02:30,470 INFO L85 PathProgramCache]: Analyzing trace with hash 448297465, now seen corresponding path program 1 times [2022-12-06 17:02:30,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:02:30,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936389002] [2022-12-06 17:02:30,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:02:30,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:02:30,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:02:31,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:02:31,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:02:31,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936389002] [2022-12-06 17:02:31,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936389002] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:02:31,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:02:31,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 17:02:31,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697139943] [2022-12-06 17:02:31,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:02:31,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 17:02:31,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:02:31,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 17:02:31,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 17:02:31,355 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 312 [2022-12-06 17:02:31,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 299 transitions, 616 flow. Second operand has 7 states, 7 states have (on average 234.42857142857142) internal successors, (1641), 7 states have internal predecessors, (1641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:02:31,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:02:31,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 312 [2022-12-06 17:02:31,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:02:32,305 INFO L130 PetriNetUnfolder]: 631/4194 cut-off events. [2022-12-06 17:02:32,305 INFO L131 PetriNetUnfolder]: For 328/328 co-relation queries the response was YES. [2022-12-06 17:02:32,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5281 conditions, 4194 events. 631/4194 cut-off events. For 328/328 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 39820 event pairs, 114 based on Foata normal form. 250/3853 useless extension candidates. Maximal degree in co-relation 4796. Up to 334 conditions per place. [2022-12-06 17:02:32,342 INFO L137 encePairwiseOnDemand]: 277/312 looper letters, 95 selfloop transitions, 9 changer transitions 14/333 dead transitions. [2022-12-06 17:02:32,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 333 transitions, 956 flow [2022-12-06 17:02:32,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 17:02:32,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 17:02:32,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2435 transitions. [2022-12-06 17:02:32,363 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.780448717948718 [2022-12-06 17:02:32,369 INFO L294 CegarLoopForPetriNet]: 281 programPoint places, 9 predicate places. [2022-12-06 17:02:32,369 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 333 transitions, 956 flow [2022-12-06 17:02:32,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 234.42857142857142) internal successors, (1641), 7 states have internal predecessors, (1641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:02:32,371 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:02:32,371 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:02:32,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 17:02:32,372 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:02:32,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:02:32,374 INFO L85 PathProgramCache]: Analyzing trace with hash 924352763, now seen corresponding path program 2 times [2022-12-06 17:02:32,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:02:32,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539089927] [2022-12-06 17:02:32,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:02:32,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:02:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:02:32,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:02:32,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:02:32,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539089927] [2022-12-06 17:02:32,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539089927] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:02:32,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:02:32,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 17:02:32,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840705308] [2022-12-06 17:02:32,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:02:32,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 17:02:32,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:02:32,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 17:02:32,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 17:02:32,745 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 312 [2022-12-06 17:02:32,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 333 transitions, 956 flow. Second operand has 7 states, 7 states have (on average 234.42857142857142) internal successors, (1641), 7 states have internal predecessors, (1641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:02:32,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:02:32,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 312 [2022-12-06 17:02:32,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:02:33,606 INFO L130 PetriNetUnfolder]: 765/5149 cut-off events. [2022-12-06 17:02:33,606 INFO L131 PetriNetUnfolder]: For 927/3035 co-relation queries the response was YES. [2022-12-06 17:02:33,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7614 conditions, 5149 events. 765/5149 cut-off events. For 927/3035 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 52269 event pairs, 72 based on Foata normal form. 31/4448 useless extension candidates. Maximal degree in co-relation 5257. Up to 457 conditions per place. [2022-12-06 17:02:33,648 INFO L137 encePairwiseOnDemand]: 296/312 looper letters, 152 selfloop transitions, 16 changer transitions 23/406 dead transitions. [2022-12-06 17:02:33,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 406 transitions, 1675 flow [2022-12-06 17:02:33,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 17:02:33,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 17:02:33,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2386 transitions. [2022-12-06 17:02:33,655 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7647435897435897 [2022-12-06 17:02:33,657 INFO L294 CegarLoopForPetriNet]: 281 programPoint places, 18 predicate places. [2022-12-06 17:02:33,657 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 406 transitions, 1675 flow [2022-12-06 17:02:33,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 234.42857142857142) internal successors, (1641), 7 states have internal predecessors, (1641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:02:33,661 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:02:33,665 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:02:33,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 17:02:33,666 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:02:33,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:02:33,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1356203165, now seen corresponding path program 3 times [2022-12-06 17:02:33,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:02:33,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245867509] [2022-12-06 17:02:33,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:02:33,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:02:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:02:33,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:02:33,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:02:33,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245867509] [2022-12-06 17:02:33,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245867509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:02:33,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:02:33,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 17:02:33,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044188415] [2022-12-06 17:02:33,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:02:33,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 17:02:33,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:02:33,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 17:02:33,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 17:02:33,994 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 312 [2022-12-06 17:02:33,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 406 transitions, 1675 flow. Second operand has 7 states, 7 states have (on average 234.42857142857142) internal successors, (1641), 7 states have internal predecessors, (1641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:02:33,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:02:33,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 312 [2022-12-06 17:02:33,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:02:35,140 INFO L130 PetriNetUnfolder]: 967/6469 cut-off events. [2022-12-06 17:02:35,140 INFO L131 PetriNetUnfolder]: For 2637/10488 co-relation queries the response was YES. [2022-12-06 17:02:35,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10991 conditions, 6469 events. 967/6469 cut-off events. For 2637/10488 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 70243 event pairs, 102 based on Foata normal form. 86/5592 useless extension candidates. Maximal degree in co-relation 9942. Up to 654 conditions per place. [2022-12-06 17:02:35,185 INFO L137 encePairwiseOnDemand]: 296/312 looper letters, 178 selfloop transitions, 18 changer transitions 29/440 dead transitions. [2022-12-06 17:02:35,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 440 transitions, 2347 flow [2022-12-06 17:02:35,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 17:02:35,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 17:02:35,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2388 transitions. [2022-12-06 17:02:35,190 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7653846153846153 [2022-12-06 17:02:35,191 INFO L294 CegarLoopForPetriNet]: 281 programPoint places, 27 predicate places. [2022-12-06 17:02:35,191 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 440 transitions, 2347 flow [2022-12-06 17:02:35,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 234.42857142857142) internal successors, (1641), 7 states have internal predecessors, (1641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:02:35,192 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:02:35,193 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:02:35,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 17:02:35,193 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:02:35,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:02:35,193 INFO L85 PathProgramCache]: Analyzing trace with hash -129265469, now seen corresponding path program 4 times [2022-12-06 17:02:35,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:02:35,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870931128] [2022-12-06 17:02:35,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:02:35,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:02:35,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:02:35,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:02:35,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:02:35,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870931128] [2022-12-06 17:02:35,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870931128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:02:35,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:02:35,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 17:02:35,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689140298] [2022-12-06 17:02:35,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:02:35,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 17:02:35,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:02:35,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 17:02:35,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 17:02:35,429 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 312 [2022-12-06 17:02:35,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 440 transitions, 2347 flow. Second operand has 7 states, 7 states have (on average 234.42857142857142) internal successors, (1641), 7 states have internal predecessors, (1641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:02:35,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:02:35,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 312 [2022-12-06 17:02:35,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:02:36,464 INFO L130 PetriNetUnfolder]: 980/6570 cut-off events. [2022-12-06 17:02:36,464 INFO L131 PetriNetUnfolder]: For 4352/17345 co-relation queries the response was YES. [2022-12-06 17:02:36,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12749 conditions, 6570 events. 980/6570 cut-off events. For 4352/17345 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 69995 event pairs, 21 based on Foata normal form. 88/5700 useless extension candidates. Maximal degree in co-relation 11157. Up to 673 conditions per place. [2022-12-06 17:02:36,526 INFO L137 encePairwiseOnDemand]: 296/312 looper letters, 225 selfloop transitions, 25 changer transitions 38/503 dead transitions. [2022-12-06 17:02:36,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 503 transitions, 3478 flow [2022-12-06 17:02:36,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 17:02:36,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 17:02:36,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2388 transitions. [2022-12-06 17:02:36,532 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7653846153846153 [2022-12-06 17:02:36,533 INFO L294 CegarLoopForPetriNet]: 281 programPoint places, 36 predicate places. [2022-12-06 17:02:36,533 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 503 transitions, 3478 flow [2022-12-06 17:02:36,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 234.42857142857142) internal successors, (1641), 7 states have internal predecessors, (1641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:02:36,535 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:02:36,535 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:02:36,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 17:02:36,535 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:02:36,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:02:36,536 INFO L85 PathProgramCache]: Analyzing trace with hash 486824133, now seen corresponding path program 5 times [2022-12-06 17:02:36,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:02:36,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147202069] [2022-12-06 17:02:36,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:02:36,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:02:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:02:37,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:02:37,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:02:37,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147202069] [2022-12-06 17:02:37,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147202069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:02:37,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:02:37,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-12-06 17:02:37,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33963084] [2022-12-06 17:02:37,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:02:37,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 17:02:37,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:02:37,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 17:02:37,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-12-06 17:02:37,279 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 312 [2022-12-06 17:02:37,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 503 transitions, 3478 flow. Second operand has 18 states, 18 states have (on average 205.66666666666666) internal successors, (3702), 18 states have internal predecessors, (3702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:02:37,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:02:37,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 312 [2022-12-06 17:02:37,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:02:39,877 INFO L130 PetriNetUnfolder]: 1938/12697 cut-off events. [2022-12-06 17:02:39,877 INFO L131 PetriNetUnfolder]: For 12466/39480 co-relation queries the response was YES. [2022-12-06 17:02:39,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27699 conditions, 12697 events. 1938/12697 cut-off events. For 12466/39480 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 156904 event pairs, 110 based on Foata normal form. 79/10915 useless extension candidates. Maximal degree in co-relation 9386. Up to 1348 conditions per place. [2022-12-06 17:02:39,998 INFO L137 encePairwiseOnDemand]: 279/312 looper letters, 437 selfloop transitions, 44 changer transitions 80/761 dead transitions. [2022-12-06 17:02:39,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 761 transitions, 7236 flow [2022-12-06 17:02:39,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-06 17:02:39,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-06 17:02:40,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 6230 transitions. [2022-12-06 17:02:40,011 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6655982905982906 [2022-12-06 17:02:40,012 INFO L294 CegarLoopForPetriNet]: 281 programPoint places, 65 predicate places. [2022-12-06 17:02:40,012 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 761 transitions, 7236 flow [2022-12-06 17:02:40,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 205.66666666666666) internal successors, (3702), 18 states have internal predecessors, (3702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:02:40,014 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:02:40,015 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:02:40,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 17:02:40,015 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:02:40,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:02:40,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1107691657, now seen corresponding path program 6 times [2022-12-06 17:02:40,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:02:40,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499014229] [2022-12-06 17:02:40,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:02:40,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:02:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:02:40,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:02:40,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:02:40,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499014229] [2022-12-06 17:02:40,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499014229] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:02:40,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:02:40,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-12-06 17:02:40,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631322702] [2022-12-06 17:02:40,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:02:40,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 17:02:40,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:02:40,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 17:02:40,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-12-06 17:02:40,575 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 312 [2022-12-06 17:02:40,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 761 transitions, 7236 flow. Second operand has 15 states, 15 states have (on average 206.4) internal successors, (3096), 15 states have internal predecessors, (3096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:02:40,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:02:40,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 312 [2022-12-06 17:02:40,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:02:44,745 INFO L130 PetriNetUnfolder]: 3899/25835 cut-off events. [2022-12-06 17:02:44,745 INFO L131 PetriNetUnfolder]: For 34232/114723 co-relation queries the response was YES. [2022-12-06 17:02:44,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61119 conditions, 25835 events. 3899/25835 cut-off events. For 34232/114723 co-relation queries the response was YES. Maximal size of possible extension queue 699. Compared 361270 event pairs, 171 based on Foata normal form. 138/22191 useless extension candidates. Maximal degree in co-relation 13414. Up to 2693 conditions per place. [2022-12-06 17:02:44,943 INFO L137 encePairwiseOnDemand]: 283/312 looper letters, 838 selfloop transitions, 57 changer transitions 178/1284 dead transitions. [2022-12-06 17:02:44,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 1284 transitions, 15676 flow [2022-12-06 17:02:44,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 17:02:44,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 17:02:44,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 5242 transitions. [2022-12-06 17:02:44,953 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6720512820512821 [2022-12-06 17:02:44,954 INFO L294 CegarLoopForPetriNet]: 281 programPoint places, 89 predicate places. [2022-12-06 17:02:44,954 INFO L495 AbstractCegarLoop]: Abstraction has has 370 places, 1284 transitions, 15676 flow [2022-12-06 17:02:44,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 206.4) internal successors, (3096), 15 states have internal predecessors, (3096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:02:44,955 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:02:44,956 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:02:44,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 17:02:44,956 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:02:44,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:02:44,956 INFO L85 PathProgramCache]: Analyzing trace with hash -560338290, now seen corresponding path program 1 times [2022-12-06 17:02:44,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:02:44,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034643155] [2022-12-06 17:02:44,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:02:44,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:02:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:02:45,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:02:45,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:02:45,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034643155] [2022-12-06 17:02:45,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034643155] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:02:45,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752936863] [2022-12-06 17:02:45,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:02:45,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:02:45,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:02:45,288 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-12-06 17:02:45,294 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-12-06 17:02:45,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:02:45,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 17:02:45,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:02:45,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:02:45,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:02:46,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:02:46,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752936863] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 17:02:46,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 17:02:46,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 13] total 25 [2022-12-06 17:02:46,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711434969] [2022-12-06 17:02:46,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:02:46,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 17:02:46,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:02:46,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 17:02:46,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2022-12-06 17:02:46,230 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 312 [2022-12-06 17:02:46,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 1284 transitions, 15676 flow. Second operand has 13 states, 13 states have (on average 211.15384615384616) internal successors, (2745), 13 states have internal predecessors, (2745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:02:46,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:02:46,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 312 [2022-12-06 17:02:46,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:02:52,244 INFO L130 PetriNetUnfolder]: 5837/38753 cut-off events. [2022-12-06 17:02:52,244 INFO L131 PetriNetUnfolder]: For 64159/190373 co-relation queries the response was YES. [2022-12-06 17:02:52,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98786 conditions, 38753 events. 5837/38753 cut-off events. For 64159/190373 co-relation queries the response was YES. Maximal size of possible extension queue 1083. Compared 581458 event pairs, 384 based on Foata normal form. 187/33329 useless extension candidates. Maximal degree in co-relation 14467. Up to 5244 conditions per place. [2022-12-06 17:02:52,571 INFO L137 encePairwiseOnDemand]: 283/312 looper letters, 1117 selfloop transitions, 71 changer transitions 298/1744 dead transitions. [2022-12-06 17:02:52,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 1744 transitions, 25304 flow [2022-12-06 17:02:52,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-06 17:02:52,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-06 17:02:52,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4924 transitions. [2022-12-06 17:02:52,580 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6861761426978819 [2022-12-06 17:02:52,580 INFO L294 CegarLoopForPetriNet]: 281 programPoint places, 111 predicate places. [2022-12-06 17:02:52,581 INFO L495 AbstractCegarLoop]: Abstraction has has 392 places, 1744 transitions, 25304 flow [2022-12-06 17:02:52,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 211.15384615384616) internal successors, (2745), 13 states have internal predecessors, (2745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:02:52,582 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:02:52,582 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:02:52,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 17:02:52,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:02:52,790 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:02:52,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:02:52,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1337359206, now seen corresponding path program 1 times [2022-12-06 17:02:52,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:02:52,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996270984] [2022-12-06 17:02:52,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:02:52,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:02:52,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:02:53,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:02:53,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:02:53,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996270984] [2022-12-06 17:02:53,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996270984] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:02:53,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778639304] [2022-12-06 17:02:53,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:02:53,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:02:53,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:02:53,125 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-12-06 17:02:53,128 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-12-06 17:02:53,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:02:53,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 17:02:53,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:02:53,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:02:53,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:02:54,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:02:54,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778639304] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 17:02:54,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 17:02:54,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 13] total 29 [2022-12-06 17:02:54,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929197045] [2022-12-06 17:02:54,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:02:54,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 17:02:54,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:02:54,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 17:02:54,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2022-12-06 17:02:54,071 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 312 [2022-12-06 17:02:54,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 1744 transitions, 25304 flow. Second operand has 13 states, 13 states have (on average 211.15384615384616) internal successors, (2745), 13 states have internal predecessors, (2745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:02:54,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:02:54,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 312 [2022-12-06 17:02:54,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:03:00,259 INFO L130 PetriNetUnfolder]: 5737/36103 cut-off events. [2022-12-06 17:03:00,260 INFO L131 PetriNetUnfolder]: For 79668/245512 co-relation queries the response was YES. [2022-12-06 17:03:00,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103403 conditions, 36103 events. 5737/36103 cut-off events. For 79668/245512 co-relation queries the response was YES. Maximal size of possible extension queue 1062. Compared 537442 event pairs, 170 based on Foata normal form. 119/31005 useless extension candidates. Maximal degree in co-relation 15306. Up to 5244 conditions per place. [2022-12-06 17:03:00,531 INFO L137 encePairwiseOnDemand]: 279/312 looper letters, 1158 selfloop transitions, 75 changer transitions 329/1864 dead transitions. [2022-12-06 17:03:00,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 1864 transitions, 30358 flow [2022-12-06 17:03:00,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-06 17:03:00,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-06 17:03:00,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 6610 transitions. [2022-12-06 17:03:00,540 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6834160463192721 [2022-12-06 17:03:00,541 INFO L294 CegarLoopForPetriNet]: 281 programPoint places, 141 predicate places. [2022-12-06 17:03:00,541 INFO L495 AbstractCegarLoop]: Abstraction has has 422 places, 1864 transitions, 30358 flow [2022-12-06 17:03:00,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 211.15384615384616) internal successors, (2745), 13 states have internal predecessors, (2745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:03:00,542 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:03:00,542 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:03:00,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 17:03:00,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-06 17:03:00,748 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:03:00,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:03:00,749 INFO L85 PathProgramCache]: Analyzing trace with hash 150637783, now seen corresponding path program 1 times [2022-12-06 17:03:00,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:03:00,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062850149] [2022-12-06 17:03:00,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:03:00,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:03:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:03:01,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:03:01,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:03:01,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062850149] [2022-12-06 17:03:01,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062850149] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:03:01,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553474653] [2022-12-06 17:03:01,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:03:01,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:03:01,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:03:01,008 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-12-06 17:03:01,010 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-12-06 17:03:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:03:01,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 17:03:01,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:03:01,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:03:01,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:03:01,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:03:01,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553474653] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 17:03:01,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 17:03:01,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13, 11] total 23 [2022-12-06 17:03:01,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96181220] [2022-12-06 17:03:01,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:03:01,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 17:03:01,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:03:01,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 17:03:01,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-12-06 17:03:01,892 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 312 [2022-12-06 17:03:01,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 1864 transitions, 30358 flow. Second operand has 11 states, 11 states have (on average 234.45454545454547) internal successors, (2579), 11 states have internal predecessors, (2579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:03:01,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:03:01,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 312 [2022-12-06 17:03:01,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:03:12,905 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([869] L80-6-->L80-7: Formula: (= v_~res3~0_2 |v_thread3Thread1of1ForFork2_#t~ret17#1_5|) InVars {thread3Thread1of1ForFork2_#t~ret17#1=|v_thread3Thread1of1ForFork2_#t~ret17#1_5|} OutVars{thread3Thread1of1ForFork2_#t~ret17#1=|v_thread3Thread1of1ForFork2_#t~ret17#1_5|, ~res3~0=v_~res3~0_2} AuxVars[] AssignedVars[~res3~0][1476], [1434#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0)), thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, 316#true, thread1Thread1of1ForFork0InUse, 209#L66-7true, 435#true, 40#L102-4true, 297#true, 3415#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (and (<= 1 ~n1~0) (<= 1 ~n3~0))) (<= 1 ~n1~0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (and (<= 1 ~n1~0) (<= 1 ~n3~0))) (< |thread3Thread1of1ForFork2_~i~2#1| ~n3~0) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (and (<= 1 ~n1~0) (<= 1 ~n3~0))) (< |thread3Thread1of1ForFork2_~i~2#1| ~n1~0)), 420#(and (or (not (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))) (<= 0 ~n1~0) (or (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0))), 354#true, 335#true, 198#L52-7true, 2163#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n1~0 (+ ~n2~0 1))), 89#L80-7true]) [2022-12-06 17:03:12,905 INFO L382 tUnfolder$Statistics]: this new event has 200 ancestors and is cut-off event [2022-12-06 17:03:12,905 INFO L385 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-12-06 17:03:12,905 INFO L385 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-12-06 17:03:12,905 INFO L385 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-12-06 17:03:13,060 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([869] L80-6-->L80-7: Formula: (= v_~res3~0_2 |v_thread3Thread1of1ForFork2_#t~ret17#1_5|) InVars {thread3Thread1of1ForFork2_#t~ret17#1=|v_thread3Thread1of1ForFork2_#t~ret17#1_5|} OutVars{thread3Thread1of1ForFork2_#t~ret17#1=|v_thread3Thread1of1ForFork2_#t~ret17#1_5|, ~res3~0=v_~res3~0_2} AuxVars[] AssignedVars[~res3~0][1751], [3417#(and (<= 1 ~n1~0) (<= 1 ~n3~0) (< |thread3Thread1of1ForFork2_~i~2#1| ~n3~0) (< |thread3Thread1of1ForFork2_~i~2#1| ~n1~0)), thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, 316#true, thread1Thread1of1ForFork0InUse, 1428#(and (<= 1 ~n1~0) (or (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n3~0 1) ~n1~0)) (or (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ ~n3~0 1) ~n1~0))), 209#L66-7true, 435#true, 40#L102-4true, 297#true, 420#(and (or (not (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))) (<= 0 ~n1~0) (or (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0))), 335#true, 354#true, 198#L52-7true, 2163#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n1~0 (+ ~n2~0 1))), 89#L80-7true]) [2022-12-06 17:03:13,060 INFO L382 tUnfolder$Statistics]: this new event has 207 ancestors and is cut-off event [2022-12-06 17:03:13,060 INFO L385 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-12-06 17:03:13,060 INFO L385 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-12-06 17:03:13,060 INFO L385 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-12-06 17:03:13,061 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([832] L78-2-->L78-3: Formula: (or (not (< |v_thread3Thread1of1ForFork2_~i~2#1_5| v_~n3~0_5)) (not (< |v_thread3Thread1of1ForFork2_~i~2#1_5| v_~n1~0_5))) InVars {~n3~0=v_~n3~0_5, ~n1~0=v_~n1~0_5, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_5|} OutVars{~n3~0=v_~n3~0_5, ~n1~0=v_~n1~0_5, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_5|} AuxVars[] AssignedVars[][1838], [thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, 2440#(and (<= 1 ~n1~0) (<= 1 ~n3~0)), thread1Thread1of1ForFork0InUse, 1428#(and (<= 1 ~n1~0) (or (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n3~0 1) ~n1~0)) (or (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ ~n3~0 1) ~n1~0))), 36#L78-3true, 209#L66-7true, 435#true, 40#L102-4true, 297#true, 420#(and (or (not (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))) (<= 0 ~n1~0) (or (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0))), 335#true, 354#true, 198#L52-7true, 318#(<= ~n1~0 (+ ~res3~0 ~n3~0)), 2163#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n1~0 (+ ~n2~0 1)))]) [2022-12-06 17:03:13,061 INFO L382 tUnfolder$Statistics]: this new event has 192 ancestors and is cut-off event [2022-12-06 17:03:13,061 INFO L385 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-12-06 17:03:13,061 INFO L385 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-12-06 17:03:13,061 INFO L385 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-12-06 17:03:13,062 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([831] L78-2-->L79: Formula: (and (< |v_thread3Thread1of1ForFork2_~i~2#1_3| v_~n3~0_6) (< |v_thread3Thread1of1ForFork2_~i~2#1_3| v_~n1~0_6)) InVars {~n3~0=v_~n3~0_6, ~n1~0=v_~n1~0_6, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_3|} OutVars{~n3~0=v_~n3~0_6, ~n1~0=v_~n1~0_6, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_3|} AuxVars[] AssignedVars[][1839], [3417#(and (<= 1 ~n1~0) (<= 1 ~n3~0) (< |thread3Thread1of1ForFork2_~i~2#1| ~n3~0) (< |thread3Thread1of1ForFork2_~i~2#1| ~n1~0)), thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0InUse, 1428#(and (<= 1 ~n1~0) (or (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n3~0 1) ~n1~0)) (or (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ ~n3~0 1) ~n1~0))), 71#L79true, 209#L66-7true, 435#true, 40#L102-4true, 297#true, 420#(and (or (not (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))) (<= 0 ~n1~0) (or (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0))), 354#true, 335#true, 198#L52-7true, 318#(<= ~n1~0 (+ ~res3~0 ~n3~0)), 2163#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n1~0 (+ ~n2~0 1)))]) [2022-12-06 17:03:13,062 INFO L382 tUnfolder$Statistics]: this new event has 192 ancestors and is cut-off event [2022-12-06 17:03:13,062 INFO L385 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-12-06 17:03:13,062 INFO L385 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-12-06 17:03:13,062 INFO L385 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-12-06 17:03:13,090 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([879] thread1EXIT-->L103-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem31#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][1789], [thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0NotInUse, 209#L66-7true, 253#L103-2true, 435#true, 265#L80-2true, 297#true, 420#(and (or (not (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))) (<= 0 ~n1~0) (or (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0))), 3415#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (and (<= 1 ~n1~0) (<= 1 ~n3~0))) (<= 1 ~n1~0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (and (<= 1 ~n1~0) (<= 1 ~n3~0))) (< |thread3Thread1of1ForFork2_~i~2#1| ~n3~0) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (and (<= 1 ~n1~0) (<= 1 ~n3~0))) (< |thread3Thread1of1ForFork2_~i~2#1| ~n1~0)), 1436#(and (<= 1 ~n1~0) (<= 1 ~res3~0) (<= (+ ~n3~0 1) ~n1~0)), 354#true, 335#true, 318#(<= ~n1~0 (+ ~res3~0 ~n3~0)), 2163#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n1~0 (+ ~n2~0 1)))]) [2022-12-06 17:03:13,090 INFO L382 tUnfolder$Statistics]: this new event has 192 ancestors and is cut-off event [2022-12-06 17:03:13,090 INFO L385 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-12-06 17:03:13,090 INFO L385 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-12-06 17:03:13,090 INFO L385 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-12-06 17:03:13,186 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([879] thread1EXIT-->L103-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem31#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][1916], [3417#(and (<= 1 ~n1~0) (<= 1 ~n3~0) (< |thread3Thread1of1ForFork2_~i~2#1| ~n3~0) (< |thread3Thread1of1ForFork2_~i~2#1| ~n1~0)), thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0NotInUse, 1428#(and (<= 1 ~n1~0) (or (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n3~0 1) ~n1~0)) (or (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ ~n3~0 1) ~n1~0))), 209#L66-7true, 265#L80-2true, 253#L103-2true, 435#true, 297#true, 420#(and (or (not (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))) (<= 0 ~n1~0) (or (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0))), 354#true, 335#true, 318#(<= ~n1~0 (+ ~res3~0 ~n3~0)), 2163#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n1~0 (+ ~n2~0 1)))]) [2022-12-06 17:03:13,187 INFO L382 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-12-06 17:03:13,187 INFO L385 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-12-06 17:03:13,187 INFO L385 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-12-06 17:03:13,187 INFO L385 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-12-06 17:03:13,187 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([879] thread1EXIT-->L103-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem31#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][1931], [thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0NotInUse, 2440#(and (<= 1 ~n1~0) (<= 1 ~n3~0)), 1428#(and (<= 1 ~n1~0) (or (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n3~0 1) ~n1~0)) (or (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ ~n3~0 1) ~n1~0))), 209#L66-7true, 158#L83-2true, 253#L103-2true, 435#true, 297#true, 420#(and (or (not (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))) (<= 0 ~n1~0) (or (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0))), 335#true, 354#true, 318#(<= ~n1~0 (+ ~res3~0 ~n3~0)), 2163#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n1~0 (+ ~n2~0 1)))]) [2022-12-06 17:03:13,188 INFO L382 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-12-06 17:03:13,188 INFO L385 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-12-06 17:03:13,188 INFO L385 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-12-06 17:03:13,188 INFO L385 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-12-06 17:03:13,310 INFO L130 PetriNetUnfolder]: 13570/66502 cut-off events. [2022-12-06 17:03:13,310 INFO L131 PetriNetUnfolder]: For 273270/485573 co-relation queries the response was YES. [2022-12-06 17:03:13,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214069 conditions, 66502 events. 13570/66502 cut-off events. For 273270/485573 co-relation queries the response was YES. Maximal size of possible extension queue 1908. Compared 1043003 event pairs, 1994 based on Foata normal form. 141/56732 useless extension candidates. Maximal degree in co-relation 34361. Up to 10491 conditions per place. [2022-12-06 17:03:14,050 INFO L137 encePairwiseOnDemand]: 294/312 looper letters, 1459 selfloop transitions, 115 changer transitions 345/2470 dead transitions. [2022-12-06 17:03:14,051 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 2470 transitions, 44930 flow [2022-12-06 17:03:14,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 17:03:14,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 17:03:14,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 4303 transitions. [2022-12-06 17:03:14,056 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7662037037037037 [2022-12-06 17:03:14,057 INFO L294 CegarLoopForPetriNet]: 281 programPoint places, 158 predicate places. [2022-12-06 17:03:14,058 INFO L495 AbstractCegarLoop]: Abstraction has has 439 places, 2470 transitions, 44930 flow [2022-12-06 17:03:14,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 234.45454545454547) internal successors, (2579), 11 states have internal predecessors, (2579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:03:14,059 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:03:14,059 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:03:14,067 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-12-06 17:03:14,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:03:14,264 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:03:14,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:03:14,265 INFO L85 PathProgramCache]: Analyzing trace with hash 360231936, now seen corresponding path program 1 times [2022-12-06 17:03:14,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:03:14,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431190129] [2022-12-06 17:03:14,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:03:14,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:03:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:03:14,563 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 17:03:14,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:03:14,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431190129] [2022-12-06 17:03:14,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431190129] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:03:14,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710140563] [2022-12-06 17:03:14,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:03:14,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:03:14,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:03:14,566 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-12-06 17:03:14,568 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-12-06 17:03:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:03:14,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 17:03:14,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:03:15,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 17:03:15,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:03:15,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 17:03:15,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710140563] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:03:15,352 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:03:15,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 29 [2022-12-06 17:03:15,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105822992] [2022-12-06 17:03:15,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:03:15,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-06 17:03:15,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:03:15,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-06 17:03:15,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2022-12-06 17:03:15,358 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 312 [2022-12-06 17:03:15,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 2470 transitions, 44930 flow. Second operand has 29 states, 29 states have (on average 207.31034482758622) internal successors, (6012), 29 states have internal predecessors, (6012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:03:15,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:03:15,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 312 [2022-12-06 17:03:15,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:03:29,546 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([869] L80-6-->L80-7: Formula: (= v_~res3~0_2 |v_thread3Thread1of1ForFork2_#t~ret17#1_5|) InVars {thread3Thread1of1ForFork2_#t~ret17#1=|v_thread3Thread1of1ForFork2_#t~ret17#1_5|} OutVars{thread3Thread1of1ForFork2_#t~ret17#1=|v_thread3Thread1of1ForFork2_#t~ret17#1_5|, ~res3~0=v_~res3~0_2} AuxVars[] AssignedVars[~res3~0][2008], [1434#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0)), thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, 316#true, thread1Thread1of1ForFork0InUse, 209#L66-7true, 4488#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), 435#true, 40#L102-4true, 297#true, 420#(and (or (not (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))) (<= 0 ~n1~0) (or (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0))), 3415#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (and (<= 1 ~n1~0) (<= 1 ~n3~0))) (<= 1 ~n1~0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (and (<= 1 ~n1~0) (<= 1 ~n3~0))) (< |thread3Thread1of1ForFork2_~i~2#1| ~n3~0) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (and (<= 1 ~n1~0) (<= 1 ~n3~0))) (< |thread3Thread1of1ForFork2_~i~2#1| ~n1~0)), 335#true, 354#true, 198#L52-7true, 2163#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n1~0 (+ ~n2~0 1))), 89#L80-7true]) [2022-12-06 17:03:29,546 INFO L382 tUnfolder$Statistics]: this new event has 200 ancestors and is cut-off event [2022-12-06 17:03:29,546 INFO L385 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-12-06 17:03:29,546 INFO L385 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-12-06 17:03:29,546 INFO L385 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-12-06 17:03:29,733 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([869] L80-6-->L80-7: Formula: (= v_~res3~0_2 |v_thread3Thread1of1ForFork2_#t~ret17#1_5|) InVars {thread3Thread1of1ForFork2_#t~ret17#1=|v_thread3Thread1of1ForFork2_#t~ret17#1_5|} OutVars{thread3Thread1of1ForFork2_#t~ret17#1=|v_thread3Thread1of1ForFork2_#t~ret17#1_5|, ~res3~0=v_~res3~0_2} AuxVars[] AssignedVars[~res3~0][2334], [3417#(and (<= 1 ~n1~0) (<= 1 ~n3~0) (< |thread3Thread1of1ForFork2_~i~2#1| ~n3~0) (< |thread3Thread1of1ForFork2_~i~2#1| ~n1~0)), thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, 316#true, thread1Thread1of1ForFork0InUse, 1428#(and (<= 1 ~n1~0) (or (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n3~0 1) ~n1~0)) (or (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ ~n3~0 1) ~n1~0))), 4492#(and (<= 1 ~n3~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), 209#L66-7true, 435#true, 40#L102-4true, 297#true, 420#(and (or (not (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))) (<= 0 ~n1~0) (or (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0))), 335#true, 354#true, 198#L52-7true, 2163#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n1~0 (+ ~n2~0 1))), 89#L80-7true]) [2022-12-06 17:03:29,733 INFO L382 tUnfolder$Statistics]: this new event has 207 ancestors and is cut-off event [2022-12-06 17:03:29,733 INFO L385 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-12-06 17:03:29,733 INFO L385 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-12-06 17:03:29,733 INFO L385 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-12-06 17:03:29,735 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([832] L78-2-->L78-3: Formula: (or (not (< |v_thread3Thread1of1ForFork2_~i~2#1_5| v_~n3~0_5)) (not (< |v_thread3Thread1of1ForFork2_~i~2#1_5| v_~n1~0_5))) InVars {~n3~0=v_~n3~0_5, ~n1~0=v_~n1~0_5, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_5|} OutVars{~n3~0=v_~n3~0_5, ~n1~0=v_~n1~0_5, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_5|} AuxVars[] AssignedVars[][2916], [thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0InUse, 2440#(and (<= 1 ~n1~0) (<= 1 ~n3~0)), 1428#(and (<= 1 ~n1~0) (or (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n3~0 1) ~n1~0)) (or (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ ~n3~0 1) ~n1~0))), 36#L78-3true, 4492#(and (<= 1 ~n3~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), 209#L66-7true, 435#true, 40#L102-4true, 297#true, 420#(and (or (not (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))) (<= 0 ~n1~0) (or (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0))), 335#true, 354#true, 198#L52-7true, 318#(<= ~n1~0 (+ ~res3~0 ~n3~0)), 2163#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n1~0 (+ ~n2~0 1)))]) [2022-12-06 17:03:29,735 INFO L382 tUnfolder$Statistics]: this new event has 192 ancestors and is cut-off event [2022-12-06 17:03:29,735 INFO L385 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-12-06 17:03:29,735 INFO L385 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-12-06 17:03:29,735 INFO L385 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-12-06 17:03:29,735 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([831] L78-2-->L79: Formula: (and (< |v_thread3Thread1of1ForFork2_~i~2#1_3| v_~n3~0_6) (< |v_thread3Thread1of1ForFork2_~i~2#1_3| v_~n1~0_6)) InVars {~n3~0=v_~n3~0_6, ~n1~0=v_~n1~0_6, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_3|} OutVars{~n3~0=v_~n3~0_6, ~n1~0=v_~n1~0_6, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_3|} AuxVars[] AssignedVars[][2917], [3417#(and (<= 1 ~n1~0) (<= 1 ~n3~0) (< |thread3Thread1of1ForFork2_~i~2#1| ~n3~0) (< |thread3Thread1of1ForFork2_~i~2#1| ~n1~0)), thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0InUse, 1428#(and (<= 1 ~n1~0) (or (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n3~0 1) ~n1~0)) (or (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ ~n3~0 1) ~n1~0))), 71#L79true, 4492#(and (<= 1 ~n3~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), 209#L66-7true, 435#true, 40#L102-4true, 297#true, 420#(and (or (not (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))) (<= 0 ~n1~0) (or (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0))), 335#true, 354#true, 198#L52-7true, 318#(<= ~n1~0 (+ ~res3~0 ~n3~0)), 2163#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n1~0 (+ ~n2~0 1)))]) [2022-12-06 17:03:29,735 INFO L382 tUnfolder$Statistics]: this new event has 192 ancestors and is cut-off event [2022-12-06 17:03:29,735 INFO L385 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-12-06 17:03:29,735 INFO L385 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-12-06 17:03:29,735 INFO L385 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-12-06 17:03:29,763 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([879] thread1EXIT-->L103-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem31#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][2840], [thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0NotInUse, 209#L66-7true, 4488#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), 253#L103-2true, 435#true, 265#L80-2true, 297#true, 420#(and (or (not (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))) (<= 0 ~n1~0) (or (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0))), 3415#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (and (<= 1 ~n1~0) (<= 1 ~n3~0))) (<= 1 ~n1~0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (and (<= 1 ~n1~0) (<= 1 ~n3~0))) (< |thread3Thread1of1ForFork2_~i~2#1| ~n3~0) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (and (<= 1 ~n1~0) (<= 1 ~n3~0))) (< |thread3Thread1of1ForFork2_~i~2#1| ~n1~0)), 1436#(and (<= 1 ~n1~0) (<= 1 ~res3~0) (<= (+ ~n3~0 1) ~n1~0)), 354#true, 335#true, 318#(<= ~n1~0 (+ ~res3~0 ~n3~0)), 2163#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n1~0 (+ ~n2~0 1)))]) [2022-12-06 17:03:29,764 INFO L382 tUnfolder$Statistics]: this new event has 192 ancestors and is cut-off event [2022-12-06 17:03:29,764 INFO L385 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-12-06 17:03:29,764 INFO L385 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-12-06 17:03:29,764 INFO L385 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-12-06 17:03:29,852 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([832] L78-2-->L78-3: Formula: (or (not (< |v_thread3Thread1of1ForFork2_~i~2#1_5| v_~n3~0_5)) (not (< |v_thread3Thread1of1ForFork2_~i~2#1_5| v_~n1~0_5))) InVars {~n3~0=v_~n3~0_5, ~n1~0=v_~n1~0_5, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_5|} OutVars{~n3~0=v_~n3~0_5, ~n1~0=v_~n1~0_5, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_5|} AuxVars[] AssignedVars[][2966], [thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0InUse, 2440#(and (<= 1 ~n1~0) (<= 1 ~n3~0)), 1428#(and (<= 1 ~n1~0) (or (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n3~0 1) ~n1~0)) (or (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ ~n3~0 1) ~n1~0))), 36#L78-3true, 4145#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))), 209#L66-7true, 435#true, 40#L102-4true, 297#true, 335#true, 354#true, 198#L52-7true, 318#(<= ~n1~0 (+ ~res3~0 ~n3~0)), 2163#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n1~0 (+ ~n2~0 1))), 379#(<= 0 ~n1~0)]) [2022-12-06 17:03:29,852 INFO L382 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-12-06 17:03:29,852 INFO L385 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-12-06 17:03:29,852 INFO L385 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-12-06 17:03:29,852 INFO L385 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-12-06 17:03:29,852 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([831] L78-2-->L79: Formula: (and (< |v_thread3Thread1of1ForFork2_~i~2#1_3| v_~n3~0_6) (< |v_thread3Thread1of1ForFork2_~i~2#1_3| v_~n1~0_6)) InVars {~n3~0=v_~n3~0_6, ~n1~0=v_~n1~0_6, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_3|} OutVars{~n3~0=v_~n3~0_6, ~n1~0=v_~n1~0_6, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_3|} AuxVars[] AssignedVars[][2967], [3417#(and (<= 1 ~n1~0) (<= 1 ~n3~0) (< |thread3Thread1of1ForFork2_~i~2#1| ~n3~0) (< |thread3Thread1of1ForFork2_~i~2#1| ~n1~0)), thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0InUse, 1428#(and (<= 1 ~n1~0) (or (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n3~0 1) ~n1~0)) (or (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ ~n3~0 1) ~n1~0))), 71#L79true, 4145#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))), 209#L66-7true, 435#true, 40#L102-4true, 297#true, 335#true, 354#true, 198#L52-7true, 318#(<= ~n1~0 (+ ~res3~0 ~n3~0)), 2163#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n1~0 (+ ~n2~0 1))), 379#(<= 0 ~n1~0)]) [2022-12-06 17:03:29,852 INFO L382 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-12-06 17:03:29,852 INFO L385 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-12-06 17:03:29,852 INFO L385 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-12-06 17:03:29,853 INFO L385 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-12-06 17:03:29,872 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([879] thread1EXIT-->L103-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem31#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][2908], [3417#(and (<= 1 ~n1~0) (<= 1 ~n3~0) (< |thread3Thread1of1ForFork2_~i~2#1| ~n3~0) (< |thread3Thread1of1ForFork2_~i~2#1| ~n1~0)), thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0NotInUse, 1428#(and (<= 1 ~n1~0) (or (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n3~0 1) ~n1~0)) (or (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ ~n3~0 1) ~n1~0))), 4492#(and (<= 1 ~n3~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), 209#L66-7true, 253#L103-2true, 435#true, 265#L80-2true, 297#true, 420#(and (or (not (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))) (<= 0 ~n1~0) (or (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0))), 335#true, 354#true, 318#(<= ~n1~0 (+ ~res3~0 ~n3~0)), 2163#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n1~0 (+ ~n2~0 1)))]) [2022-12-06 17:03:29,872 INFO L382 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-12-06 17:03:29,872 INFO L385 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-12-06 17:03:29,872 INFO L385 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-12-06 17:03:29,872 INFO L385 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-12-06 17:03:29,873 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([879] thread1EXIT-->L103-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem31#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][2915], [thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0NotInUse, 2440#(and (<= 1 ~n1~0) (<= 1 ~n3~0)), 1428#(and (<= 1 ~n1~0) (or (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n3~0 1) ~n1~0)) (or (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ ~n3~0 1) ~n1~0))), 4492#(and (<= 1 ~n3~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), 209#L66-7true, 158#L83-2true, 253#L103-2true, 435#true, 297#true, 420#(and (or (not (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))) (<= 0 ~n1~0) (or (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0))), 335#true, 354#true, 318#(<= ~n1~0 (+ ~res3~0 ~n3~0)), 2163#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n1~0 (+ ~n2~0 1)))]) [2022-12-06 17:03:29,873 INFO L382 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-12-06 17:03:29,873 INFO L385 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-12-06 17:03:29,873 INFO L385 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-12-06 17:03:29,873 INFO L385 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-12-06 17:03:29,948 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([879] thread1EXIT-->L103-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem31#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][2965], [thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0NotInUse, 2440#(and (<= 1 ~n1~0) (<= 1 ~n3~0)), 1428#(and (<= 1 ~n1~0) (or (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n3~0 1) ~n1~0)) (or (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ ~n3~0 1) ~n1~0))), 209#L66-7true, 4145#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))), 158#L83-2true, 253#L103-2true, 435#true, 297#true, 354#true, 335#true, 318#(<= ~n1~0 (+ ~res3~0 ~n3~0)), 2163#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n1~0 (+ ~n2~0 1))), 379#(<= 0 ~n1~0)]) [2022-12-06 17:03:29,948 INFO L382 tUnfolder$Statistics]: this new event has 206 ancestors and is cut-off event [2022-12-06 17:03:29,948 INFO L385 tUnfolder$Statistics]: existing Event has 206 ancestors and is cut-off event [2022-12-06 17:03:29,948 INFO L385 tUnfolder$Statistics]: existing Event has 206 ancestors and is cut-off event [2022-12-06 17:03:29,948 INFO L385 tUnfolder$Statistics]: existing Event has 206 ancestors and is cut-off event [2022-12-06 17:03:30,053 INFO L130 PetriNetUnfolder]: 16162/78876 cut-off events. [2022-12-06 17:03:30,054 INFO L131 PetriNetUnfolder]: For 400538/742981 co-relation queries the response was YES. [2022-12-06 17:03:30,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275637 conditions, 78876 events. 16162/78876 cut-off events. For 400538/742981 co-relation queries the response was YES. Maximal size of possible extension queue 2362. Compared 1271493 event pairs, 2463 based on Foata normal form. 484/67650 useless extension candidates. Maximal degree in co-relation 37698. Up to 10875 conditions per place. [2022-12-06 17:03:30,891 INFO L137 encePairwiseOnDemand]: 278/312 looper letters, 2334 selfloop transitions, 173 changer transitions 474/3185 dead transitions. [2022-12-06 17:03:30,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 3185 transitions, 64916 flow [2022-12-06 17:03:30,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-06 17:03:30,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-06 17:03:30,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 7081 transitions. [2022-12-06 17:03:30,899 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6675150829562594 [2022-12-06 17:03:30,900 INFO L294 CegarLoopForPetriNet]: 281 programPoint places, 191 predicate places. [2022-12-06 17:03:30,900 INFO L495 AbstractCegarLoop]: Abstraction has has 472 places, 3185 transitions, 64916 flow [2022-12-06 17:03:30,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 207.31034482758622) internal successors, (6012), 29 states have internal predecessors, (6012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:03:30,902 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:03:30,903 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:03:30,911 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-12-06 17:03:31,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:03:31,112 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:03:31,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:03:31,112 INFO L85 PathProgramCache]: Analyzing trace with hash 106580381, now seen corresponding path program 1 times [2022-12-06 17:03:31,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:03:31,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257168308] [2022-12-06 17:03:31,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:03:31,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:03:31,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:03:31,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:03:31,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:03:31,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257168308] [2022-12-06 17:03:31,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257168308] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:03:31,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:03:31,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 17:03:31,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002751146] [2022-12-06 17:03:31,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:03:31,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 17:03:31,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:03:31,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 17:03:31,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 17:03:31,259 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 312 [2022-12-06 17:03:31,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 3185 transitions, 64916 flow. Second operand has 7 states, 7 states have (on average 240.85714285714286) internal successors, (1686), 7 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:03:31,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:03:31,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 312 [2022-12-06 17:03:31,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:03:44,247 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([830] L77-->L78-2: Formula: (= v_~n1~0_4 (+ v_~n3~0_4 v_~res3~0_1)) InVars {~n3~0=v_~n3~0_4, ~n1~0=v_~n1~0_4} OutVars{~n3~0=v_~n3~0_4, ~n1~0=v_~n1~0_4, ~res3~0=v_~res3~0_1} AuxVars[] AssignedVars[~res3~0][1811], [thread2Thread1of1ForFork1InUse, 299#(<= (+ ~res1~0 ~n2~0) ~n1~0), thread3Thread1of1ForFork2InUse, 110#L78-2true, thread1Thread1of1ForFork0InUse, 343#(and (<= (+ ~res1~0 ~n2~0) (+ ~res3~0 ~n3~0)) (<= (+ ~res1~0 ~n2~0) ~n1~0)), 209#L66-7true, 4488#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), 435#true, 40#L102-4true, 3411#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (and (<= 1 ~n1~0) (<= 1 ~n3~0))) (<= 1 ~n1~0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (and (<= 1 ~n1~0) (<= 1 ~n3~0))) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (and (<= 1 ~n1~0) (<= 1 ~n3~0)))), 236#L51-2true, 1436#(and (<= 1 ~n1~0) (<= 1 ~res3~0) (<= (+ ~n3~0 1) ~n1~0)), 420#(and (or (not (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))) (<= 0 ~n1~0) (or (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0))), 354#true, 4503#true, 318#(<= ~n1~0 (+ ~res3~0 ~n3~0)), 2163#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n1~0 (+ ~n2~0 1)))]) [2022-12-06 17:03:44,248 INFO L382 tUnfolder$Statistics]: this new event has 153 ancestors and is cut-off event [2022-12-06 17:03:44,248 INFO L385 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-12-06 17:03:44,248 INFO L385 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-12-06 17:03:44,248 INFO L385 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-12-06 17:03:45,944 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([830] L77-->L78-2: Formula: (= v_~n1~0_4 (+ v_~n3~0_4 v_~res3~0_1)) InVars {~n3~0=v_~n3~0_4, ~n1~0=v_~n1~0_4} OutVars{~n3~0=v_~n3~0_4, ~n1~0=v_~n1~0_4, ~res3~0=v_~res3~0_1} AuxVars[] AssignedVars[~res3~0][1811], [thread2Thread1of1ForFork1InUse, 299#(<= (+ ~res1~0 ~n2~0) ~n1~0), thread3Thread1of1ForFork2InUse, 110#L78-2true, thread1Thread1of1ForFork0InUse, 343#(and (<= (+ ~res1~0 ~n2~0) (+ ~res3~0 ~n3~0)) (<= (+ ~res1~0 ~n2~0) ~n1~0)), 209#L66-7true, 4488#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), 435#true, 40#L102-4true, 3411#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (and (<= 1 ~n1~0) (<= 1 ~n3~0))) (<= 1 ~n1~0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (and (<= 1 ~n1~0) (<= 1 ~n3~0))) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (and (<= 1 ~n1~0) (<= 1 ~n3~0)))), 420#(and (or (not (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))) (<= 0 ~n1~0) (or (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0))), 1436#(and (<= 1 ~n1~0) (<= 1 ~res3~0) (<= (+ ~n3~0 1) ~n1~0)), 354#true, 4503#true, 318#(<= ~n1~0 (+ ~res3~0 ~n3~0)), 2163#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n1~0 (+ ~n2~0 1))), 202#L55-1true]) [2022-12-06 17:03:45,945 INFO L382 tUnfolder$Statistics]: this new event has 157 ancestors and is cut-off event [2022-12-06 17:03:45,945 INFO L385 tUnfolder$Statistics]: existing Event has 157 ancestors and is cut-off event [2022-12-06 17:03:45,945 INFO L385 tUnfolder$Statistics]: existing Event has 157 ancestors and is cut-off event [2022-12-06 17:03:45,945 INFO L385 tUnfolder$Statistics]: existing Event has 157 ancestors and is cut-off event [2022-12-06 17:03:45,946 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([830] L77-->L78-2: Formula: (= v_~n1~0_4 (+ v_~n3~0_4 v_~res3~0_1)) InVars {~n3~0=v_~n3~0_4, ~n1~0=v_~n1~0_4} OutVars{~n3~0=v_~n3~0_4, ~n1~0=v_~n1~0_4, ~res3~0=v_~res3~0_1} AuxVars[] AssignedVars[~res3~0][1811], [8#L52-1true, thread2Thread1of1ForFork1InUse, 299#(<= (+ ~res1~0 ~n2~0) ~n1~0), thread3Thread1of1ForFork2InUse, 110#L78-2true, thread1Thread1of1ForFork0InUse, 343#(and (<= (+ ~res1~0 ~n2~0) (+ ~res3~0 ~n3~0)) (<= (+ ~res1~0 ~n2~0) ~n1~0)), 209#L66-7true, 4488#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), 435#true, 40#L102-4true, 3411#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (and (<= 1 ~n1~0) (<= 1 ~n3~0))) (<= 1 ~n1~0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (and (<= 1 ~n1~0) (<= 1 ~n3~0))) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (and (<= 1 ~n1~0) (<= 1 ~n3~0)))), 1436#(and (<= 1 ~n1~0) (<= 1 ~res3~0) (<= (+ ~n3~0 1) ~n1~0)), 420#(and (or (not (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))) (<= 0 ~n1~0) (or (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0))), 354#true, 4503#true, 318#(<= ~n1~0 (+ ~res3~0 ~n3~0)), 2163#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n1~0 (+ ~n2~0 1)))]) [2022-12-06 17:03:45,946 INFO L382 tUnfolder$Statistics]: this new event has 157 ancestors and is cut-off event [2022-12-06 17:03:45,946 INFO L385 tUnfolder$Statistics]: existing Event has 157 ancestors and is cut-off event [2022-12-06 17:03:45,946 INFO L385 tUnfolder$Statistics]: existing Event has 157 ancestors and is cut-off event [2022-12-06 17:03:45,946 INFO L385 tUnfolder$Statistics]: existing Event has 157 ancestors and is cut-off event [2022-12-06 17:03:46,268 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([830] L77-->L78-2: Formula: (= v_~n1~0_4 (+ v_~n3~0_4 v_~res3~0_1)) InVars {~n3~0=v_~n3~0_4, ~n1~0=v_~n1~0_4} OutVars{~n3~0=v_~n3~0_4, ~n1~0=v_~n1~0_4, ~res3~0=v_~res3~0_1} AuxVars[] AssignedVars[~res3~0][1811], [thread2Thread1of1ForFork1InUse, 299#(<= (+ ~res1~0 ~n2~0) ~n1~0), thread3Thread1of1ForFork2InUse, 110#L78-2true, thread1Thread1of1ForFork0InUse, 343#(and (<= (+ ~res1~0 ~n2~0) (+ ~res3~0 ~n3~0)) (<= (+ ~res1~0 ~n2~0) ~n1~0)), 209#L66-7true, 4488#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), 38#L55-2true, 435#true, 40#L102-4true, 3411#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (and (<= 1 ~n1~0) (<= 1 ~n3~0))) (<= 1 ~n1~0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (and (<= 1 ~n1~0) (<= 1 ~n3~0))) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (and (<= 1 ~n1~0) (<= 1 ~n3~0)))), 420#(and (or (not (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))) (<= 0 ~n1~0) (or (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0))), 1436#(and (<= 1 ~n1~0) (<= 1 ~res3~0) (<= (+ ~n3~0 1) ~n1~0)), 354#true, 4503#true, 318#(<= ~n1~0 (+ ~res3~0 ~n3~0)), 2163#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n1~0 (+ ~n2~0 1)))]) [2022-12-06 17:03:46,269 INFO L382 tUnfolder$Statistics]: this new event has 158 ancestors and is cut-off event [2022-12-06 17:03:46,269 INFO L385 tUnfolder$Statistics]: existing Event has 158 ancestors and is cut-off event [2022-12-06 17:03:46,269 INFO L385 tUnfolder$Statistics]: existing Event has 158 ancestors and is cut-off event [2022-12-06 17:03:46,269 INFO L385 tUnfolder$Statistics]: existing Event has 158 ancestors and is cut-off event [2022-12-06 17:03:46,270 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([830] L77-->L78-2: Formula: (= v_~n1~0_4 (+ v_~n3~0_4 v_~res3~0_1)) InVars {~n3~0=v_~n3~0_4, ~n1~0=v_~n1~0_4} OutVars{~n3~0=v_~n3~0_4, ~n1~0=v_~n1~0_4, ~res3~0=v_~res3~0_1} AuxVars[] AssignedVars[~res3~0][1811], [thread2Thread1of1ForFork1InUse, 299#(<= (+ ~res1~0 ~n2~0) ~n1~0), thread3Thread1of1ForFork2InUse, 110#L78-2true, thread1Thread1of1ForFork0InUse, 343#(and (<= (+ ~res1~0 ~n2~0) (+ ~res3~0 ~n3~0)) (<= (+ ~res1~0 ~n2~0) ~n1~0)), 209#L66-7true, 4488#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), 435#true, 40#L102-4true, 124#L52-2true, 3411#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (and (<= 1 ~n1~0) (<= 1 ~n3~0))) (<= 1 ~n1~0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (and (<= 1 ~n1~0) (<= 1 ~n3~0))) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (and (<= 1 ~n1~0) (<= 1 ~n3~0)))), 420#(and (or (not (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))) (<= 0 ~n1~0) (or (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0))), 1436#(and (<= 1 ~n1~0) (<= 1 ~res3~0) (<= (+ ~n3~0 1) ~n1~0)), 354#true, 4503#true, 318#(<= ~n1~0 (+ ~res3~0 ~n3~0)), 2163#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n1~0 (+ ~n2~0 1)))]) [2022-12-06 17:03:46,270 INFO L382 tUnfolder$Statistics]: this new event has 158 ancestors and is cut-off event [2022-12-06 17:03:46,271 INFO L385 tUnfolder$Statistics]: existing Event has 158 ancestors and is cut-off event [2022-12-06 17:03:46,271 INFO L385 tUnfolder$Statistics]: existing Event has 158 ancestors and is cut-off event [2022-12-06 17:03:46,271 INFO L385 tUnfolder$Statistics]: existing Event has 158 ancestors and is cut-off event [2022-12-06 17:03:51,815 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([869] L80-6-->L80-7: Formula: (= v_~res3~0_2 |v_thread3Thread1of1ForFork2_#t~ret17#1_5|) InVars {thread3Thread1of1ForFork2_#t~ret17#1=|v_thread3Thread1of1ForFork2_#t~ret17#1_5|} OutVars{thread3Thread1of1ForFork2_#t~ret17#1=|v_thread3Thread1of1ForFork2_#t~ret17#1_5|, ~res3~0=v_~res3~0_2} AuxVars[] AssignedVars[~res3~0][1895], [1434#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0)), thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, 316#true, thread1Thread1of1ForFork0InUse, 209#L66-7true, 4488#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), 435#true, 40#L102-4true, 297#true, 3415#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (and (<= 1 ~n1~0) (<= 1 ~n3~0))) (<= 1 ~n1~0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (and (<= 1 ~n1~0) (<= 1 ~n3~0))) (< |thread3Thread1of1ForFork2_~i~2#1| ~n3~0) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (and (<= 1 ~n1~0) (<= 1 ~n3~0))) (< |thread3Thread1of1ForFork2_~i~2#1| ~n1~0)), 420#(and (or (not (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))) (<= 0 ~n1~0) (or (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0))), 335#true, 354#true, 4503#true, 198#L52-7true, 2163#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n1~0 (+ ~n2~0 1))), 89#L80-7true]) [2022-12-06 17:03:51,815 INFO L382 tUnfolder$Statistics]: this new event has 200 ancestors and is cut-off event [2022-12-06 17:03:51,815 INFO L385 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-12-06 17:03:51,815 INFO L385 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-12-06 17:03:51,815 INFO L385 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-12-06 17:03:52,126 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([869] L80-6-->L80-7: Formula: (= v_~res3~0_2 |v_thread3Thread1of1ForFork2_#t~ret17#1_5|) InVars {thread3Thread1of1ForFork2_#t~ret17#1=|v_thread3Thread1of1ForFork2_#t~ret17#1_5|} OutVars{thread3Thread1of1ForFork2_#t~ret17#1=|v_thread3Thread1of1ForFork2_#t~ret17#1_5|, ~res3~0=v_~res3~0_2} AuxVars[] AssignedVars[~res3~0][2151], [3417#(and (<= 1 ~n1~0) (<= 1 ~n3~0) (< |thread3Thread1of1ForFork2_~i~2#1| ~n3~0) (< |thread3Thread1of1ForFork2_~i~2#1| ~n1~0)), thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, 316#true, thread1Thread1of1ForFork0InUse, 1428#(and (<= 1 ~n1~0) (or (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n3~0 1) ~n1~0)) (or (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ ~n3~0 1) ~n1~0))), 4492#(and (<= 1 ~n3~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), 209#L66-7true, 435#true, 40#L102-4true, 297#true, 420#(and (or (not (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))) (<= 0 ~n1~0) (or (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0))), 354#true, 335#true, 4503#true, 198#L52-7true, 2163#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n1~0 (+ ~n2~0 1))), 89#L80-7true]) [2022-12-06 17:03:52,127 INFO L382 tUnfolder$Statistics]: this new event has 207 ancestors and is cut-off event [2022-12-06 17:03:52,127 INFO L385 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-12-06 17:03:52,127 INFO L385 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-12-06 17:03:52,127 INFO L385 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-12-06 17:03:52,129 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([832] L78-2-->L78-3: Formula: (or (not (< |v_thread3Thread1of1ForFork2_~i~2#1_5| v_~n3~0_5)) (not (< |v_thread3Thread1of1ForFork2_~i~2#1_5| v_~n1~0_5))) InVars {~n3~0=v_~n3~0_5, ~n1~0=v_~n1~0_5, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_5|} OutVars{~n3~0=v_~n3~0_5, ~n1~0=v_~n1~0_5, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_5|} AuxVars[] AssignedVars[][2651], [thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, 2440#(and (<= 1 ~n1~0) (<= 1 ~n3~0)), thread1Thread1of1ForFork0InUse, 1428#(and (<= 1 ~n1~0) (or (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n3~0 1) ~n1~0)) (or (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ ~n3~0 1) ~n1~0))), 36#L78-3true, 4492#(and (<= 1 ~n3~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), 209#L66-7true, 435#true, 40#L102-4true, 297#true, 420#(and (or (not (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))) (<= 0 ~n1~0) (or (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0))), 354#true, 335#true, 4503#true, 198#L52-7true, 318#(<= ~n1~0 (+ ~res3~0 ~n3~0)), 2163#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n1~0 (+ ~n2~0 1)))]) [2022-12-06 17:03:52,129 INFO L382 tUnfolder$Statistics]: this new event has 192 ancestors and is cut-off event [2022-12-06 17:03:52,129 INFO L385 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-12-06 17:03:52,129 INFO L385 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-12-06 17:03:52,129 INFO L385 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-12-06 17:03:52,129 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([831] L78-2-->L79: Formula: (and (< |v_thread3Thread1of1ForFork2_~i~2#1_3| v_~n3~0_6) (< |v_thread3Thread1of1ForFork2_~i~2#1_3| v_~n1~0_6)) InVars {~n3~0=v_~n3~0_6, ~n1~0=v_~n1~0_6, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_3|} OutVars{~n3~0=v_~n3~0_6, ~n1~0=v_~n1~0_6, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_3|} AuxVars[] AssignedVars[][2652], [3417#(and (<= 1 ~n1~0) (<= 1 ~n3~0) (< |thread3Thread1of1ForFork2_~i~2#1| ~n3~0) (< |thread3Thread1of1ForFork2_~i~2#1| ~n1~0)), thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0InUse, 1428#(and (<= 1 ~n1~0) (or (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n3~0 1) ~n1~0)) (or (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ ~n3~0 1) ~n1~0))), 71#L79true, 4492#(and (<= 1 ~n3~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), 209#L66-7true, 435#true, 40#L102-4true, 297#true, 420#(and (or (not (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))) (<= 0 ~n1~0) (or (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0))), 335#true, 354#true, 4503#true, 198#L52-7true, 318#(<= ~n1~0 (+ ~res3~0 ~n3~0)), 2163#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n1~0 (+ ~n2~0 1)))]) [2022-12-06 17:03:52,129 INFO L382 tUnfolder$Statistics]: this new event has 192 ancestors and is cut-off event [2022-12-06 17:03:52,130 INFO L385 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-12-06 17:03:52,130 INFO L385 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-12-06 17:03:52,130 INFO L385 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-12-06 17:03:52,176 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([879] thread1EXIT-->L103-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem31#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][2585], [thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0NotInUse, 209#L66-7true, 4488#(and (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), 253#L103-2true, 265#L80-2true, 435#true, 297#true, 420#(and (or (not (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))) (<= 0 ~n1~0) (or (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0))), 1436#(and (<= 1 ~n1~0) (<= 1 ~res3~0) (<= (+ ~n3~0 1) ~n1~0)), 3415#(and (or (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1) (and (<= 1 ~n1~0) (<= 1 ~n3~0))) (<= 1 ~n1~0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (and (<= 1 ~n1~0) (<= 1 ~n3~0))) (< |thread3Thread1of1ForFork2_~i~2#1| ~n3~0) (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (and (<= 1 ~n1~0) (<= 1 ~n3~0))) (< |thread3Thread1of1ForFork2_~i~2#1| ~n1~0)), 335#true, 354#true, 4503#true, 318#(<= ~n1~0 (+ ~res3~0 ~n3~0)), 2163#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n1~0 (+ ~n2~0 1)))]) [2022-12-06 17:03:52,176 INFO L382 tUnfolder$Statistics]: this new event has 192 ancestors and is cut-off event [2022-12-06 17:03:52,176 INFO L385 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-12-06 17:03:52,177 INFO L385 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-12-06 17:03:52,177 INFO L385 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-12-06 17:03:52,473 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([832] L78-2-->L78-3: Formula: (or (not (< |v_thread3Thread1of1ForFork2_~i~2#1_5| v_~n3~0_5)) (not (< |v_thread3Thread1of1ForFork2_~i~2#1_5| v_~n1~0_5))) InVars {~n3~0=v_~n3~0_5, ~n1~0=v_~n1~0_5, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_5|} OutVars{~n3~0=v_~n3~0_5, ~n1~0=v_~n1~0_5, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_5|} AuxVars[] AssignedVars[][2691], [thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0InUse, 2440#(and (<= 1 ~n1~0) (<= 1 ~n3~0)), 1428#(and (<= 1 ~n1~0) (or (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n3~0 1) ~n1~0)) (or (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ ~n3~0 1) ~n1~0))), 36#L78-3true, 209#L66-7true, 4145#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))), 435#true, 40#L102-4true, 297#true, 335#true, 354#true, 4503#true, 198#L52-7true, 318#(<= ~n1~0 (+ ~res3~0 ~n3~0)), 2163#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n1~0 (+ ~n2~0 1))), 379#(<= 0 ~n1~0)]) [2022-12-06 17:03:52,474 INFO L382 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-12-06 17:03:52,474 INFO L385 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-12-06 17:03:52,474 INFO L385 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-12-06 17:03:52,474 INFO L385 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-12-06 17:03:52,474 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([831] L78-2-->L79: Formula: (and (< |v_thread3Thread1of1ForFork2_~i~2#1_3| v_~n3~0_6) (< |v_thread3Thread1of1ForFork2_~i~2#1_3| v_~n1~0_6)) InVars {~n3~0=v_~n3~0_6, ~n1~0=v_~n1~0_6, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_3|} OutVars{~n3~0=v_~n3~0_6, ~n1~0=v_~n1~0_6, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_3|} AuxVars[] AssignedVars[][2692], [3417#(and (<= 1 ~n1~0) (<= 1 ~n3~0) (< |thread3Thread1of1ForFork2_~i~2#1| ~n3~0) (< |thread3Thread1of1ForFork2_~i~2#1| ~n1~0)), thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0InUse, 1428#(and (<= 1 ~n1~0) (or (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n3~0 1) ~n1~0)) (or (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ ~n3~0 1) ~n1~0))), 71#L79true, 209#L66-7true, 4145#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))), 435#true, 40#L102-4true, 297#true, 335#true, 354#true, 4503#true, 198#L52-7true, 318#(<= ~n1~0 (+ ~res3~0 ~n3~0)), 2163#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n1~0 (+ ~n2~0 1))), 379#(<= 0 ~n1~0)]) [2022-12-06 17:03:52,474 INFO L382 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-12-06 17:03:52,474 INFO L385 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-12-06 17:03:52,474 INFO L385 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-12-06 17:03:52,474 INFO L385 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-12-06 17:03:52,513 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([879] thread1EXIT-->L103-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem31#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][2646], [3417#(and (<= 1 ~n1~0) (<= 1 ~n3~0) (< |thread3Thread1of1ForFork2_~i~2#1| ~n3~0) (< |thread3Thread1of1ForFork2_~i~2#1| ~n1~0)), thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0NotInUse, 1428#(and (<= 1 ~n1~0) (or (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n3~0 1) ~n1~0)) (or (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ ~n3~0 1) ~n1~0))), 4492#(and (<= 1 ~n3~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), 209#L66-7true, 253#L103-2true, 265#L80-2true, 435#true, 297#true, 420#(and (or (not (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))) (<= 0 ~n1~0) (or (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0))), 335#true, 354#true, 4503#true, 318#(<= ~n1~0 (+ ~res3~0 ~n3~0)), 2163#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n1~0 (+ ~n2~0 1)))]) [2022-12-06 17:03:52,513 INFO L382 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-12-06 17:03:52,513 INFO L385 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-12-06 17:03:52,513 INFO L385 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-12-06 17:03:52,513 INFO L385 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-12-06 17:03:52,514 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([879] thread1EXIT-->L103-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem31#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][2653], [thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0NotInUse, 2440#(and (<= 1 ~n1~0) (<= 1 ~n3~0)), 1428#(and (<= 1 ~n1~0) (or (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n3~0 1) ~n1~0)) (or (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ ~n3~0 1) ~n1~0))), 4492#(and (<= 1 ~n3~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n3~0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n3~0)), 209#L66-7true, 158#L83-2true, 253#L103-2true, 435#true, 297#true, 420#(and (or (not (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0))) (<= 0 ~n1~0) (or (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0))), 335#true, 354#true, 4503#true, 318#(<= ~n1~0 (+ ~res3~0 ~n3~0)), 2163#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n1~0 (+ ~n2~0 1)))]) [2022-12-06 17:03:52,514 INFO L382 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2022-12-06 17:03:52,514 INFO L385 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-12-06 17:03:52,514 INFO L385 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-12-06 17:03:52,514 INFO L385 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-12-06 17:03:52,624 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([879] thread1EXIT-->L103-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem31#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][2693], [thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0NotInUse, 2440#(and (<= 1 ~n1~0) (<= 1 ~n3~0)), 1428#(and (<= 1 ~n1~0) (or (< 0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~n3~0 1) ~n1~0)) (or (< 0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ ~n3~0 1) ~n1~0))), 209#L66-7true, 4145#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n2~0 (+ ~n3~0 1))), 158#L83-2true, 253#L103-2true, 435#true, 297#true, 335#true, 354#true, 4503#true, 318#(<= ~n1~0 (+ ~res3~0 ~n3~0)), 2163#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~n1~0 (+ ~n2~0 1))), 379#(<= 0 ~n1~0)]) [2022-12-06 17:03:52,625 INFO L382 tUnfolder$Statistics]: this new event has 206 ancestors and is cut-off event [2022-12-06 17:03:52,625 INFO L385 tUnfolder$Statistics]: existing Event has 206 ancestors and is cut-off event [2022-12-06 17:03:52,625 INFO L385 tUnfolder$Statistics]: existing Event has 206 ancestors and is cut-off event [2022-12-06 17:03:52,625 INFO L385 tUnfolder$Statistics]: existing Event has 206 ancestors and is cut-off event [2022-12-06 17:03:52,785 INFO L130 PetriNetUnfolder]: 18781/96933 cut-off events. [2022-12-06 17:03:52,786 INFO L131 PetriNetUnfolder]: For 539187/848713 co-relation queries the response was YES. [2022-12-06 17:03:53,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 332814 conditions, 96933 events. 18781/96933 cut-off events. For 539187/848713 co-relation queries the response was YES. Maximal size of possible extension queue 2952. Compared 1644002 event pairs, 4176 based on Foata normal form. 665/83760 useless extension candidates. Maximal degree in co-relation 60910. Up to 15963 conditions per place. [2022-12-06 17:03:54,007 INFO L137 encePairwiseOnDemand]: 301/312 looper letters, 1238 selfloop transitions, 12 changer transitions 681/2854 dead transitions. [2022-12-06 17:03:54,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 2854 transitions, 60799 flow [2022-12-06 17:03:54,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 17:03:54,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 17:03:54,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2454 transitions. [2022-12-06 17:03:54,012 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7865384615384615 [2022-12-06 17:03:54,013 INFO L294 CegarLoopForPetriNet]: 281 programPoint places, 198 predicate places. [2022-12-06 17:03:54,013 INFO L495 AbstractCegarLoop]: Abstraction has has 479 places, 2854 transitions, 60799 flow [2022-12-06 17:03:54,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 240.85714285714286) internal successors, (1686), 7 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:03:54,014 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:03:54,014 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:03:54,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 17:03:54,014 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:03:54,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:03:54,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1438583357, now seen corresponding path program 1 times [2022-12-06 17:03:54,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:03:54,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547744311] [2022-12-06 17:03:54,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:03:54,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:03:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:03:54,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:03:54,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:03:54,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547744311] [2022-12-06 17:03:54,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547744311] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:03:54,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:03:54,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 17:03:54,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839413384] [2022-12-06 17:03:54,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:03:54,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 17:03:54,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:03:54,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 17:03:54,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 17:03:54,264 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 312 [2022-12-06 17:03:54,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 2854 transitions, 60799 flow. Second operand has 7 states, 7 states have (on average 240.85714285714286) internal successors, (1686), 7 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:03:54,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:03:54,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 312 [2022-12-06 17:03:54,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand