/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-deagle/reorder_c11_bad-50.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:28:42,416 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:28:42,420 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:28:42,481 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:28:42,482 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:28:42,484 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:28:42,492 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:28:42,498 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:28:42,517 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:28:42,522 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:28:42,523 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:28:42,527 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:28:42,527 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:28:42,535 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:28:42,537 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:28:42,538 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:28:42,540 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:28:42,541 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:28:42,545 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:28:42,552 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:28:42,557 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:28:42,559 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:28:42,561 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:28:42,562 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:28:42,566 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:28:42,573 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:28:42,573 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:28:42,579 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:28:42,580 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:28:42,581 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:28:42,582 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:28:42,582 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:28:42,583 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:28:42,585 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:28:42,587 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:28:42,588 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:28:42,588 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:28:42,589 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:28:42,589 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:28:42,590 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:28:42,592 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:28:42,594 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:28:42,602 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf [2022-07-22 12:28:42,654 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:28:42,654 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:28:42,655 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:28:42,656 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:28:42,657 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:28:42,657 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:28:42,658 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:28:42,658 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:28:42,658 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:28:42,659 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:28:42,660 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:28:42,660 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:28:42,660 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:28:42,660 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:28:42,661 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:28:42,661 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:28:42,661 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:28:42,661 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:28:42,662 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:28:42,662 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:28:42,662 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:28:42,662 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:28:42,663 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:28:42,663 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:28:42,663 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:28:42,663 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:28:42,663 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:28:42,664 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:28:42,664 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:28:42,665 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:28:42,665 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:28:42,668 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:28:42,668 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 [2022-07-22 12:28:43,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:28:43,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:28:43,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:28:43,154 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:28:43,155 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:28:43,157 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/reorder_c11_bad-50.i [2022-07-22 12:28:43,237 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c32984395/e71cea7fff1d4a639fe1a0ad123cb99d/FLAG534b3f60d [2022-07-22 12:28:44,044 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:28:44,045 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/reorder_c11_bad-50.i [2022-07-22 12:28:44,069 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c32984395/e71cea7fff1d4a639fe1a0ad123cb99d/FLAG534b3f60d [2022-07-22 12:28:44,232 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c32984395/e71cea7fff1d4a639fe1a0ad123cb99d [2022-07-22 12:28:44,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:28:44,241 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:28:44,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:28:44,243 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:28:44,247 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:28:44,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:28:44" (1/1) ... [2022-07-22 12:28:44,249 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3841f93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:28:44, skipping insertion in model container [2022-07-22 12:28:44,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:28:44" (1/1) ... [2022-07-22 12:28:44,258 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:28:44,299 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:28:44,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/reorder_c11_bad-50.i[30190,30203] [2022-07-22 12:28:44,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:28:44,666 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:28:44,736 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/reorder_c11_bad-50.i[30190,30203] [2022-07-22 12:28:44,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:28:44,796 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:28:44,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:28:44 WrapperNode [2022-07-22 12:28:44,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:28:44,799 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:28:44,799 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:28:44,799 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:28:44,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:28:44" (1/1) ... [2022-07-22 12:28:44,827 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:28:44" (1/1) ... [2022-07-22 12:28:44,853 INFO L137 Inliner]: procedures = 163, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 71 [2022-07-22 12:28:44,854 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:28:44,855 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:28:44,855 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:28:44,855 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:28:44,864 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:28:44" (1/1) ... [2022-07-22 12:28:44,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:28:44" (1/1) ... [2022-07-22 12:28:44,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:28:44" (1/1) ... [2022-07-22 12:28:44,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:28:44" (1/1) ... [2022-07-22 12:28:44,878 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:28:44" (1/1) ... [2022-07-22 12:28:44,883 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:28:44" (1/1) ... [2022-07-22 12:28:44,886 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:28:44" (1/1) ... [2022-07-22 12:28:44,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:28:44,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:28:44,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:28:44,891 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:28:44,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:28:44" (1/1) ... [2022-07-22 12:28:44,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:28:44,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:28:44,954 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:28:44,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-22 12:28:45,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:28:45,043 INFO L130 BoogieDeclarations]: Found specification of procedure setThread [2022-07-22 12:28:45,043 INFO L138 BoogieDeclarations]: Found implementation of procedure setThread [2022-07-22 12:28:45,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:28:45,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 12:28:45,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:28:45,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:28:45,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:28:45,044 INFO L130 BoogieDeclarations]: Found specification of procedure checkThread [2022-07-22 12:28:45,045 INFO L138 BoogieDeclarations]: Found implementation of procedure checkThread [2022-07-22 12:28:45,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:28:45,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 12:28:45,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:28:45,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:28:45,047 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 12:28:45,223 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:28:45,225 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:28:45,544 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:28:45,563 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:28:45,564 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 12:28:45,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:28:45 BoogieIcfgContainer [2022-07-22 12:28:45,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:28:45,569 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:28:45,569 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:28:45,574 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:28:45,575 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:28:45,576 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:28:44" (1/3) ... [2022-07-22 12:28:45,577 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1825afb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:28:45, skipping insertion in model container [2022-07-22 12:28:45,578 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:28:45,578 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:28:44" (2/3) ... [2022-07-22 12:28:45,579 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1825afb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:28:45, skipping insertion in model container [2022-07-22 12:28:45,579 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:28:45,579 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:28:45" (3/3) ... [2022-07-22 12:28:45,581 INFO L322 chiAutomizerObserver]: Analyzing ICFG reorder_c11_bad-50.i [2022-07-22 12:28:45,754 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-07-22 12:28:45,793 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 92 transitions, 206 flow [2022-07-22 12:28:45,876 INFO L129 PetriNetUnfolder]: 27/203 cut-off events. [2022-07-22 12:28:45,877 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-07-22 12:28:45,888 INFO L84 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 203 events. 27/203 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 621 event pairs, 0 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 105. Up to 8 conditions per place. [2022-07-22 12:28:45,888 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 92 transitions, 206 flow [2022-07-22 12:28:45,910 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 92 transitions, 206 flow [2022-07-22 12:28:45,916 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-22 12:28:45,940 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 92 transitions, 206 flow [2022-07-22 12:28:45,943 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 92 transitions, 206 flow [2022-07-22 12:28:45,944 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 92 transitions, 206 flow [2022-07-22 12:28:46,047 INFO L129 PetriNetUnfolder]: 27/203 cut-off events. [2022-07-22 12:28:46,047 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-07-22 12:28:46,050 INFO L84 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 203 events. 27/203 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 619 event pairs, 0 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 105. Up to 8 conditions per place. [2022-07-22 12:28:46,053 INFO L116 LiptonReduction]: Number of co-enabled transitions 1180 [2022-07-22 12:28:48,457 INFO L131 LiptonReduction]: Checked pairs total: 2241 [2022-07-22 12:28:48,458 INFO L133 LiptonReduction]: Total number of compositions: 71 [2022-07-22 12:28:48,484 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:28:48,484 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:28:48,484 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:28:48,484 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:28:48,485 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:28:48,485 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:28:48,485 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:28:48,485 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:28:48,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:28:48,551 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 11 [2022-07-22 12:28:48,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:28:48,552 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:28:48,558 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2022-07-22 12:28:48,559 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:28:48,559 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:28:48,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 138 states, but on-demand construction may add more states [2022-07-22 12:28:48,569 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 11 [2022-07-22 12:28:48,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:28:48,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:28:48,570 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2022-07-22 12:28:48,570 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:28:48,576 INFO L748 eck$LassoCheckResult]: Stem: 89#[ULTIMATE.startENTRY]don't care [307] ULTIMATE.startENTRY-->L702-5: Formula: (let ((.cse0 (select |v_#memory_int_42| 1)) (.cse1 (store |v_#valid_93| |v_ULTIMATE.start_main_~#setPool~0#1.base_41| 1))) (and (= (select |v_#valid_93| 1) 1) (= |v_ULTIMATE.start_main_~#checkPool~0#1.offset_35| 0) (= |v_ULTIMATE.start_#in~argv#1.base_10| |v_ULTIMATE.start_main_#in~argv#1.base_15|) (= (select |v_#length_58| 1) 2) (= (select |v_#length_58| 2) 1) (= v_~a~0_57 0) (= v_~i~0_118 0) (= (select .cse0 1) 0) (= (select |v_#valid_93| 0) 0) (= (select |v_#valid_93| 2) 1) (= (store .cse1 |v_ULTIMATE.start_main_~#checkPool~0#1.base_43| 1) |v_#valid_92|) (= |v_ULTIMATE.start_main_~argc#1_13| |v_ULTIMATE.start_main_#in~argc#1_13|) (= |v_ULTIMATE.start_main_#in~argv#1.offset_15| |v_ULTIMATE.start_main_~argv#1.offset_17|) (= (select (select |v_#memory_int_42| 2) 0) 0) (= (store (store |v_#length_58| |v_ULTIMATE.start_main_~#setPool~0#1.base_41| 200) |v_ULTIMATE.start_main_~#checkPool~0#1.base_43| 4) |v_#length_57|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#setPool~0#1.base_41|) (= (select |v_#valid_93| |v_ULTIMATE.start_main_~#setPool~0#1.base_41|) 0) (= |v_#NULL.offset_8| 0) (= |v_ULTIMATE.start_#in~argc#1_10| |v_ULTIMATE.start_main_#in~argc#1_13|) (= v_~b~0_60 0) (= (select .cse0 0) 48) (< 0 |v_#StackHeapBarrier_18|) (= (select .cse1 |v_ULTIMATE.start_main_~#checkPool~0#1.base_43|) 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#checkPool~0#1.base_43|) (= |v_ULTIMATE.start_main_#in~argv#1.base_15| |v_ULTIMATE.start_main_~argv#1.base_17|) (= |v_#NULL.base_8| 0) (= |v_ULTIMATE.start_main_~#setPool~0#1.offset_35| 0) (= |v_ULTIMATE.start_main_#in~argv#1.offset_15| |v_ULTIMATE.start_#in~argv#1.offset_10|))) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_10|, #StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_93|, #memory_int=|v_#memory_int_42|, #length=|v_#length_58|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_10|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_10|} OutVars{ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_18|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_17|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_17|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_10|, ~a~0=v_~a~0_57, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_13|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_19|, #length=|v_#length_57|, ULTIMATE.start_main_#t~post4#1=|v_ULTIMATE.start_main_#t~post4#1_25|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_10|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_10|, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_43|, ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_13|, ULTIMATE.start_main_#t~post1#1=|v_ULTIMATE.start_main_#t~post1#1_21|, ~i~0=v_~i~0_118, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_19|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_41|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_17|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_15|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_18|, #NULL.base=|v_#NULL.base_8|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_25|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_23|, ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_35|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_15|, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_15|, ~b~0=v_~b~0_60, #valid=|v_#valid_92|, ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_21|, #memory_int=|v_#memory_int_42|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8#1, #NULL.offset, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_~argv#1.base, ~a~0, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#t~post9#1, #length, ULTIMATE.start_main_#t~post4#1, ULTIMATE.start_main_~#checkPool~0#1.base, ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_#t~post1#1, ~i~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#setPool~0#1.base, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#in~argv#1.offset, ULTIMATE.start_main_#t~mem10#1, #NULL.base, ULTIMATE.start_main_#t~pre2#1, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~#checkPool~0#1.offset, ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#t~nondet3#1, ~b~0, #valid, ULTIMATE.start_main_#t~post7#1, ULTIMATE.start_main_~#setPool~0#1.offset] 92#[L702-5]don't care [289] L702-5-->L703-3: Formula: (let ((.cse1 (* v_~i~0_90 4))) (let ((.cse0 (+ |v_ULTIMATE.start_main_~#setPool~0#1.offset_21| .cse1))) (and (= |v_#memory_int_32| (store |v_#memory_int_33| |v_ULTIMATE.start_main_~#setPool~0#1.base_25| (store (select |v_#memory_int_33| |v_ULTIMATE.start_main_~#setPool~0#1.base_25|) .cse0 |v_ULTIMATE.start_main_#t~pre2#1_15|))) (= (select |v_#valid_66| |v_ULTIMATE.start_main_~#setPool~0#1.base_25|) 1) (<= (+ |v_ULTIMATE.start_main_~#setPool~0#1.offset_21| .cse1 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#setPool~0#1.base_25|)) (<= 0 .cse0) (= |v_#pthreadsForks_24| |v_ULTIMATE.start_main_#t~pre2#1_15|) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (< v_~i~0_90 50)))) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ~i~0=v_~i~0_90, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_25|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_33|, #length=|v_#length_41|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_21|} OutVars{#pthreadsForks=|v_#pthreadsForks_23|, ~i~0=v_~i~0_90, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_25|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_32|, #length=|v_#length_41|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_21|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_15|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre2#1] 94#[L703-3]don't care [229] L703-3-->setThreadENTRY: Formula: (and (= |v_setThreadThread1of1ForFork0_#in~param.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre2#1_6| v_setThreadThread1of1ForFork0_thidvar0_2) (= 0 |v_setThreadThread1of1ForFork0_#in~param.base_4|)) InVars {ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_6|} OutVars{setThreadThread1of1ForFork0_#in~param.offset=|v_setThreadThread1of1ForFork0_#in~param.offset_4|, setThreadThread1of1ForFork0_#res.base=|v_setThreadThread1of1ForFork0_#res.base_4|, setThreadThread1of1ForFork0_#res.offset=|v_setThreadThread1of1ForFork0_#res.offset_4|, setThreadThread1of1ForFork0_thidvar0=v_setThreadThread1of1ForFork0_thidvar0_2, setThreadThread1of1ForFork0_#in~param.base=|v_setThreadThread1of1ForFork0_#in~param.base_4|, setThreadThread1of1ForFork0_~param.base=v_setThreadThread1of1ForFork0_~param.base_4, setThreadThread1of1ForFork0_~param.offset=v_setThreadThread1of1ForFork0_~param.offset_4, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_6|} AuxVars[] AssignedVars[setThreadThread1of1ForFork0_#in~param.offset, setThreadThread1of1ForFork0_#res.base, setThreadThread1of1ForFork0_#res.offset, setThreadThread1of1ForFork0_thidvar0, setThreadThread1of1ForFork0_#in~param.base, setThreadThread1of1ForFork0_~param.base, setThreadThread1of1ForFork0_~param.offset] 98#[setThreadENTRY, L703-4]don't care [300] L703-4-->L702-5: Formula: (= (+ v_~i~0_107 1) v_~i~0_106) InVars {~i~0=v_~i~0_107} OutVars{ULTIMATE.start_main_#t~post1#1=|v_ULTIMATE.start_main_#t~post1#1_17|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_11|, ~i~0=v_~i~0_106, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post1#1, ULTIMATE.start_main_#t~nondet3#1, ~i~0, ULTIMATE.start_main_#t~pre2#1] 104#[L702-5, setThreadENTRY]don't care [289] L702-5-->L703-3: Formula: (let ((.cse1 (* v_~i~0_90 4))) (let ((.cse0 (+ |v_ULTIMATE.start_main_~#setPool~0#1.offset_21| .cse1))) (and (= |v_#memory_int_32| (store |v_#memory_int_33| |v_ULTIMATE.start_main_~#setPool~0#1.base_25| (store (select |v_#memory_int_33| |v_ULTIMATE.start_main_~#setPool~0#1.base_25|) .cse0 |v_ULTIMATE.start_main_#t~pre2#1_15|))) (= (select |v_#valid_66| |v_ULTIMATE.start_main_~#setPool~0#1.base_25|) 1) (<= (+ |v_ULTIMATE.start_main_~#setPool~0#1.offset_21| .cse1 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#setPool~0#1.base_25|)) (<= 0 .cse0) (= |v_#pthreadsForks_24| |v_ULTIMATE.start_main_#t~pre2#1_15|) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (< v_~i~0_90 50)))) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ~i~0=v_~i~0_90, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_25|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_33|, #length=|v_#length_41|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_21|} OutVars{#pthreadsForks=|v_#pthreadsForks_23|, ~i~0=v_~i~0_90, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_25|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_32|, #length=|v_#length_41|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_21|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_15|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre2#1] 114#[setThreadENTRY, L703-3]don't care [227] L703-3-->ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 130#[ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, setThreadENTRY]don't care [2022-07-22 12:28:48,577 INFO L750 eck$LassoCheckResult]: Loop: 130#[ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, setThreadENTRY]don't care [228] ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 130#[ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, setThreadENTRY]don't care [2022-07-22 12:28:48,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:28:48,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1360735640, now seen corresponding path program 1 times [2022-07-22 12:28:48,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:28:48,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719657601] [2022-07-22 12:28:48,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:28:48,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:28:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:28:48,757 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:28:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:28:48,861 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:28:48,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:28:48,865 INFO L85 PathProgramCache]: Analyzing trace with hash 259, now seen corresponding path program 1 times [2022-07-22 12:28:48,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:28:48,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939112812] [2022-07-22 12:28:48,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:28:48,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:28:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:28:48,894 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:28:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:28:48,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:28:48,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:28:48,928 INFO L85 PathProgramCache]: Analyzing trace with hash -766867892, now seen corresponding path program 1 times [2022-07-22 12:28:48,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:28:48,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362210551] [2022-07-22 12:28:48,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:28:48,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:28:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:28:48,962 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:28:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:28:48,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:28:49,773 WARN L146 chiAutomizerObserver]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-07-22 12:28:49,810 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2022-07-22 12:28:49,821 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 110 transitions, 268 flow [2022-07-22 12:28:49,979 INFO L129 PetriNetUnfolder]: 111/654 cut-off events. [2022-07-22 12:28:49,980 INFO L130 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2022-07-22 12:28:49,985 INFO L84 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 654 events. 111/654 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3112 event pairs, 2 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 393. Up to 32 conditions per place. [2022-07-22 12:28:49,985 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 110 transitions, 268 flow [2022-07-22 12:28:49,997 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 110 transitions, 268 flow [2022-07-22 12:28:49,998 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-22 12:28:49,998 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 110 transitions, 268 flow [2022-07-22 12:28:49,998 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 110 transitions, 268 flow [2022-07-22 12:28:49,998 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 110 transitions, 268 flow [2022-07-22 12:28:50,127 INFO L129 PetriNetUnfolder]: 111/654 cut-off events. [2022-07-22 12:28:50,127 INFO L130 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2022-07-22 12:28:50,133 INFO L84 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 654 events. 111/654 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3131 event pairs, 1 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 393. Up to 32 conditions per place. [2022-07-22 12:28:50,149 INFO L116 LiptonReduction]: Number of co-enabled transitions 2884 [2022-07-22 12:28:52,524 INFO L131 LiptonReduction]: Checked pairs total: 6929 [2022-07-22 12:28:52,524 INFO L133 LiptonReduction]: Total number of compositions: 81 [2022-07-22 12:28:52,526 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:28:52,526 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:28:52,527 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:28:52,527 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:28:52,527 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:28:52,527 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:28:52,527 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:28:52,527 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:28:52,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:28:52,736 INFO L131 ngComponentsAnalysis]: Automaton has 61 accepting balls. 61 [2022-07-22 12:28:52,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:28:52,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:28:52,737 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1] [2022-07-22 12:28:52,737 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:28:52,738 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:28:52,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 1601 states, but on-demand construction may add more states [2022-07-22 12:28:52,772 INFO L131 ngComponentsAnalysis]: Automaton has 61 accepting balls. 61 [2022-07-22 12:28:52,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:28:52,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:28:52,773 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1] [2022-07-22 12:28:52,774 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:28:52,775 INFO L748 eck$LassoCheckResult]: Stem: 106#[ULTIMATE.startENTRY]don't care [514] ULTIMATE.startENTRY-->L702-5: Formula: (let ((.cse0 (select |v_#memory_int_77| 1)) (.cse1 (store |v_#valid_175| |v_ULTIMATE.start_main_~#setPool~0#1.base_80| 1))) (and (= |v_ULTIMATE.start_main_#in~argv#1.offset_30| |v_ULTIMATE.start_main_~argv#1.offset_34|) (= (select (select |v_#memory_int_77| 2) 0) 0) (= |v_ULTIMATE.start_#in~argc#1_19| |v_ULTIMATE.start_main_#in~argc#1_28|) (= (select .cse0 0) 48) (= |v_ULTIMATE.start_main_#in~argv#1.offset_30| |v_ULTIMATE.start_#in~argv#1.offset_19|) (= |v_ULTIMATE.start_main_~#checkPool~0#1.offset_64| 0) (= |v_ULTIMATE.start_main_~#setPool~0#1.offset_64| 0) (= |v_#NULL.base_19| 0) (= (store (store |v_#length_106| |v_ULTIMATE.start_main_~#setPool~0#1.base_80| 200) |v_ULTIMATE.start_main_~#checkPool~0#1.base_80| 4) |v_#length_105|) (= (select |v_#valid_175| 2) 1) (< 0 |v_#StackHeapBarrier_37|) (= (select |v_#valid_175| 1) 1) (< |v_#StackHeapBarrier_37| |v_ULTIMATE.start_main_~#checkPool~0#1.base_80|) (= (select |v_#valid_175| |v_ULTIMATE.start_main_~#setPool~0#1.base_80|) 0) (= (select .cse0 1) 0) (= v_~b~0_189 0) (= (select |v_#valid_175| 0) 0) (= |v_ULTIMATE.start_main_~argc#1_30| |v_ULTIMATE.start_main_#in~argc#1_28|) (= 2 (select |v_#length_106| 1)) (= (select .cse1 |v_ULTIMATE.start_main_~#checkPool~0#1.base_80|) 0) (= v_~i~0_202 0) (= |v_#valid_174| (store .cse1 |v_ULTIMATE.start_main_~#checkPool~0#1.base_80| 1)) (= |v_ULTIMATE.start_#in~argv#1.base_19| |v_ULTIMATE.start_main_#in~argv#1.base_30|) (= |v_ULTIMATE.start_main_#in~argv#1.base_30| |v_ULTIMATE.start_main_~argv#1.base_34|) (= (select |v_#length_106| 2) 1) (< |v_#StackHeapBarrier_37| |v_ULTIMATE.start_main_~#setPool~0#1.base_80|) (= v_~a~0_182 0) (= |v_#NULL.offset_19| 0))) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_19|, #StackHeapBarrier=|v_#StackHeapBarrier_37|, #valid=|v_#valid_175|, #memory_int=|v_#memory_int_77|, #length=|v_#length_106|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_19|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_19|} OutVars{ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_37|, #NULL.offset=|v_#NULL.offset_19|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_34|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_34|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_19|, ~a~0=v_~a~0_182, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_28|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_34|, #length=|v_#length_105|, ULTIMATE.start_main_#t~post4#1=|v_ULTIMATE.start_main_#t~post4#1_44|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_19|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_19|, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_80|, ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_30|, ULTIMATE.start_main_#t~post1#1=|v_ULTIMATE.start_main_#t~post1#1_41|, ~i~0=v_~i~0_202, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_80|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_30|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_30|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_37|, #NULL.base=|v_#NULL.base_19|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_47|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_42|, ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_64|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_30|, #StackHeapBarrier=|v_#StackHeapBarrier_37|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_29|, ~b~0=v_~b~0_189, #valid=|v_#valid_174|, ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_36|, #memory_int=|v_#memory_int_77|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_64|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8#1, #NULL.offset, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_~argv#1.base, ~a~0, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#t~post9#1, #length, ULTIMATE.start_main_#t~post4#1, ULTIMATE.start_main_~#checkPool~0#1.base, ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_#t~post1#1, ~i~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#setPool~0#1.base, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#in~argv#1.offset, ULTIMATE.start_main_#t~mem10#1, #NULL.base, ULTIMATE.start_main_#t~pre2#1, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~#checkPool~0#1.offset, ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#t~nondet3#1, ~b~0, #valid, ULTIMATE.start_main_#t~post7#1, ULTIMATE.start_main_~#setPool~0#1.offset] 109#[L702-5]don't care [494] L702-5-->L703-3: Formula: (let ((.cse0 (* v_~i~0_182 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_main_~#setPool~0#1.offset_50|))) (and (= |v_#pthreadsForks_41| |v_ULTIMATE.start_main_#t~pre2#1_41|) (<= (+ .cse0 |v_ULTIMATE.start_main_~#setPool~0#1.offset_50| 4) (select |v_#length_87| |v_ULTIMATE.start_main_~#setPool~0#1.base_62|)) (<= 0 .cse1) (= |v_#memory_int_63| (store |v_#memory_int_64| |v_ULTIMATE.start_main_~#setPool~0#1.base_62| (store (select |v_#memory_int_64| |v_ULTIMATE.start_main_~#setPool~0#1.base_62|) .cse1 |v_ULTIMATE.start_main_#t~pre2#1_41|))) (= (select |v_#valid_146| |v_ULTIMATE.start_main_~#setPool~0#1.base_62|) 1) (= (+ |v_#pthreadsForks_41| 1) |v_#pthreadsForks_40|) (< v_~i~0_182 50)))) InVars {#pthreadsForks=|v_#pthreadsForks_41|, ~i~0=v_~i~0_182, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_62|, #valid=|v_#valid_146|, #memory_int=|v_#memory_int_64|, #length=|v_#length_87|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_50|} OutVars{#pthreadsForks=|v_#pthreadsForks_40|, ~i~0=v_~i~0_182, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_62|, #valid=|v_#valid_146|, #memory_int=|v_#memory_int_63|, #length=|v_#length_87|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_50|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_41|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre2#1] 113#[L703-3]don't care [420] L703-3-->setThreadENTRY: Formula: (and (= 0 |v_setThreadThread1of2ForFork0_#in~param.base_4|) (= v_setThreadThread1of2ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre2#1_32|) (= 0 |v_setThreadThread1of2ForFork0_#in~param.offset_4|)) InVars {ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_32|} OutVars{setThreadThread1of2ForFork0_~param.offset=v_setThreadThread1of2ForFork0_~param.offset_4, setThreadThread1of2ForFork0_#in~param.base=|v_setThreadThread1of2ForFork0_#in~param.base_4|, setThreadThread1of2ForFork0_#res.base=|v_setThreadThread1of2ForFork0_#res.base_4|, setThreadThread1of2ForFork0_#in~param.offset=|v_setThreadThread1of2ForFork0_#in~param.offset_4|, setThreadThread1of2ForFork0_~param.base=v_setThreadThread1of2ForFork0_~param.base_4, setThreadThread1of2ForFork0_thidvar0=v_setThreadThread1of2ForFork0_thidvar0_2, setThreadThread1of2ForFork0_#res.offset=|v_setThreadThread1of2ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_32|} AuxVars[] AssignedVars[setThreadThread1of2ForFork0_~param.offset, setThreadThread1of2ForFork0_#in~param.base, setThreadThread1of2ForFork0_#res.base, setThreadThread1of2ForFork0_#in~param.offset, setThreadThread1of2ForFork0_~param.base, setThreadThread1of2ForFork0_thidvar0, setThreadThread1of2ForFork0_#res.offset] 119#[L703-4, setThreadENTRY]don't care [365] L703-4-->L703-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre2#1] 129#[L703-5, setThreadENTRY]don't care [496] L703-5-->L702-5: Formula: (= v_~i~0_186 (+ v_~i~0_187 1)) InVars {~i~0=v_~i~0_187} OutVars{ULTIMATE.start_main_#t~post1#1=|v_ULTIMATE.start_main_#t~post1#1_33|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_23|, ~i~0=v_~i~0_186} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post1#1, ULTIMATE.start_main_#t~nondet3#1, ~i~0] 143#[L702-5, setThreadENTRY]don't care [494] L702-5-->L703-3: Formula: (let ((.cse0 (* v_~i~0_182 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_main_~#setPool~0#1.offset_50|))) (and (= |v_#pthreadsForks_41| |v_ULTIMATE.start_main_#t~pre2#1_41|) (<= (+ .cse0 |v_ULTIMATE.start_main_~#setPool~0#1.offset_50| 4) (select |v_#length_87| |v_ULTIMATE.start_main_~#setPool~0#1.base_62|)) (<= 0 .cse1) (= |v_#memory_int_63| (store |v_#memory_int_64| |v_ULTIMATE.start_main_~#setPool~0#1.base_62| (store (select |v_#memory_int_64| |v_ULTIMATE.start_main_~#setPool~0#1.base_62|) .cse1 |v_ULTIMATE.start_main_#t~pre2#1_41|))) (= (select |v_#valid_146| |v_ULTIMATE.start_main_~#setPool~0#1.base_62|) 1) (= (+ |v_#pthreadsForks_41| 1) |v_#pthreadsForks_40|) (< v_~i~0_182 50)))) InVars {#pthreadsForks=|v_#pthreadsForks_41|, ~i~0=v_~i~0_182, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_62|, #valid=|v_#valid_146|, #memory_int=|v_#memory_int_64|, #length=|v_#length_87|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_50|} OutVars{#pthreadsForks=|v_#pthreadsForks_40|, ~i~0=v_~i~0_182, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_62|, #valid=|v_#valid_146|, #memory_int=|v_#memory_int_63|, #length=|v_#length_87|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_50|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_41|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre2#1] 155#[L703-3, setThreadENTRY]don't care [421] L703-3-->setThreadENTRY: Formula: (and (= |v_setThreadThread2of2ForFork0_#in~param.base_4| 0) (= v_setThreadThread2of2ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre2#1_34|) (= |v_setThreadThread2of2ForFork0_#in~param.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_34|} OutVars{setThreadThread2of2ForFork0_#in~param.base=|v_setThreadThread2of2ForFork0_#in~param.base_4|, setThreadThread2of2ForFork0_~param.offset=v_setThreadThread2of2ForFork0_~param.offset_4, setThreadThread2of2ForFork0_thidvar0=v_setThreadThread2of2ForFork0_thidvar0_2, setThreadThread2of2ForFork0_~param.base=v_setThreadThread2of2ForFork0_~param.base_4, setThreadThread2of2ForFork0_#in~param.offset=|v_setThreadThread2of2ForFork0_#in~param.offset_4|, setThreadThread2of2ForFork0_#res.base=|v_setThreadThread2of2ForFork0_#res.base_4|, setThreadThread2of2ForFork0_#res.offset=|v_setThreadThread2of2ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_34|} AuxVars[] AssignedVars[setThreadThread2of2ForFork0_#in~param.base, setThreadThread2of2ForFork0_~param.offset, setThreadThread2of2ForFork0_thidvar0, setThreadThread2of2ForFork0_~param.base, setThreadThread2of2ForFork0_#in~param.offset, setThreadThread2of2ForFork0_#res.base, setThreadThread2of2ForFork0_#res.offset] 173#[setThreadENTRY, L703-4, setThreadENTRY]don't care [365] L703-4-->L703-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre2#1] 203#[setThreadENTRY, L703-5, setThreadENTRY]don't care [496] L703-5-->L702-5: Formula: (= v_~i~0_186 (+ v_~i~0_187 1)) InVars {~i~0=v_~i~0_187} OutVars{ULTIMATE.start_main_#t~post1#1=|v_ULTIMATE.start_main_#t~post1#1_33|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_23|, ~i~0=v_~i~0_186} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post1#1, ULTIMATE.start_main_#t~nondet3#1, ~i~0] 247#[setThreadENTRY, L702-5, setThreadENTRY]don't care [494] L702-5-->L703-3: Formula: (let ((.cse0 (* v_~i~0_182 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_main_~#setPool~0#1.offset_50|))) (and (= |v_#pthreadsForks_41| |v_ULTIMATE.start_main_#t~pre2#1_41|) (<= (+ .cse0 |v_ULTIMATE.start_main_~#setPool~0#1.offset_50| 4) (select |v_#length_87| |v_ULTIMATE.start_main_~#setPool~0#1.base_62|)) (<= 0 .cse1) (= |v_#memory_int_63| (store |v_#memory_int_64| |v_ULTIMATE.start_main_~#setPool~0#1.base_62| (store (select |v_#memory_int_64| |v_ULTIMATE.start_main_~#setPool~0#1.base_62|) .cse1 |v_ULTIMATE.start_main_#t~pre2#1_41|))) (= (select |v_#valid_146| |v_ULTIMATE.start_main_~#setPool~0#1.base_62|) 1) (= (+ |v_#pthreadsForks_41| 1) |v_#pthreadsForks_40|) (< v_~i~0_182 50)))) InVars {#pthreadsForks=|v_#pthreadsForks_41|, ~i~0=v_~i~0_182, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_62|, #valid=|v_#valid_146|, #memory_int=|v_#memory_int_64|, #length=|v_#length_87|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_50|} OutVars{#pthreadsForks=|v_#pthreadsForks_40|, ~i~0=v_~i~0_182, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_62|, #valid=|v_#valid_146|, #memory_int=|v_#memory_int_63|, #length=|v_#length_87|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_50|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_41|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre2#1] 297#[setThreadENTRY, L703-3, setThreadENTRY]don't care [418] L703-3-->ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 355#[setThreadENTRY, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, setThreadENTRY]don't care [2022-07-22 12:28:52,776 INFO L750 eck$LassoCheckResult]: Loop: 355#[setThreadENTRY, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, setThreadENTRY]don't care [419] ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 355#[setThreadENTRY, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, setThreadENTRY]don't care [2022-07-22 12:28:52,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:28:52,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1647127288, now seen corresponding path program 1 times [2022-07-22 12:28:52,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:28:52,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438739731] [2022-07-22 12:28:52,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:28:52,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:28:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:28:52,814 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:28:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:28:52,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:28:52,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:28:52,865 INFO L85 PathProgramCache]: Analyzing trace with hash 450, now seen corresponding path program 1 times [2022-07-22 12:28:52,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:28:52,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099783566] [2022-07-22 12:28:52,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:28:52,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:28:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:28:52,885 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:28:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:28:52,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:28:52,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:28:52,890 INFO L85 PathProgramCache]: Analyzing trace with hash 478662043, now seen corresponding path program 1 times [2022-07-22 12:28:52,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:28:52,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190331397] [2022-07-22 12:28:52,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:28:52,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:28:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:28:52,917 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:28:52,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:28:52,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:28:53,723 WARN L146 chiAutomizerObserver]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-07-22 12:28:53,745 INFO L144 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2022-07-22 12:28:53,752 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 120 places, 128 transitions, 334 flow [2022-07-22 12:28:54,174 INFO L129 PetriNetUnfolder]: 501/2273 cut-off events. [2022-07-22 12:28:54,174 INFO L130 PetriNetUnfolder]: For 419/419 co-relation queries the response was YES. [2022-07-22 12:28:54,193 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2724 conditions, 2273 events. 501/2273 cut-off events. For 419/419 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 14909 event pairs, 64 based on Foata normal form. 0/1965 useless extension candidates. Maximal degree in co-relation 1393. Up to 192 conditions per place. [2022-07-22 12:28:54,194 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 128 transitions, 334 flow [2022-07-22 12:28:54,255 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 128 transitions, 334 flow [2022-07-22 12:28:54,256 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-22 12:28:54,256 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 128 transitions, 334 flow [2022-07-22 12:28:54,257 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 128 transitions, 334 flow [2022-07-22 12:28:54,258 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 120 places, 128 transitions, 334 flow [2022-07-22 12:28:54,607 INFO L129 PetriNetUnfolder]: 501/2273 cut-off events. [2022-07-22 12:28:54,607 INFO L130 PetriNetUnfolder]: For 419/419 co-relation queries the response was YES. [2022-07-22 12:28:54,621 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2724 conditions, 2273 events. 501/2273 cut-off events. For 419/419 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 15055 event pairs, 32 based on Foata normal form. 0/1965 useless extension candidates. Maximal degree in co-relation 1393. Up to 192 conditions per place. [2022-07-22 12:28:54,678 INFO L116 LiptonReduction]: Number of co-enabled transitions 5112 [2022-07-22 12:28:56,971 INFO L131 LiptonReduction]: Checked pairs total: 12301 [2022-07-22 12:28:56,971 INFO L133 LiptonReduction]: Total number of compositions: 93 [2022-07-22 12:28:56,973 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:28:56,974 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:28:56,974 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:28:56,974 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:28:56,974 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:28:56,974 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:28:56,974 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:28:56,974 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:28:56,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:28:59,351 INFO L131 ngComponentsAnalysis]: Automaton has 347 accepting balls. 347 [2022-07-22 12:28:59,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:28:59,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:28:59,352 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 1, 1, 1, 1, 1] [2022-07-22 12:28:59,352 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:28:59,352 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:28:59,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 17513 states, but on-demand construction may add more states [2022-07-22 12:28:59,940 INFO L131 ngComponentsAnalysis]: Automaton has 347 accepting balls. 347 [2022-07-22 12:28:59,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:28:59,941 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:28:59,944 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 1, 1, 1, 1, 1] [2022-07-22 12:28:59,944 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:28:59,945 INFO L748 eck$LassoCheckResult]: Stem: 123#[ULTIMATE.startENTRY]don't care [751] ULTIMATE.startENTRY-->L702-5: Formula: (let ((.cse0 (select |v_#memory_int_111| 1)) (.cse1 (store |v_#valid_247| |v_ULTIMATE.start_main_~#setPool~0#1.base_113| 1))) (and (= |v_ULTIMATE.start_main_~argc#1_47| |v_ULTIMATE.start_main_#in~argc#1_45|) (= |v_ULTIMATE.start_main_#in~argv#1.offset_47| |v_ULTIMATE.start_#in~argv#1.offset_30|) (= |v_ULTIMATE.start_main_~#checkPool~0#1.offset_91| 0) (= v_~b~0_402 0) (= |v_ULTIMATE.start_main_#in~argv#1.offset_47| |v_ULTIMATE.start_main_~argv#1.offset_51|) (= (select .cse0 1) 0) (= (select |v_#valid_247| 1) 1) (= (select .cse1 |v_ULTIMATE.start_main_~#checkPool~0#1.base_113|) 0) (= (select (select |v_#memory_int_111| 2) 0) 0) (= |v_ULTIMATE.start_main_#in~argv#1.base_47| |v_ULTIMATE.start_main_~argv#1.base_51|) (= |v_#NULL.base_30| 0) (= (select .cse0 0) 48) (= v_~i~0_297 0) (= (select |v_#valid_247| |v_ULTIMATE.start_main_~#setPool~0#1.base_113|) 0) (< 0 |v_#StackHeapBarrier_56|) (= |v_#NULL.offset_30| 0) (= (select |v_#valid_247| 0) 0) (< |v_#StackHeapBarrier_56| |v_ULTIMATE.start_main_~#setPool~0#1.base_113|) (= (select |v_#length_152| 2) 1) (= (select |v_#valid_247| 2) 1) (= (store (store |v_#length_152| |v_ULTIMATE.start_main_~#setPool~0#1.base_113| 200) |v_ULTIMATE.start_main_~#checkPool~0#1.base_113| 4) |v_#length_151|) (= |v_ULTIMATE.start_#in~argv#1.base_30| |v_ULTIMATE.start_main_#in~argv#1.base_47|) (< |v_#StackHeapBarrier_56| |v_ULTIMATE.start_main_~#checkPool~0#1.base_113|) (= v_~a~0_360 0) (= |v_ULTIMATE.start_main_~#setPool~0#1.offset_89| 0) (= |v_ULTIMATE.start_#in~argc#1_30| |v_ULTIMATE.start_main_#in~argc#1_45|) (= 2 (select |v_#length_152| 1)) (= |v_#valid_246| (store .cse1 |v_ULTIMATE.start_main_~#checkPool~0#1.base_113| 1)))) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_30|, #StackHeapBarrier=|v_#StackHeapBarrier_56|, #valid=|v_#valid_247|, #memory_int=|v_#memory_int_111|, #length=|v_#length_152|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_30|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_30|} OutVars{ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_60|, #NULL.offset=|v_#NULL.offset_30|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_51|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_51|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_30|, ~a~0=v_~a~0_360, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_45|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_49|, #length=|v_#length_151|, ULTIMATE.start_main_#t~post4#1=|v_ULTIMATE.start_main_#t~post4#1_63|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_30|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_30|, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_113|, ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_47|, ULTIMATE.start_main_#t~post1#1=|v_ULTIMATE.start_main_#t~post1#1_60|, ~i~0=v_~i~0_297, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_55|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_113|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_43|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_47|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_60|, #NULL.base=|v_#NULL.base_30|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_73|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_63|, ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_91|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_47|, #StackHeapBarrier=|v_#StackHeapBarrier_56|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_44|, ~b~0=v_~b~0_402, #valid=|v_#valid_246|, ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_51|, #memory_int=|v_#memory_int_111|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_89|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8#1, #NULL.offset, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_~argv#1.base, ~a~0, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#t~post9#1, #length, ULTIMATE.start_main_#t~post4#1, ULTIMATE.start_main_~#checkPool~0#1.base, ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_#t~post1#1, ~i~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#setPool~0#1.base, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#in~argv#1.offset, ULTIMATE.start_main_#t~mem10#1, #NULL.base, ULTIMATE.start_main_#t~pre2#1, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~#checkPool~0#1.offset, ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#t~nondet3#1, ~b~0, #valid, ULTIMATE.start_main_#t~post7#1, ULTIMATE.start_main_~#setPool~0#1.offset] 126#[L702-5]don't care [733] L702-5-->L703-3: Formula: (let ((.cse1 (* v_~i~0_285 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_main_~#setPool~0#1.offset_77|))) (and (= (store |v_#memory_int_102| |v_ULTIMATE.start_main_~#setPool~0#1.base_99| (store (select |v_#memory_int_102| |v_ULTIMATE.start_main_~#setPool~0#1.base_99|) .cse0 |v_ULTIMATE.start_main_#t~pre2#1_67|)) |v_#memory_int_101|) (= |v_#pthreadsForks_74| (+ |v_#pthreadsForks_75| 1)) (< v_~i~0_285 50) (<= (+ .cse1 |v_ULTIMATE.start_main_~#setPool~0#1.offset_77| 4) (select |v_#length_133| |v_ULTIMATE.start_main_~#setPool~0#1.base_99|)) (<= 0 .cse0) (= (select |v_#valid_224| |v_ULTIMATE.start_main_~#setPool~0#1.base_99|) 1) (= |v_#pthreadsForks_75| |v_ULTIMATE.start_main_#t~pre2#1_67|)))) InVars {#pthreadsForks=|v_#pthreadsForks_75|, ~i~0=v_~i~0_285, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_99|, #valid=|v_#valid_224|, #memory_int=|v_#memory_int_102|, #length=|v_#length_133|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_77|} OutVars{#pthreadsForks=|v_#pthreadsForks_74|, ~i~0=v_~i~0_285, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_99|, #valid=|v_#valid_224|, #memory_int=|v_#memory_int_101|, #length=|v_#length_133|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_77|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_67|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre2#1] 130#[L703-3]don't care [639] L703-3-->setThreadENTRY: Formula: (and (= v_setThreadThread1of3ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre2#1_56|) (= 0 |v_setThreadThread1of3ForFork0_#in~param.base_4|) (= |v_setThreadThread1of3ForFork0_#in~param.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_56|} OutVars{setThreadThread1of3ForFork0_#in~param.base=|v_setThreadThread1of3ForFork0_#in~param.base_4|, setThreadThread1of3ForFork0_#res.offset=|v_setThreadThread1of3ForFork0_#res.offset_4|, setThreadThread1of3ForFork0_~param.offset=v_setThreadThread1of3ForFork0_~param.offset_4, setThreadThread1of3ForFork0_#in~param.offset=|v_setThreadThread1of3ForFork0_#in~param.offset_4|, setThreadThread1of3ForFork0_~param.base=v_setThreadThread1of3ForFork0_~param.base_4, setThreadThread1of3ForFork0_thidvar0=v_setThreadThread1of3ForFork0_thidvar0_2, setThreadThread1of3ForFork0_#res.base=|v_setThreadThread1of3ForFork0_#res.base_4|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_56|} AuxVars[] AssignedVars[setThreadThread1of3ForFork0_#in~param.base, setThreadThread1of3ForFork0_#res.offset, setThreadThread1of3ForFork0_~param.offset, setThreadThread1of3ForFork0_#in~param.offset, setThreadThread1of3ForFork0_~param.base, setThreadThread1of3ForFork0_thidvar0, setThreadThread1of3ForFork0_#res.base] 136#[L703-4, setThreadENTRY]don't care [572] L703-4-->L703-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre2#1] 146#[L703-5, setThreadENTRY]don't care [732] L703-5-->L702-5: Formula: (= (+ v_~i~0_282 1) v_~i~0_281) InVars {~i~0=v_~i~0_282} OutVars{ULTIMATE.start_main_#t~post1#1=|v_ULTIMATE.start_main_#t~post1#1_52|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_38|, ~i~0=v_~i~0_281} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post1#1, ULTIMATE.start_main_#t~nondet3#1, ~i~0] 160#[L702-5, setThreadENTRY]don't care [733] L702-5-->L703-3: Formula: (let ((.cse1 (* v_~i~0_285 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_main_~#setPool~0#1.offset_77|))) (and (= (store |v_#memory_int_102| |v_ULTIMATE.start_main_~#setPool~0#1.base_99| (store (select |v_#memory_int_102| |v_ULTIMATE.start_main_~#setPool~0#1.base_99|) .cse0 |v_ULTIMATE.start_main_#t~pre2#1_67|)) |v_#memory_int_101|) (= |v_#pthreadsForks_74| (+ |v_#pthreadsForks_75| 1)) (< v_~i~0_285 50) (<= (+ .cse1 |v_ULTIMATE.start_main_~#setPool~0#1.offset_77| 4) (select |v_#length_133| |v_ULTIMATE.start_main_~#setPool~0#1.base_99|)) (<= 0 .cse0) (= (select |v_#valid_224| |v_ULTIMATE.start_main_~#setPool~0#1.base_99|) 1) (= |v_#pthreadsForks_75| |v_ULTIMATE.start_main_#t~pre2#1_67|)))) InVars {#pthreadsForks=|v_#pthreadsForks_75|, ~i~0=v_~i~0_285, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_99|, #valid=|v_#valid_224|, #memory_int=|v_#memory_int_102|, #length=|v_#length_133|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_77|} OutVars{#pthreadsForks=|v_#pthreadsForks_74|, ~i~0=v_~i~0_285, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_99|, #valid=|v_#valid_224|, #memory_int=|v_#memory_int_101|, #length=|v_#length_133|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_77|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_67|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre2#1] 172#[L703-3, setThreadENTRY]don't care [640] L703-3-->setThreadENTRY: Formula: (and (= |v_setThreadThread2of3ForFork0_#in~param.offset_4| 0) (= v_setThreadThread2of3ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre2#1_58|) (= |v_setThreadThread2of3ForFork0_#in~param.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_58|} OutVars{setThreadThread2of3ForFork0_#res.offset=|v_setThreadThread2of3ForFork0_#res.offset_4|, setThreadThread2of3ForFork0_~param.base=v_setThreadThread2of3ForFork0_~param.base_4, setThreadThread2of3ForFork0_~param.offset=v_setThreadThread2of3ForFork0_~param.offset_4, setThreadThread2of3ForFork0_#res.base=|v_setThreadThread2of3ForFork0_#res.base_4|, setThreadThread2of3ForFork0_thidvar0=v_setThreadThread2of3ForFork0_thidvar0_2, setThreadThread2of3ForFork0_#in~param.base=|v_setThreadThread2of3ForFork0_#in~param.base_4|, setThreadThread2of3ForFork0_#in~param.offset=|v_setThreadThread2of3ForFork0_#in~param.offset_4|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_58|} AuxVars[] AssignedVars[setThreadThread2of3ForFork0_#res.offset, setThreadThread2of3ForFork0_~param.base, setThreadThread2of3ForFork0_~param.offset, setThreadThread2of3ForFork0_#res.base, setThreadThread2of3ForFork0_thidvar0, setThreadThread2of3ForFork0_#in~param.base, setThreadThread2of3ForFork0_#in~param.offset] 190#[setThreadENTRY, setThreadENTRY, L703-4]don't care [572] L703-4-->L703-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre2#1] 220#[setThreadENTRY, setThreadENTRY, L703-5]don't care [732] L703-5-->L702-5: Formula: (= (+ v_~i~0_282 1) v_~i~0_281) InVars {~i~0=v_~i~0_282} OutVars{ULTIMATE.start_main_#t~post1#1=|v_ULTIMATE.start_main_#t~post1#1_52|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_38|, ~i~0=v_~i~0_281} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post1#1, ULTIMATE.start_main_#t~nondet3#1, ~i~0] 264#[setThreadENTRY, setThreadENTRY, L702-5]don't care [733] L702-5-->L703-3: Formula: (let ((.cse1 (* v_~i~0_285 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_main_~#setPool~0#1.offset_77|))) (and (= (store |v_#memory_int_102| |v_ULTIMATE.start_main_~#setPool~0#1.base_99| (store (select |v_#memory_int_102| |v_ULTIMATE.start_main_~#setPool~0#1.base_99|) .cse0 |v_ULTIMATE.start_main_#t~pre2#1_67|)) |v_#memory_int_101|) (= |v_#pthreadsForks_74| (+ |v_#pthreadsForks_75| 1)) (< v_~i~0_285 50) (<= (+ .cse1 |v_ULTIMATE.start_main_~#setPool~0#1.offset_77| 4) (select |v_#length_133| |v_ULTIMATE.start_main_~#setPool~0#1.base_99|)) (<= 0 .cse0) (= (select |v_#valid_224| |v_ULTIMATE.start_main_~#setPool~0#1.base_99|) 1) (= |v_#pthreadsForks_75| |v_ULTIMATE.start_main_#t~pre2#1_67|)))) InVars {#pthreadsForks=|v_#pthreadsForks_75|, ~i~0=v_~i~0_285, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_99|, #valid=|v_#valid_224|, #memory_int=|v_#memory_int_102|, #length=|v_#length_133|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_77|} OutVars{#pthreadsForks=|v_#pthreadsForks_74|, ~i~0=v_~i~0_285, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_99|, #valid=|v_#valid_224|, #memory_int=|v_#memory_int_101|, #length=|v_#length_133|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_77|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_67|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre2#1] 314#[setThreadENTRY, L703-3, setThreadENTRY]don't care [641] L703-3-->setThreadENTRY: Formula: (and (= |v_setThreadThread3of3ForFork0_#in~param.base_4| 0) (= |v_setThreadThread3of3ForFork0_#in~param.offset_4| 0) (= v_setThreadThread3of3ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre2#1_60|)) InVars {ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_60|} OutVars{setThreadThread3of3ForFork0_#res.offset=|v_setThreadThread3of3ForFork0_#res.offset_4|, setThreadThread3of3ForFork0_~param.base=v_setThreadThread3of3ForFork0_~param.base_4, setThreadThread3of3ForFork0_thidvar0=v_setThreadThread3of3ForFork0_thidvar0_2, setThreadThread3of3ForFork0_~param.offset=v_setThreadThread3of3ForFork0_~param.offset_4, setThreadThread3of3ForFork0_#in~param.base=|v_setThreadThread3of3ForFork0_#in~param.base_4|, setThreadThread3of3ForFork0_#in~param.offset=|v_setThreadThread3of3ForFork0_#in~param.offset_4|, setThreadThread3of3ForFork0_#res.base=|v_setThreadThread3of3ForFork0_#res.base_4|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_60|} AuxVars[] AssignedVars[setThreadThread3of3ForFork0_#res.offset, setThreadThread3of3ForFork0_~param.base, setThreadThread3of3ForFork0_thidvar0, setThreadThread3of3ForFork0_~param.offset, setThreadThread3of3ForFork0_#in~param.base, setThreadThread3of3ForFork0_#in~param.offset, setThreadThread3of3ForFork0_#res.base] 372#[setThreadENTRY, setThreadENTRY, L703-4, setThreadENTRY]don't care [572] L703-4-->L703-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre2#1] 448#[setThreadENTRY, setThreadENTRY, L703-5, setThreadENTRY]don't care [732] L703-5-->L702-5: Formula: (= (+ v_~i~0_282 1) v_~i~0_281) InVars {~i~0=v_~i~0_282} OutVars{ULTIMATE.start_main_#t~post1#1=|v_ULTIMATE.start_main_#t~post1#1_52|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_38|, ~i~0=v_~i~0_281} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post1#1, ULTIMATE.start_main_#t~nondet3#1, ~i~0] 562#[setThreadENTRY, setThreadENTRY, L702-5, setThreadENTRY]don't care [733] L702-5-->L703-3: Formula: (let ((.cse1 (* v_~i~0_285 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_main_~#setPool~0#1.offset_77|))) (and (= (store |v_#memory_int_102| |v_ULTIMATE.start_main_~#setPool~0#1.base_99| (store (select |v_#memory_int_102| |v_ULTIMATE.start_main_~#setPool~0#1.base_99|) .cse0 |v_ULTIMATE.start_main_#t~pre2#1_67|)) |v_#memory_int_101|) (= |v_#pthreadsForks_74| (+ |v_#pthreadsForks_75| 1)) (< v_~i~0_285 50) (<= (+ .cse1 |v_ULTIMATE.start_main_~#setPool~0#1.offset_77| 4) (select |v_#length_133| |v_ULTIMATE.start_main_~#setPool~0#1.base_99|)) (<= 0 .cse0) (= (select |v_#valid_224| |v_ULTIMATE.start_main_~#setPool~0#1.base_99|) 1) (= |v_#pthreadsForks_75| |v_ULTIMATE.start_main_#t~pre2#1_67|)))) InVars {#pthreadsForks=|v_#pthreadsForks_75|, ~i~0=v_~i~0_285, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_99|, #valid=|v_#valid_224|, #memory_int=|v_#memory_int_102|, #length=|v_#length_133|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_77|} OutVars{#pthreadsForks=|v_#pthreadsForks_74|, ~i~0=v_~i~0_285, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_99|, #valid=|v_#valid_224|, #memory_int=|v_#memory_int_101|, #length=|v_#length_133|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_77|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_67|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre2#1] 718#[setThreadENTRY, setThreadENTRY, L703-3, setThreadENTRY]don't care [637] L703-3-->ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 908#[ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, setThreadENTRY, setThreadENTRY, setThreadENTRY]don't care [2022-07-22 12:28:59,946 INFO L750 eck$LassoCheckResult]: Loop: 908#[ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, setThreadENTRY, setThreadENTRY, setThreadENTRY]don't care [638] ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 908#[ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, setThreadENTRY, setThreadENTRY, setThreadENTRY]don't care [2022-07-22 12:28:59,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:28:59,946 INFO L85 PathProgramCache]: Analyzing trace with hash 36374519, now seen corresponding path program 1 times [2022-07-22 12:28:59,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:28:59,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342206384] [2022-07-22 12:28:59,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:28:59,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:28:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:28:59,981 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:28:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:29:00,010 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:29:00,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:29:00,011 INFO L85 PathProgramCache]: Analyzing trace with hash 669, now seen corresponding path program 1 times [2022-07-22 12:29:00,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:29:00,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671703070] [2022-07-22 12:29:00,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:29:00,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:29:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:29:00,025 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:29:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:29:00,032 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:29:00,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:29:00,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1127610727, now seen corresponding path program 1 times [2022-07-22 12:29:00,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:29:00,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562602129] [2022-07-22 12:29:00,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:29:00,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:29:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:29:00,085 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:29:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:29:00,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:29:01,345 WARN L146 chiAutomizerObserver]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-07-22 12:29:01,372 INFO L144 ThreadInstanceAdder]: Constructed 16 joinOtherThreadTransitions. [2022-07-22 12:29:01,384 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 137 places, 146 transitions, 404 flow [2022-07-22 12:29:03,045 INFO L129 PetriNetUnfolder]: 2385/8732 cut-off events. [2022-07-22 12:29:03,046 INFO L130 PetriNetUnfolder]: For 2144/2144 co-relation queries the response was YES. [2022-07-22 12:29:03,143 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10897 conditions, 8732 events. 2385/8732 cut-off events. For 2144/2144 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 74816 event pairs, 626 based on Foata normal form. 0/7628 useless extension candidates. Maximal degree in co-relation 5376. Up to 1024 conditions per place. [2022-07-22 12:29:03,143 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 146 transitions, 404 flow [2022-07-22 12:29:03,415 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 146 transitions, 404 flow [2022-07-22 12:29:03,415 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-22 12:29:03,415 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 146 transitions, 404 flow [2022-07-22 12:29:03,416 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 146 transitions, 404 flow [2022-07-22 12:29:03,416 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 137 places, 146 transitions, 404 flow [2022-07-22 12:29:04,945 INFO L129 PetriNetUnfolder]: 2385/8732 cut-off events. [2022-07-22 12:29:04,946 INFO L130 PetriNetUnfolder]: For 2144/2144 co-relation queries the response was YES. [2022-07-22 12:29:05,018 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10897 conditions, 8732 events. 2385/8732 cut-off events. For 2144/2144 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 74968 event pairs, 626 based on Foata normal form. 0/7628 useless extension candidates. Maximal degree in co-relation 5376. Up to 1024 conditions per place. [2022-07-22 12:29:05,222 INFO L116 LiptonReduction]: Number of co-enabled transitions 7864 [2022-07-22 12:29:08,180 INFO L131 LiptonReduction]: Checked pairs total: 21041 [2022-07-22 12:29:08,180 INFO L133 LiptonReduction]: Total number of compositions: 105 [2022-07-22 12:29:08,182 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:29:08,183 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:29:08,183 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:29:08,183 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:29:08,183 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:29:08,183 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:29:08,183 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:29:08,183 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:29:08,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:29:38,482 INFO L131 ngComponentsAnalysis]: Automaton has 2017 accepting balls. 2017 [2022-07-22 12:29:38,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:29:38,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:29:38,483 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1, 1, 1, 1, 1] [2022-07-22 12:29:38,483 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:29:38,484 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:29:38,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 198701 states, but on-demand construction may add more states [2022-07-22 12:29:44,577 INFO L131 ngComponentsAnalysis]: Automaton has 2017 accepting balls. 2017 [2022-07-22 12:29:44,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:29:44,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:29:44,579 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1, 1, 1, 1, 1] [2022-07-22 12:29:44,579 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:29:44,580 INFO L748 eck$LassoCheckResult]: Stem: 140#[ULTIMATE.startENTRY]don't care [1018] ULTIMATE.startENTRY-->L702-5: Formula: (let ((.cse0 (store |v_#valid_333| |v_ULTIMATE.start_main_~#setPool~0#1.base_150| 1)) (.cse1 (select |v_#memory_int_152| 1))) (and (= (select |v_#length_210| 2) 1) (= v_~a~0_593 0) (= |v_ULTIMATE.start_main_~#checkPool~0#1.offset_122| 0) (= |v_#valid_332| (store .cse0 |v_ULTIMATE.start_main_~#checkPool~0#1.base_152| 1)) (= |v_ULTIMATE.start_main_#in~argv#1.offset_64| |v_ULTIMATE.start_#in~argv#1.offset_43|) (= |v_#NULL.offset_43| 0) (= (select |v_#valid_333| 1) 1) (= |v_ULTIMATE.start_main_~argc#1_62| |v_ULTIMATE.start_main_#in~argc#1_62|) (= (select |v_#valid_333| 0) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#checkPool~0#1.base_152|) 0) (= 2 (select |v_#length_210| 1)) (< 0 |v_#StackHeapBarrier_79|) (= (store (store |v_#length_210| |v_ULTIMATE.start_main_~#setPool~0#1.base_150| 200) |v_ULTIMATE.start_main_~#checkPool~0#1.base_152| 4) |v_#length_209|) (= |v_ULTIMATE.start_main_#in~argv#1.offset_64| |v_ULTIMATE.start_main_~argv#1.offset_68|) (= (select |v_#valid_333| 2) 1) (< |v_#StackHeapBarrier_79| |v_ULTIMATE.start_main_~#setPool~0#1.base_150|) (= |v_#NULL.base_43| 0) (= (select .cse1 0) 48) (= |v_ULTIMATE.start_#in~argc#1_43| |v_ULTIMATE.start_main_#in~argc#1_62|) (= (select .cse1 1) 0) (= (select (select |v_#memory_int_152| 2) 0) 0) (= |v_ULTIMATE.start_main_#in~argv#1.base_64| |v_ULTIMATE.start_main_~argv#1.base_68|) (= v_~b~0_663 0) (< |v_#StackHeapBarrier_79| |v_ULTIMATE.start_main_~#checkPool~0#1.base_152|) (= |v_ULTIMATE.start_#in~argv#1.base_43| |v_ULTIMATE.start_main_#in~argv#1.base_64|) (= |v_ULTIMATE.start_main_~#setPool~0#1.offset_120| 0) (= (select |v_#valid_333| |v_ULTIMATE.start_main_~#setPool~0#1.base_150|) 0) (= v_~i~0_389 0))) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_43|, #StackHeapBarrier=|v_#StackHeapBarrier_79|, #valid=|v_#valid_333|, #memory_int=|v_#memory_int_152|, #length=|v_#length_210|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_43|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_43|} OutVars{ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_91|, #NULL.offset=|v_#NULL.offset_43|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_68|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_68|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_43|, ~a~0=v_~a~0_593, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_62|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_68|, #length=|v_#length_209|, ULTIMATE.start_main_#t~post4#1=|v_ULTIMATE.start_main_#t~post4#1_86|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_43|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_43|, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_152|, ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_62|, ULTIMATE.start_main_#t~post1#1=|v_ULTIMATE.start_main_#t~post1#1_86|, ~i~0=v_~i~0_389, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_74|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_150|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_60|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_64|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_91|, #NULL.base=|v_#NULL.base_43|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_107|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_90|, ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_122|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_64|, #StackHeapBarrier=|v_#StackHeapBarrier_79|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_64|, ~b~0=v_~b~0_663, #valid=|v_#valid_332|, ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_72|, #memory_int=|v_#memory_int_152|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_120|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8#1, #NULL.offset, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_~argv#1.base, ~a~0, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#t~post9#1, #length, ULTIMATE.start_main_#t~post4#1, ULTIMATE.start_main_~#checkPool~0#1.base, ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_#t~post1#1, ~i~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#setPool~0#1.base, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#in~argv#1.offset, ULTIMATE.start_main_#t~mem10#1, #NULL.base, ULTIMATE.start_main_#t~pre2#1, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~#checkPool~0#1.offset, ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#t~nondet3#1, ~b~0, #valid, ULTIMATE.start_main_#t~post7#1, ULTIMATE.start_main_~#setPool~0#1.offset] 143#[L702-5]don't care [987] L702-5-->L703-3: Formula: (let ((.cse0 (* v_~i~0_367 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_main_~#setPool~0#1.offset_106|))) (and (<= (+ .cse0 |v_ULTIMATE.start_main_~#setPool~0#1.offset_106| 4) (select |v_#length_185| |v_ULTIMATE.start_main_~#setPool~0#1.base_134|)) (< v_~i~0_367 50) (= (select |v_#valid_294| |v_ULTIMATE.start_main_~#setPool~0#1.base_134|) 1) (<= 0 .cse1) (= (store |v_#memory_int_137| |v_ULTIMATE.start_main_~#setPool~0#1.base_134| (store (select |v_#memory_int_137| |v_ULTIMATE.start_main_~#setPool~0#1.base_134|) .cse1 |v_ULTIMATE.start_main_#t~pre2#1_99|)) |v_#memory_int_136|) (= |v_#pthreadsForks_95| (+ |v_#pthreadsForks_96| 1)) (= |v_#pthreadsForks_96| |v_ULTIMATE.start_main_#t~pre2#1_99|)))) InVars {#pthreadsForks=|v_#pthreadsForks_96|, ~i~0=v_~i~0_367, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_134|, #valid=|v_#valid_294|, #memory_int=|v_#memory_int_137|, #length=|v_#length_185|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_106|} OutVars{#pthreadsForks=|v_#pthreadsForks_95|, ~i~0=v_~i~0_367, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_134|, #valid=|v_#valid_294|, #memory_int=|v_#memory_int_136|, #length=|v_#length_185|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_106|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_99|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre2#1] 147#[L703-3]don't care [888] L703-3-->setThreadENTRY: Formula: (and (= 0 |v_setThreadThread1of4ForFork0_#in~param.base_4|) (= |v_setThreadThread1of4ForFork0_#in~param.offset_4| 0) (= v_setThreadThread1of4ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre2#1_84|)) InVars {ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_84|} OutVars{setThreadThread1of4ForFork0_#res.offset=|v_setThreadThread1of4ForFork0_#res.offset_4|, setThreadThread1of4ForFork0_~param.base=v_setThreadThread1of4ForFork0_~param.base_4, setThreadThread1of4ForFork0_#res.base=|v_setThreadThread1of4ForFork0_#res.base_4|, setThreadThread1of4ForFork0_#in~param.base=|v_setThreadThread1of4ForFork0_#in~param.base_4|, setThreadThread1of4ForFork0_thidvar0=v_setThreadThread1of4ForFork0_thidvar0_2, setThreadThread1of4ForFork0_~param.offset=v_setThreadThread1of4ForFork0_~param.offset_4, setThreadThread1of4ForFork0_#in~param.offset=|v_setThreadThread1of4ForFork0_#in~param.offset_4|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_84|} AuxVars[] AssignedVars[setThreadThread1of4ForFork0_#res.offset, setThreadThread1of4ForFork0_~param.base, setThreadThread1of4ForFork0_#res.base, setThreadThread1of4ForFork0_#in~param.base, setThreadThread1of4ForFork0_thidvar0, setThreadThread1of4ForFork0_~param.offset, setThreadThread1of4ForFork0_#in~param.offset] 153#[L703-4, setThreadENTRY]don't care [809] L703-4-->L703-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre2#1] 163#[setThreadENTRY, L703-5]don't care [990] L703-5-->L702-5: Formula: (= (+ v_~i~0_370 1) v_~i~0_369) InVars {~i~0=v_~i~0_370} OutVars{ULTIMATE.start_main_#t~post1#1=|v_ULTIMATE.start_main_#t~post1#1_76|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_56|, ~i~0=v_~i~0_369} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post1#1, ULTIMATE.start_main_#t~nondet3#1, ~i~0] 177#[setThreadENTRY, L702-5]don't care [987] L702-5-->L703-3: Formula: (let ((.cse0 (* v_~i~0_367 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_main_~#setPool~0#1.offset_106|))) (and (<= (+ .cse0 |v_ULTIMATE.start_main_~#setPool~0#1.offset_106| 4) (select |v_#length_185| |v_ULTIMATE.start_main_~#setPool~0#1.base_134|)) (< v_~i~0_367 50) (= (select |v_#valid_294| |v_ULTIMATE.start_main_~#setPool~0#1.base_134|) 1) (<= 0 .cse1) (= (store |v_#memory_int_137| |v_ULTIMATE.start_main_~#setPool~0#1.base_134| (store (select |v_#memory_int_137| |v_ULTIMATE.start_main_~#setPool~0#1.base_134|) .cse1 |v_ULTIMATE.start_main_#t~pre2#1_99|)) |v_#memory_int_136|) (= |v_#pthreadsForks_95| (+ |v_#pthreadsForks_96| 1)) (= |v_#pthreadsForks_96| |v_ULTIMATE.start_main_#t~pre2#1_99|)))) InVars {#pthreadsForks=|v_#pthreadsForks_96|, ~i~0=v_~i~0_367, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_134|, #valid=|v_#valid_294|, #memory_int=|v_#memory_int_137|, #length=|v_#length_185|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_106|} OutVars{#pthreadsForks=|v_#pthreadsForks_95|, ~i~0=v_~i~0_367, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_134|, #valid=|v_#valid_294|, #memory_int=|v_#memory_int_136|, #length=|v_#length_185|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_106|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_99|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre2#1] 189#[setThreadENTRY, L703-3]don't care [889] L703-3-->setThreadENTRY: Formula: (and (= |v_setThreadThread2of4ForFork0_#in~param.base_4| 0) (= 0 |v_setThreadThread2of4ForFork0_#in~param.offset_4|) (= |v_ULTIMATE.start_main_#t~pre2#1_86| v_setThreadThread2of4ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_86|} OutVars{setThreadThread2of4ForFork0_#res.base=|v_setThreadThread2of4ForFork0_#res.base_4|, setThreadThread2of4ForFork0_#res.offset=|v_setThreadThread2of4ForFork0_#res.offset_4|, setThreadThread2of4ForFork0_~param.base=v_setThreadThread2of4ForFork0_~param.base_4, setThreadThread2of4ForFork0_#in~param.offset=|v_setThreadThread2of4ForFork0_#in~param.offset_4|, setThreadThread2of4ForFork0_#in~param.base=|v_setThreadThread2of4ForFork0_#in~param.base_4|, setThreadThread2of4ForFork0_thidvar0=v_setThreadThread2of4ForFork0_thidvar0_2, setThreadThread2of4ForFork0_~param.offset=v_setThreadThread2of4ForFork0_~param.offset_4, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_86|} AuxVars[] AssignedVars[setThreadThread2of4ForFork0_#res.base, setThreadThread2of4ForFork0_#res.offset, setThreadThread2of4ForFork0_~param.base, setThreadThread2of4ForFork0_#in~param.offset, setThreadThread2of4ForFork0_#in~param.base, setThreadThread2of4ForFork0_thidvar0, setThreadThread2of4ForFork0_~param.offset] 207#[setThreadENTRY, L703-4, setThreadENTRY]don't care [809] L703-4-->L703-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre2#1] 235#[L703-5, setThreadENTRY, setThreadENTRY]don't care [990] L703-5-->L702-5: Formula: (= (+ v_~i~0_370 1) v_~i~0_369) InVars {~i~0=v_~i~0_370} OutVars{ULTIMATE.start_main_#t~post1#1=|v_ULTIMATE.start_main_#t~post1#1_76|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_56|, ~i~0=v_~i~0_369} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post1#1, ULTIMATE.start_main_#t~nondet3#1, ~i~0] 279#[L702-5, setThreadENTRY, setThreadENTRY]don't care [987] L702-5-->L703-3: Formula: (let ((.cse0 (* v_~i~0_367 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_main_~#setPool~0#1.offset_106|))) (and (<= (+ .cse0 |v_ULTIMATE.start_main_~#setPool~0#1.offset_106| 4) (select |v_#length_185| |v_ULTIMATE.start_main_~#setPool~0#1.base_134|)) (< v_~i~0_367 50) (= (select |v_#valid_294| |v_ULTIMATE.start_main_~#setPool~0#1.base_134|) 1) (<= 0 .cse1) (= (store |v_#memory_int_137| |v_ULTIMATE.start_main_~#setPool~0#1.base_134| (store (select |v_#memory_int_137| |v_ULTIMATE.start_main_~#setPool~0#1.base_134|) .cse1 |v_ULTIMATE.start_main_#t~pre2#1_99|)) |v_#memory_int_136|) (= |v_#pthreadsForks_95| (+ |v_#pthreadsForks_96| 1)) (= |v_#pthreadsForks_96| |v_ULTIMATE.start_main_#t~pre2#1_99|)))) InVars {#pthreadsForks=|v_#pthreadsForks_96|, ~i~0=v_~i~0_367, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_134|, #valid=|v_#valid_294|, #memory_int=|v_#memory_int_137|, #length=|v_#length_185|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_106|} OutVars{#pthreadsForks=|v_#pthreadsForks_95|, ~i~0=v_~i~0_367, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_134|, #valid=|v_#valid_294|, #memory_int=|v_#memory_int_136|, #length=|v_#length_185|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_106|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_99|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre2#1] 331#[setThreadENTRY, setThreadENTRY, L703-3]don't care [890] L703-3-->setThreadENTRY: Formula: (and (= v_setThreadThread3of4ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre2#1_88|) (= |v_setThreadThread3of4ForFork0_#in~param.offset_4| 0) (= |v_setThreadThread3of4ForFork0_#in~param.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_88|} OutVars{setThreadThread3of4ForFork0_#res.base=|v_setThreadThread3of4ForFork0_#res.base_4|, setThreadThread3of4ForFork0_#in~param.offset=|v_setThreadThread3of4ForFork0_#in~param.offset_4|, setThreadThread3of4ForFork0_#in~param.base=|v_setThreadThread3of4ForFork0_#in~param.base_4|, setThreadThread3of4ForFork0_#res.offset=|v_setThreadThread3of4ForFork0_#res.offset_4|, setThreadThread3of4ForFork0_~param.base=v_setThreadThread3of4ForFork0_~param.base_4, setThreadThread3of4ForFork0_thidvar0=v_setThreadThread3of4ForFork0_thidvar0_2, setThreadThread3of4ForFork0_~param.offset=v_setThreadThread3of4ForFork0_~param.offset_4, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_88|} AuxVars[] AssignedVars[setThreadThread3of4ForFork0_#res.base, setThreadThread3of4ForFork0_#in~param.offset, setThreadThread3of4ForFork0_#in~param.base, setThreadThread3of4ForFork0_#res.offset, setThreadThread3of4ForFork0_~param.base, setThreadThread3of4ForFork0_thidvar0, setThreadThread3of4ForFork0_~param.offset] 389#[setThreadENTRY, setThreadENTRY, L703-4, setThreadENTRY]don't care [809] L703-4-->L703-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre2#1] 467#[setThreadENTRY, L703-5, setThreadENTRY, setThreadENTRY]don't care [990] L703-5-->L702-5: Formula: (= (+ v_~i~0_370 1) v_~i~0_369) InVars {~i~0=v_~i~0_370} OutVars{ULTIMATE.start_main_#t~post1#1=|v_ULTIMATE.start_main_#t~post1#1_76|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_56|, ~i~0=v_~i~0_369} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post1#1, ULTIMATE.start_main_#t~nondet3#1, ~i~0] 583#[setThreadENTRY, L702-5, setThreadENTRY, setThreadENTRY]don't care [987] L702-5-->L703-3: Formula: (let ((.cse0 (* v_~i~0_367 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_main_~#setPool~0#1.offset_106|))) (and (<= (+ .cse0 |v_ULTIMATE.start_main_~#setPool~0#1.offset_106| 4) (select |v_#length_185| |v_ULTIMATE.start_main_~#setPool~0#1.base_134|)) (< v_~i~0_367 50) (= (select |v_#valid_294| |v_ULTIMATE.start_main_~#setPool~0#1.base_134|) 1) (<= 0 .cse1) (= (store |v_#memory_int_137| |v_ULTIMATE.start_main_~#setPool~0#1.base_134| (store (select |v_#memory_int_137| |v_ULTIMATE.start_main_~#setPool~0#1.base_134|) .cse1 |v_ULTIMATE.start_main_#t~pre2#1_99|)) |v_#memory_int_136|) (= |v_#pthreadsForks_95| (+ |v_#pthreadsForks_96| 1)) (= |v_#pthreadsForks_96| |v_ULTIMATE.start_main_#t~pre2#1_99|)))) InVars {#pthreadsForks=|v_#pthreadsForks_96|, ~i~0=v_~i~0_367, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_134|, #valid=|v_#valid_294|, #memory_int=|v_#memory_int_137|, #length=|v_#length_185|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_106|} OutVars{#pthreadsForks=|v_#pthreadsForks_95|, ~i~0=v_~i~0_367, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_134|, #valid=|v_#valid_294|, #memory_int=|v_#memory_int_136|, #length=|v_#length_185|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_106|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_99|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre2#1] 737#[L703-3, setThreadENTRY, setThreadENTRY, setThreadENTRY]don't care [891] L703-3-->setThreadENTRY: Formula: (and (= v_setThreadThread4of4ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre2#1_90|) (= |v_setThreadThread4of4ForFork0_#in~param.offset_4| 0) (= |v_setThreadThread4of4ForFork0_#in~param.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_90|} OutVars{setThreadThread4of4ForFork0_~param.offset=v_setThreadThread4of4ForFork0_~param.offset_4, setThreadThread4of4ForFork0_#in~param.offset=|v_setThreadThread4of4ForFork0_#in~param.offset_4|, setThreadThread4of4ForFork0_#in~param.base=|v_setThreadThread4of4ForFork0_#in~param.base_4|, setThreadThread4of4ForFork0_#res.base=|v_setThreadThread4of4ForFork0_#res.base_4|, setThreadThread4of4ForFork0_thidvar0=v_setThreadThread4of4ForFork0_thidvar0_2, setThreadThread4of4ForFork0_#res.offset=|v_setThreadThread4of4ForFork0_#res.offset_4|, setThreadThread4of4ForFork0_~param.base=v_setThreadThread4of4ForFork0_~param.base_4, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_90|} AuxVars[] AssignedVars[setThreadThread4of4ForFork0_~param.offset, setThreadThread4of4ForFork0_#in~param.offset, setThreadThread4of4ForFork0_#in~param.base, setThreadThread4of4ForFork0_#res.base, setThreadThread4of4ForFork0_thidvar0, setThreadThread4of4ForFork0_#res.offset, setThreadThread4of4ForFork0_~param.base] 925#[setThreadENTRY, setThreadENTRY, setThreadENTRY, setThreadENTRY, L703-4]don't care [809] L703-4-->L703-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre2#1] 1157#[L703-5, setThreadENTRY, setThreadENTRY, setThreadENTRY, setThreadENTRY]don't care [990] L703-5-->L702-5: Formula: (= (+ v_~i~0_370 1) v_~i~0_369) InVars {~i~0=v_~i~0_370} OutVars{ULTIMATE.start_main_#t~post1#1=|v_ULTIMATE.start_main_#t~post1#1_76|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_56|, ~i~0=v_~i~0_369} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post1#1, ULTIMATE.start_main_#t~nondet3#1, ~i~0] 1469#[L702-5, setThreadENTRY, setThreadENTRY, setThreadENTRY, setThreadENTRY]don't care [987] L702-5-->L703-3: Formula: (let ((.cse0 (* v_~i~0_367 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_main_~#setPool~0#1.offset_106|))) (and (<= (+ .cse0 |v_ULTIMATE.start_main_~#setPool~0#1.offset_106| 4) (select |v_#length_185| |v_ULTIMATE.start_main_~#setPool~0#1.base_134|)) (< v_~i~0_367 50) (= (select |v_#valid_294| |v_ULTIMATE.start_main_~#setPool~0#1.base_134|) 1) (<= 0 .cse1) (= (store |v_#memory_int_137| |v_ULTIMATE.start_main_~#setPool~0#1.base_134| (store (select |v_#memory_int_137| |v_ULTIMATE.start_main_~#setPool~0#1.base_134|) .cse1 |v_ULTIMATE.start_main_#t~pre2#1_99|)) |v_#memory_int_136|) (= |v_#pthreadsForks_95| (+ |v_#pthreadsForks_96| 1)) (= |v_#pthreadsForks_96| |v_ULTIMATE.start_main_#t~pre2#1_99|)))) InVars {#pthreadsForks=|v_#pthreadsForks_96|, ~i~0=v_~i~0_367, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_134|, #valid=|v_#valid_294|, #memory_int=|v_#memory_int_137|, #length=|v_#length_185|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_106|} OutVars{#pthreadsForks=|v_#pthreadsForks_95|, ~i~0=v_~i~0_367, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_134|, #valid=|v_#valid_294|, #memory_int=|v_#memory_int_136|, #length=|v_#length_185|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_106|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_99|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre2#1] 1893#[setThreadENTRY, setThreadENTRY, setThreadENTRY, setThreadENTRY, L703-3]don't care [886] L703-3-->ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2443#[setThreadENTRY, setThreadENTRY, setThreadENTRY, setThreadENTRY, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [2022-07-22 12:29:44,580 INFO L750 eck$LassoCheckResult]: Loop: 2443#[setThreadENTRY, setThreadENTRY, setThreadENTRY, setThreadENTRY, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [887] ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2443#[setThreadENTRY, setThreadENTRY, setThreadENTRY, setThreadENTRY, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [2022-07-22 12:29:44,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:29:44,581 INFO L85 PathProgramCache]: Analyzing trace with hash -536476638, now seen corresponding path program 1 times [2022-07-22 12:29:44,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:29:44,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602532896] [2022-07-22 12:29:44,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:29:44,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:29:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:29:44,605 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:29:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:29:44,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:29:44,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:29:44,631 INFO L85 PathProgramCache]: Analyzing trace with hash 918, now seen corresponding path program 1 times [2022-07-22 12:29:44,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:29:44,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300008205] [2022-07-22 12:29:44,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:29:44,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:29:44,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:29:44,637 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:29:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:29:44,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:29:44,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:29:44,641 INFO L85 PathProgramCache]: Analyzing trace with hash 549094293, now seen corresponding path program 1 times [2022-07-22 12:29:44,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:29:44,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837117966] [2022-07-22 12:29:44,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:29:44,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:29:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:29:44,665 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:29:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:29:44,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:29:46,819 WARN L146 chiAutomizerObserver]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2022-07-22 12:29:46,851 INFO L144 ThreadInstanceAdder]: Constructed 20 joinOtherThreadTransitions. [2022-07-22 12:29:46,855 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 154 places, 164 transitions, 478 flow [2022-07-22 12:29:52,611 INFO L129 PetriNetUnfolder]: 11379/35583 cut-off events. [2022-07-22 12:29:52,611 INFO L130 PetriNetUnfolder]: For 10450/10450 co-relation queries the response was YES. [2022-07-22 12:29:53,010 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46009 conditions, 35583 events. 11379/35583 cut-off events. For 10450/10450 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 383003 event pairs, 4296 based on Foata normal form. 0/31373 useless extension candidates. Maximal degree in co-relation 22281. Up to 5120 conditions per place. [2022-07-22 12:29:53,011 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 164 transitions, 478 flow [2022-07-22 12:29:53,976 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 164 transitions, 478 flow [2022-07-22 12:29:53,976 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-22 12:29:53,976 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 164 transitions, 478 flow [2022-07-22 12:29:53,977 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 164 transitions, 478 flow [2022-07-22 12:29:53,977 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 154 places, 164 transitions, 478 flow [2022-07-22 12:29:59,108 INFO L129 PetriNetUnfolder]: 11379/35583 cut-off events. [2022-07-22 12:29:59,108 INFO L130 PetriNetUnfolder]: For 10450/10450 co-relation queries the response was YES. [2022-07-22 12:29:59,514 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46009 conditions, 35583 events. 11379/35583 cut-off events. For 10450/10450 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 378630 event pairs, 2148 based on Foata normal form. 0/31373 useless extension candidates. Maximal degree in co-relation 22281. Up to 5120 conditions per place. [2022-07-22 12:30:00,527 INFO L116 LiptonReduction]: Number of co-enabled transitions 11140 [2022-07-22 12:30:03,357 INFO L131 LiptonReduction]: Checked pairs total: 28543 [2022-07-22 12:30:03,357 INFO L133 LiptonReduction]: Total number of compositions: 117 [2022-07-22 12:30:03,359 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:30:03,359 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:30:03,359 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:30:03,359 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:30:03,359 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:30:03,359 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:30:03,359 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:30:03,360 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:30:03,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states Received shutdown request... [2022-07-22 12:32:12,646 WARN L321 stractBuchiCegarLoop]: Verification cancelled [2022-07-22 12:32:12,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.07 12:32:12 BoogieIcfgContainer [2022-07-22 12:32:12,652 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-22 12:32:12,653 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-07-22 12:32:12,660 INFO L158 Benchmark]: Toolchain (without parser) took 208415.56ms. Allocated memory was 152.0MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 125.4MB in the beginning and 4.2GB in the end (delta: -4.0GB). Peak memory consumption was 4.0GB. Max. memory is 8.0GB. [2022-07-22 12:32:12,664 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 152.0MB. Free memory is still 122.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:32:12,665 INFO L158 Benchmark]: CACSL2BoogieTranslator took 554.53ms. Allocated memory is still 152.0MB. Free memory was 125.2MB in the beginning and 106.6MB in the end (delta: 18.6MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-07-22 12:32:12,666 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.34ms. Allocated memory is still 152.0MB. Free memory was 106.6MB in the beginning and 104.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:32:12,668 INFO L158 Benchmark]: Boogie Preprocessor took 35.18ms. Allocated memory is still 152.0MB. Free memory was 104.6MB in the beginning and 103.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:32:12,669 INFO L158 Benchmark]: RCFGBuilder took 676.23ms. Allocated memory is still 152.0MB. Free memory was 103.2MB in the beginning and 123.8MB in the end (delta: -20.7MB). Peak memory consumption was 5.7MB. Max. memory is 8.0GB. [2022-07-22 12:32:12,669 INFO L158 Benchmark]: BuchiAutomizer took 207082.94ms. Allocated memory was 152.0MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 123.8MB in the beginning and 4.2GB in the end (delta: -4.0GB). Peak memory consumption was 4.0GB. Max. memory is 8.0GB. [2022-07-22 12:32:12,680 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 152.0MB. Free memory is still 122.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 554.53ms. Allocated memory is still 152.0MB. Free memory was 125.2MB in the beginning and 106.6MB in the end (delta: 18.6MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.34ms. Allocated memory is still 152.0MB. Free memory was 106.6MB in the beginning and 104.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.18ms. Allocated memory is still 152.0MB. Free memory was 104.6MB in the beginning and 103.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 676.23ms. Allocated memory is still 152.0MB. Free memory was 103.2MB in the beginning and 123.8MB in the end (delta: -20.7MB). Peak memory consumption was 5.7MB. Max. memory is 8.0GB. * BuchiAutomizer took 207082.94ms. Allocated memory was 152.0MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 123.8MB in the beginning and 4.2GB in the end (delta: -4.0GB). Peak memory consumption was 4.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Trivial decomposition into one module whose termination is unknown. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 161.2s and 4 iterations. TraceHistogramMax:5. Analysis of lassos took 5.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: LassoAnalysisResults: nont4 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 31.9s - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Buchi Automizer is unable to decide termination: Timeout while executing BuchiIsEmpty. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 86 PlacesBefore, 27 PlacesAfterwards, 92 TransitionsBefore, 28 TransitionsAfterwards, 1180 CoEnabledTransitionPairs, 6 FixpointIterations, 21 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 5 ChoiceCompositions, 71 TotalNumberOfCompositions, 2241 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1908, positive: 1873, positive conditional: 0, positive unconditional: 1873, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 947, positive: 934, positive conditional: 0, positive unconditional: 934, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 947, positive: 934, positive conditional: 0, positive unconditional: 934, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 28, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1908, positive: 939, positive conditional: 0, positive unconditional: 939, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 947, unknown conditional: 0, unknown unconditional: 947] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 84, Positive conditional cache size: 0, Positive unconditional cache size: 84, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 103 PlacesBefore, 38 PlacesAfterwards, 110 TransitionsBefore, 39 TransitionsAfterwards, 2884 CoEnabledTransitionPairs, 6 FixpointIterations, 21 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 6 ChoiceCompositions, 81 TotalNumberOfCompositions, 6929 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5176, positive: 5107, positive conditional: 0, positive unconditional: 5107, negative: 69, negative conditional: 0, negative unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2210, positive: 2176, positive conditional: 0, positive unconditional: 2176, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2210, positive: 2172, positive conditional: 0, positive unconditional: 2172, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 38, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 74, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 65, negative conditional: 0, negative unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5176, positive: 2931, positive conditional: 0, positive unconditional: 2931, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 2210, unknown conditional: 0, unknown unconditional: 2210] , Statistics on independence cache: Total cache size (in pairs): 259, Positive cache size: 251, Positive conditional cache size: 0, Positive unconditional cache size: 251, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 120 PlacesBefore, 47 PlacesAfterwards, 128 TransitionsBefore, 48 TransitionsAfterwards, 5112 CoEnabledTransitionPairs, 5 FixpointIterations, 21 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 7 ChoiceCompositions, 93 TotalNumberOfCompositions, 12301 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10732, positive: 10648, positive conditional: 0, positive unconditional: 10648, negative: 84, negative conditional: 0, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4345, positive: 4296, positive conditional: 0, positive unconditional: 4296, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4345, positive: 4280, positive conditional: 0, positive unconditional: 4280, negative: 65, negative conditional: 0, negative unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 65, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 86, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 69, negative conditional: 0, negative unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10732, positive: 6352, positive conditional: 0, positive unconditional: 6352, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 4345, unknown conditional: 0, unknown unconditional: 4345] , Statistics on independence cache: Total cache size (in pairs): 502, Positive cache size: 491, Positive conditional cache size: 0, Positive unconditional cache size: 491, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.8s, 137 PlacesBefore, 56 PlacesAfterwards, 146 TransitionsBefore, 57 TransitionsAfterwards, 7864 CoEnabledTransitionPairs, 6 FixpointIterations, 21 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 19 ConcurrentYvCompositions, 8 ChoiceCompositions, 105 TotalNumberOfCompositions, 21041 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 17736, positive: 17604, positive conditional: 0, positive unconditional: 17604, negative: 132, negative conditional: 0, negative unconditional: 132, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6297, positive: 6245, positive conditional: 0, positive unconditional: 6245, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6297, positive: 6219, positive conditional: 0, positive unconditional: 6219, negative: 78, negative conditional: 0, negative unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 78, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 112, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 85, negative conditional: 0, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17736, positive: 11359, positive conditional: 0, positive unconditional: 11359, negative: 80, negative conditional: 0, negative unconditional: 80, unknown: 6297, unknown conditional: 0, unknown unconditional: 6297] , Statistics on independence cache: Total cache size (in pairs): 773, Positive cache size: 757, Positive conditional cache size: 0, Positive unconditional cache size: 757, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.4s, 154 PlacesBefore, 65 PlacesAfterwards, 164 TransitionsBefore, 66 TransitionsAfterwards, 11140 CoEnabledTransitionPairs, 5 FixpointIterations, 21 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 25 ConcurrentYvCompositions, 9 ChoiceCompositions, 117 TotalNumberOfCompositions, 28543 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 20611, positive: 20472, positive conditional: 0, positive unconditional: 20472, negative: 139, negative conditional: 0, negative unconditional: 139, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9031, positive: 8952, positive conditional: 0, positive unconditional: 8952, negative: 79, negative conditional: 0, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9031, positive: 8916, positive conditional: 0, positive unconditional: 8916, negative: 115, negative conditional: 0, negative unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 115, positive: 36, positive conditional: 0, positive unconditional: 36, negative: 79, negative conditional: 0, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 147, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 116, negative conditional: 0, negative unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20611, positive: 11520, positive conditional: 0, positive unconditional: 11520, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 9031, unknown conditional: 0, unknown unconditional: 9031] , Statistics on independence cache: Total cache size (in pairs): 967, Positive cache size: 948, Positive conditional cache size: 0, Positive unconditional cache size: 948, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown