/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-syntacticLbe.epf -i ../../../trunk/examples/svcomp/pthread-atomic/peterson-b.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-0d686a6 [2022-07-26 14:03:11,438 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-26 14:03:11,440 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-26 14:03:11,489 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-26 14:03:11,490 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-26 14:03:11,491 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-26 14:03:11,492 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-26 14:03:11,493 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-26 14:03:11,494 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-26 14:03:11,495 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-26 14:03:11,496 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-26 14:03:11,497 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-26 14:03:11,497 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-26 14:03:11,500 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-26 14:03:11,501 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-26 14:03:11,502 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-26 14:03:11,502 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-26 14:03:11,503 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-26 14:03:11,506 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-26 14:03:11,511 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-26 14:03:11,515 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-26 14:03:11,516 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-26 14:03:11,517 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-26 14:03:11,518 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-26 14:03:11,518 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-26 14:03:11,520 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-26 14:03:11,520 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-26 14:03:11,521 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-26 14:03:11,521 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-26 14:03:11,521 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-26 14:03:11,522 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-26 14:03:11,522 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-26 14:03:11,523 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-26 14:03:11,523 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-26 14:03:11,524 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-26 14:03:11,525 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-26 14:03:11,525 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-26 14:03:11,525 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-26 14:03:11,526 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-26 14:03:11,526 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-26 14:03:11,527 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-26 14:03:11,534 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-26 14:03:11,534 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf [2022-07-26 14:03:11,562 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-26 14:03:11,563 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-26 14:03:11,563 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-26 14:03:11,563 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-26 14:03:11,564 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-26 14:03:11,564 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-26 14:03:11,564 INFO L138 SettingsManager]: * Use SBE=true [2022-07-26 14:03:11,565 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-26 14:03:11,565 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-26 14:03:11,565 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-26 14:03:11,566 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-26 14:03:11,566 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-26 14:03:11,566 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-26 14:03:11,566 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-26 14:03:11,566 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-26 14:03:11,566 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-26 14:03:11,567 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-26 14:03:11,567 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-26 14:03:11,567 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-26 14:03:11,567 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-26 14:03:11,567 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-26 14:03:11,567 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-26 14:03:11,568 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-26 14:03:11,568 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-26 14:03:11,568 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-26 14:03:11,568 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-26 14:03:11,568 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-26 14:03:11,568 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-26 14:03:11,569 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-26 14:03:11,569 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-26 14:03:11,569 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-26 14:03:11,569 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-26 14:03:11,571 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-26 14:03:11,572 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-26 14:03:11,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-26 14:03:11,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-26 14:03:11,801 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-26 14:03:11,802 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-26 14:03:11,802 INFO L275 PluginConnector]: CDTParser initialized [2022-07-26 14:03:11,803 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/peterson-b.i [2022-07-26 14:03:11,862 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf7f554b2/dfef2cc3845b4f3dbbaa0b7490ca6393/FLAG7de2f982f [2022-07-26 14:03:12,276 INFO L306 CDTParser]: Found 1 translation units. [2022-07-26 14:03:12,276 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/peterson-b.i [2022-07-26 14:03:12,287 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf7f554b2/dfef2cc3845b4f3dbbaa0b7490ca6393/FLAG7de2f982f [2022-07-26 14:03:12,299 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf7f554b2/dfef2cc3845b4f3dbbaa0b7490ca6393 [2022-07-26 14:03:12,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-26 14:03:12,302 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-26 14:03:12,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-26 14:03:12,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-26 14:03:12,305 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-26 14:03:12,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 02:03:12" (1/1) ... [2022-07-26 14:03:12,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f6da78e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:03:12, skipping insertion in model container [2022-07-26 14:03:12,307 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 02:03:12" (1/1) ... [2022-07-26 14:03:12,312 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-26 14:03:12,337 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-26 14:03:12,568 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-atomic/peterson-b.i[30010,30023] [2022-07-26 14:03:12,571 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-atomic/peterson-b.i[30174,30187] [2022-07-26 14:03:12,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 14:03:12,582 INFO L203 MainTranslator]: Completed pre-run [2022-07-26 14:03:12,611 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-atomic/peterson-b.i[30010,30023] [2022-07-26 14:03:12,612 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-atomic/peterson-b.i[30174,30187] [2022-07-26 14:03:12,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 14:03:12,655 INFO L208 MainTranslator]: Completed translation [2022-07-26 14:03:12,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:03:12 WrapperNode [2022-07-26 14:03:12,656 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-26 14:03:12,657 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-26 14:03:12,657 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-26 14:03:12,657 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-26 14:03:12,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:03:12" (1/1) ... [2022-07-26 14:03:12,688 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:03:12" (1/1) ... [2022-07-26 14:03:12,704 INFO L137 Inliner]: procedures = 167, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 43 [2022-07-26 14:03:12,705 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-26 14:03:12,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-26 14:03:12,705 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-26 14:03:12,705 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-26 14:03:12,711 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:03:12" (1/1) ... [2022-07-26 14:03:12,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:03:12" (1/1) ... [2022-07-26 14:03:12,718 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:03:12" (1/1) ... [2022-07-26 14:03:12,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:03:12" (1/1) ... [2022-07-26 14:03:12,729 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:03:12" (1/1) ... [2022-07-26 14:03:12,732 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:03:12" (1/1) ... [2022-07-26 14:03:12,733 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:03:12" (1/1) ... [2022-07-26 14:03:12,735 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-26 14:03:12,735 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-26 14:03:12,735 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-26 14:03:12,736 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-26 14:03:12,741 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:03:12" (1/1) ... [2022-07-26 14:03:12,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:03:12,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:03:12,768 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-26 14:03:12,775 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-26 14:03:12,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-26 14:03:12,799 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2022-07-26 14:03:12,799 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2022-07-26 14:03:12,799 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-07-26 14:03:12,799 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-07-26 14:03:12,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-26 14:03:12,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-26 14:03:12,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-26 14:03:12,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-26 14:03:12,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-26 14:03:12,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-26 14:03:12,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-26 14:03:12,801 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-26 14:03:12,878 INFO L234 CfgBuilder]: Building ICFG [2022-07-26 14:03:12,880 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-26 14:03:13,063 INFO L275 CfgBuilder]: Performing block encoding [2022-07-26 14:03:13,069 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-26 14:03:13,070 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-26 14:03:13,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 02:03:13 BoogieIcfgContainer [2022-07-26 14:03:13,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-26 14:03:13,072 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-26 14:03:13,072 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-26 14:03:13,075 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-26 14:03:13,075 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:03:13,075 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.07 02:03:12" (1/3) ... [2022-07-26 14:03:13,076 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c3f5dd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 02:03:13, skipping insertion in model container [2022-07-26 14:03:13,076 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:03:13,076 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:03:12" (2/3) ... [2022-07-26 14:03:13,076 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c3f5dd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 02:03:13, skipping insertion in model container [2022-07-26 14:03:13,077 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:03:13,077 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 02:03:13" (3/3) ... [2022-07-26 14:03:13,078 INFO L322 chiAutomizerObserver]: Analyzing ICFG peterson-b.i [2022-07-26 14:03:13,136 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-26 14:03:13,161 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 75 places, 76 transitions, 168 flow [2022-07-26 14:03:13,190 INFO L129 PetriNetUnfolder]: 6/72 cut-off events. [2022-07-26 14:03:13,190 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 14:03:13,196 INFO L84 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 72 events. 6/72 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 55 event pairs, 0 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2022-07-26 14:03:13,196 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 76 transitions, 168 flow [2022-07-26 14:03:13,200 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 72 transitions, 156 flow [2022-07-26 14:03:13,203 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-26 14:03:13,210 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 72 transitions, 156 flow [2022-07-26 14:03:13,212 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 72 transitions, 156 flow [2022-07-26 14:03:13,213 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 73 places, 72 transitions, 156 flow [2022-07-26 14:03:13,228 INFO L129 PetriNetUnfolder]: 6/72 cut-off events. [2022-07-26 14:03:13,228 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 14:03:13,229 INFO L84 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 72 events. 6/72 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2022-07-26 14:03:13,230 INFO L116 LiptonReduction]: Number of co-enabled transitions 812 [2022-07-26 14:03:14,869 INFO L131 LiptonReduction]: Checked pairs total: 2143 [2022-07-26 14:03:14,870 INFO L133 LiptonReduction]: Total number of compositions: 49 [2022-07-26 14:03:14,884 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2022-07-26 14:03:14,885 INFO L302 stractBuchiCegarLoop]: Hoare is false [2022-07-26 14:03:14,885 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-26 14:03:14,885 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-26 14:03:14,885 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-26 14:03:14,885 INFO L306 stractBuchiCegarLoop]: Difference is false [2022-07-26 14:03:14,885 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-26 14:03:14,885 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-26 14:03:14,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-26 14:03:14,950 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 34 [2022-07-26 14:03:14,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:03:14,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:03:14,954 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-26 14:03:14,955 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:03:14,955 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-26 14:03:14,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 163 states, but on-demand construction may add more states [2022-07-26 14:03:14,965 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 34 [2022-07-26 14:03:14,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:03:14,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:03:14,966 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-26 14:03:14,966 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:03:14,970 INFO L733 eck$LassoCheckResult]: Stem: 78#[ULTIMATE.startENTRY]don't care [258] ULTIMATE.startENTRY-->L707-2: Formula: (let ((.cse0 (select |v_#memory_int_48| 1)) (.cse1 (store |v_#valid_93| |v_ULTIMATE.start_main_~#t1~0#1.base_39| 1))) (and (= (select |v_#length_60| 2) 11) (= (select |v_#valid_93| 1) 1) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t2~0#1.base_43|) (= (select .cse0 0) 48) (= v_~flag1~0_24 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= v_~flag2~0_24 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_33| 0) (= (select |v_#valid_93| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 0) (= (select |v_#valid_93| 0) 0) (= (select |v_#valid_93| 2) 1) (= (select .cse0 1) 0) (= |v_#pthreadsForks_38| |v_ULTIMATE.start_main_#t~pre3#1_27|) (= v_~x~0_20 0) (= |v_#NULL.offset_8| 0) (= |v_#pthreadsForks_37| (+ |v_#pthreadsForks_38| 1)) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_43| 1) |v_#valid_92|) (= v_~turn~0_16 0) (= (store (store |v_#length_60| |v_ULTIMATE.start_main_~#t1~0#1.base_39| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_43| 4) |v_#length_59|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_43|) 0) (= |v_#NULL.base_8| 0) (< 0 |v_#StackHeapBarrier_20|) (= |v_#memory_int_47| (store |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre3#1_27|))) (= (select |v_#length_60| 1) 2) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1~0#1.base_39|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #pthreadsForks=|v_#pthreadsForks_38|, #valid=|v_#valid_93|, #memory_int=|v_#memory_int_48|, #length=|v_#length_60|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_17|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_20|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_24|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_15|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, #NULL.base=|v_#NULL.base_8|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_25|, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_20|, #pthreadsForks=|v_#pthreadsForks_37|, ~flag2~0=v_~flag2~0_24, #valid=|v_#valid_92|, #memory_int=|v_#memory_int_47|, ~flag1~0=v_~flag1~0_24, #length=|v_#length_59|, ~turn~0=v_~turn~0_16, ~x~0=v_~x~0_20, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_27|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_43|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~mem7#1, #pthreadsForks, ~flag2~0, #valid, #memory_int, ~flag1~0, #length, ~turn~0, ~x~0, ULTIMATE.start_main_#t~pre3#1, ULTIMATE.start_main_~#t2~0#1.base] 81#[L707-2]don't care [207] L707-2-->thr1ENTRY: Formula: (and (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_thr1Thread1of1ForFork1_thidvar0_2) (= |v_thr1Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr1Thread1of1ForFork1_#in~_.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_4|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, thr1Thread1of1ForFork1_#res.base=|v_thr1Thread1of1ForFork1_#res.base_4|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_4|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_4, thr1Thread1of1ForFork1_#res.offset=|v_thr1Thread1of1ForFork1_#res.offset_4|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0] 83#[L707-3, thr1ENTRY]don't care [214] thr1ENTRY-->L689: Formula: (and (= |v_thr1Thread1of1ForFork1_#in~_.offset_5| v_thr1Thread1of1ForFork1_~_.offset_5) (= v_thr1Thread1of1ForFork1_~_.base_5 |v_thr1Thread1of1ForFork1_#in~_.base_5|) (= v_~flag1~0_8 1)) InVars {thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_5|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_5|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_5|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_5, ~flag1~0=v_~flag1~0_8, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_5|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_.base, ~flag1~0, thr1Thread1of1ForFork1_~_.offset] 85#[L707-3, L689]don't care [190] L689-->L690-2: Formula: (= v_~turn~0_6 1) InVars {} OutVars{~turn~0=v_~turn~0_6} AuxVars[] AssignedVars[~turn~0] 91#[L690-2, L707-3]don't care [2022-07-26 14:03:14,971 INFO L735 eck$LassoCheckResult]: Loop: 91#[L690-2, L707-3]don't care [193] L690-2-->L690-2: Formula: (and (= v_~flag2~0_4 1) (= v_~turn~0_5 1)) InVars {~turn~0=v_~turn~0_5, ~flag2~0=v_~flag2~0_4} OutVars{~turn~0=v_~turn~0_5, ~flag2~0=v_~flag2~0_4} AuxVars[] AssignedVars[] 91#[L690-2, L707-3]don't care [2022-07-26 14:03:14,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:03:14,975 INFO L85 PathProgramCache]: Analyzing trace with hash 8815350, now seen corresponding path program 1 times [2022-07-26 14:03:14,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:03:14,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654590375] [2022-07-26 14:03:14,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:03:14,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:03:15,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:15,064 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:03:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:15,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:03:15,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:03:15,105 INFO L85 PathProgramCache]: Analyzing trace with hash 224, now seen corresponding path program 1 times [2022-07-26 14:03:15,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:03:15,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693016721] [2022-07-26 14:03:15,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:03:15,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:03:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:15,133 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:03:15,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:15,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:03:15,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:03:15,138 INFO L85 PathProgramCache]: Analyzing trace with hash 273276043, now seen corresponding path program 1 times [2022-07-26 14:03:15,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:03:15,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957010820] [2022-07-26 14:03:15,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:03:15,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:03:15,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:03:15,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:03:15,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:03:15,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957010820] [2022-07-26 14:03:15,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957010820] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:03:15,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:03:15,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-26 14:03:15,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542396412] [2022-07-26 14:03:15,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:03:15,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:03:15,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-26 14:03:15,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-26 14:03:15,290 INFO L87 Difference]: Start difference. First operand currently 163 states, but on-demand construction may add more states Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:03:15,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:03:15,348 INFO L93 Difference]: Finished difference Result 164 states and 382 transitions. [2022-07-26 14:03:15,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 164 states and 382 transitions. [2022-07-26 14:03:15,354 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 28 [2022-07-26 14:03:15,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 164 states to 96 states and 222 transitions. [2022-07-26 14:03:15,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 [2022-07-26 14:03:15,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2022-07-26 14:03:15,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 222 transitions. [2022-07-26 14:03:15,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:03:15,363 INFO L220 hiAutomatonCegarLoop]: Abstraction has 96 states and 222 transitions. [2022-07-26 14:03:15,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 222 transitions. [2022-07-26 14:03:15,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-07-26 14:03:15,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 96 states have (on average 2.3125) internal successors, (222), 95 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:03:15,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 222 transitions. [2022-07-26 14:03:15,391 INFO L242 hiAutomatonCegarLoop]: Abstraction has 96 states and 222 transitions. [2022-07-26 14:03:15,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-26 14:03:15,395 INFO L426 stractBuchiCegarLoop]: Abstraction has 96 states and 222 transitions. [2022-07-26 14:03:15,395 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-26 14:03:15,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 222 transitions. [2022-07-26 14:03:15,397 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 28 [2022-07-26 14:03:15,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:03:15,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:03:15,397 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-26 14:03:15,397 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:03:15,398 INFO L733 eck$LassoCheckResult]: Stem: 763#[ULTIMATE.startENTRY]don't care [258] ULTIMATE.startENTRY-->L707-2: Formula: (let ((.cse0 (select |v_#memory_int_48| 1)) (.cse1 (store |v_#valid_93| |v_ULTIMATE.start_main_~#t1~0#1.base_39| 1))) (and (= (select |v_#length_60| 2) 11) (= (select |v_#valid_93| 1) 1) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t2~0#1.base_43|) (= (select .cse0 0) 48) (= v_~flag1~0_24 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= v_~flag2~0_24 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_33| 0) (= (select |v_#valid_93| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 0) (= (select |v_#valid_93| 0) 0) (= (select |v_#valid_93| 2) 1) (= (select .cse0 1) 0) (= |v_#pthreadsForks_38| |v_ULTIMATE.start_main_#t~pre3#1_27|) (= v_~x~0_20 0) (= |v_#NULL.offset_8| 0) (= |v_#pthreadsForks_37| (+ |v_#pthreadsForks_38| 1)) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_43| 1) |v_#valid_92|) (= v_~turn~0_16 0) (= (store (store |v_#length_60| |v_ULTIMATE.start_main_~#t1~0#1.base_39| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_43| 4) |v_#length_59|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_43|) 0) (= |v_#NULL.base_8| 0) (< 0 |v_#StackHeapBarrier_20|) (= |v_#memory_int_47| (store |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre3#1_27|))) (= (select |v_#length_60| 1) 2) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1~0#1.base_39|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #pthreadsForks=|v_#pthreadsForks_38|, #valid=|v_#valid_93|, #memory_int=|v_#memory_int_48|, #length=|v_#length_60|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_17|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_20|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_24|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_15|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, #NULL.base=|v_#NULL.base_8|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_25|, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_20|, #pthreadsForks=|v_#pthreadsForks_37|, ~flag2~0=v_~flag2~0_24, #valid=|v_#valid_92|, #memory_int=|v_#memory_int_47|, ~flag1~0=v_~flag1~0_24, #length=|v_#length_59|, ~turn~0=v_~turn~0_16, ~x~0=v_~x~0_20, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_27|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_43|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~mem7#1, #pthreadsForks, ~flag2~0, #valid, #memory_int, ~flag1~0, #length, ~turn~0, ~x~0, ULTIMATE.start_main_#t~pre3#1, ULTIMATE.start_main_~#t2~0#1.base] 759#[L707-2]don't care [207] L707-2-->thr1ENTRY: Formula: (and (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_thr1Thread1of1ForFork1_thidvar0_2) (= |v_thr1Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr1Thread1of1ForFork1_#in~_.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_4|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, thr1Thread1of1ForFork1_#res.base=|v_thr1Thread1of1ForFork1_#res.base_4|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_4|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_4, thr1Thread1of1ForFork1_#res.offset=|v_thr1Thread1of1ForFork1_#res.offset_4|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0] 761#[L707-3, thr1ENTRY]don't care [252] L707-3-->L708-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre5#1_21|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 4) (select |v_#length_51| |v_ULTIMATE.start_main_~#t2~0#1.base_35|)) (= (select |v_#valid_78| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) 1) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|) (= |v_#memory_int_37| (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre5#1_21|))) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_38|, #length=|v_#length_51|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_21|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_13|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_37|, #length=|v_#length_51|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~nondet4#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre3#1] 751#[L708-3, thr1ENTRY]don't care [204] L708-3-->thr2ENTRY: Formula: (and (= v_thr2Thread1of1ForFork0_thidvar2_2 0) (= |v_thr2Thread1of1ForFork0_#in~_.offset_4| 0) (= |v_thr2Thread1of1ForFork0_#in~_.base_4| 0) (= v_thr2Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre5#1_6| v_thr2Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|, thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_4, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_4|, thr2Thread1of1ForFork0_#res.base=|v_thr2Thread1of1ForFork0_#res.base_4|, thr2Thread1of1ForFork0_thidvar0=v_thr2Thread1of1ForFork0_thidvar0_2, thr2Thread1of1ForFork0_thidvar1=v_thr2Thread1of1ForFork0_thidvar1_2, thr2Thread1of1ForFork0_thidvar2=v_thr2Thread1of1ForFork0_thidvar2_2, thr2Thread1of1ForFork0_#res.offset=|v_thr2Thread1of1ForFork0_#res.offset_4|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_4|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_#in~_.offset, thr2Thread1of1ForFork0_#res.base, thr2Thread1of1ForFork0_thidvar0, thr2Thread1of1ForFork0_thidvar1, thr2Thread1of1ForFork0_thidvar2, thr2Thread1of1ForFork0_#res.offset, thr2Thread1of1ForFork0_#in~_.base, thr2Thread1of1ForFork0_~_.base] 701#[thr1ENTRY, L708-4, thr2ENTRY]don't care [227] thr2ENTRY-->L698: Formula: (and (= v_thr2Thread1of1ForFork0_~_.offset_5 |v_thr2Thread1of1ForFork0_#in~_.offset_5|) (= |v_thr2Thread1of1ForFork0_#in~_.base_5| v_thr2Thread1of1ForFork0_~_.base_5) (= v_~flag2~0_8 1)) InVars {thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_5|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_5|} OutVars{thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_5, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_5|, ~flag2~0=v_~flag2~0_8, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_5|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, ~flag2~0, thr2Thread1of1ForFork0_~_.base] 703#[thr1ENTRY, L708-4, L698]don't care [176] L698-->L699-2: Formula: (= v_~turn~0_1 0) InVars {} OutVars{~turn~0=v_~turn~0_1} AuxVars[] AssignedVars[~turn~0] 769#[thr1ENTRY, L708-4, L699-2]don't care [2022-07-26 14:03:15,398 INFO L735 eck$LassoCheckResult]: Loop: 769#[thr1ENTRY, L708-4, L699-2]don't care [179] L699-2-->L699-2: Formula: (and (= v_~turn~0_3 0) (= v_~flag1~0_2 1)) InVars {~turn~0=v_~turn~0_3, ~flag1~0=v_~flag1~0_2} OutVars{~turn~0=v_~turn~0_3, ~flag1~0=v_~flag1~0_2} AuxVars[] AssignedVars[] 769#[thr1ENTRY, L708-4, L699-2]don't care [2022-07-26 14:03:15,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:03:15,399 INFO L85 PathProgramCache]: Analyzing trace with hash -117230517, now seen corresponding path program 1 times [2022-07-26 14:03:15,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:03:15,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39113831] [2022-07-26 14:03:15,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:03:15,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:03:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:15,414 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:03:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:15,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:03:15,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:03:15,427 INFO L85 PathProgramCache]: Analyzing trace with hash 210, now seen corresponding path program 1 times [2022-07-26 14:03:15,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:03:15,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33723592] [2022-07-26 14:03:15,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:03:15,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:03:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:15,432 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:03:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:15,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:03:15,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:03:15,435 INFO L85 PathProgramCache]: Analyzing trace with hash 660821448, now seen corresponding path program 1 times [2022-07-26 14:03:15,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:03:15,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641398587] [2022-07-26 14:03:15,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:03:15,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:03:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:03:15,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 14:03:15,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:03:15,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641398587] [2022-07-26 14:03:15,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641398587] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:03:15,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:03:15,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-26 14:03:15,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746657889] [2022-07-26 14:03:15,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:03:15,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:03:15,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-26 14:03:15,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-26 14:03:15,482 INFO L87 Difference]: Start difference. First operand 96 states and 222 transitions. cyclomatic complexity: 154 Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:03:15,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:03:15,509 INFO L93 Difference]: Finished difference Result 96 states and 216 transitions. [2022-07-26 14:03:15,509 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 216 transitions. [2022-07-26 14:03:15,511 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 22 [2022-07-26 14:03:15,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 82 states and 189 transitions. [2022-07-26 14:03:15,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 82 [2022-07-26 14:03:15,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 82 [2022-07-26 14:03:15,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 189 transitions. [2022-07-26 14:03:15,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:03:15,515 INFO L220 hiAutomatonCegarLoop]: Abstraction has 82 states and 189 transitions. [2022-07-26 14:03:15,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 189 transitions. [2022-07-26 14:03:15,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-07-26 14:03:15,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 2.3048780487804876) internal successors, (189), 81 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:03:15,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 189 transitions. [2022-07-26 14:03:15,522 INFO L242 hiAutomatonCegarLoop]: Abstraction has 82 states and 189 transitions. [2022-07-26 14:03:15,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-26 14:03:15,523 INFO L426 stractBuchiCegarLoop]: Abstraction has 82 states and 189 transitions. [2022-07-26 14:03:15,523 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-26 14:03:15,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 189 transitions. [2022-07-26 14:03:15,525 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 22 [2022-07-26 14:03:15,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:03:15,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:03:15,525 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:03:15,525 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:03:15,526 INFO L733 eck$LassoCheckResult]: Stem: 1033#[ULTIMATE.startENTRY]don't care [258] ULTIMATE.startENTRY-->L707-2: Formula: (let ((.cse0 (select |v_#memory_int_48| 1)) (.cse1 (store |v_#valid_93| |v_ULTIMATE.start_main_~#t1~0#1.base_39| 1))) (and (= (select |v_#length_60| 2) 11) (= (select |v_#valid_93| 1) 1) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t2~0#1.base_43|) (= (select .cse0 0) 48) (= v_~flag1~0_24 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= v_~flag2~0_24 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_33| 0) (= (select |v_#valid_93| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 0) (= (select |v_#valid_93| 0) 0) (= (select |v_#valid_93| 2) 1) (= (select .cse0 1) 0) (= |v_#pthreadsForks_38| |v_ULTIMATE.start_main_#t~pre3#1_27|) (= v_~x~0_20 0) (= |v_#NULL.offset_8| 0) (= |v_#pthreadsForks_37| (+ |v_#pthreadsForks_38| 1)) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_43| 1) |v_#valid_92|) (= v_~turn~0_16 0) (= (store (store |v_#length_60| |v_ULTIMATE.start_main_~#t1~0#1.base_39| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_43| 4) |v_#length_59|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_43|) 0) (= |v_#NULL.base_8| 0) (< 0 |v_#StackHeapBarrier_20|) (= |v_#memory_int_47| (store |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre3#1_27|))) (= (select |v_#length_60| 1) 2) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1~0#1.base_39|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #pthreadsForks=|v_#pthreadsForks_38|, #valid=|v_#valid_93|, #memory_int=|v_#memory_int_48|, #length=|v_#length_60|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_17|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_20|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_24|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_15|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, #NULL.base=|v_#NULL.base_8|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_25|, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_20|, #pthreadsForks=|v_#pthreadsForks_37|, ~flag2~0=v_~flag2~0_24, #valid=|v_#valid_92|, #memory_int=|v_#memory_int_47|, ~flag1~0=v_~flag1~0_24, #length=|v_#length_59|, ~turn~0=v_~turn~0_16, ~x~0=v_~x~0_20, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_27|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_43|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~mem7#1, #pthreadsForks, ~flag2~0, #valid, #memory_int, ~flag1~0, #length, ~turn~0, ~x~0, ULTIMATE.start_main_#t~pre3#1, ULTIMATE.start_main_~#t2~0#1.base] 1029#[L707-2]don't care [207] L707-2-->thr1ENTRY: Formula: (and (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_thr1Thread1of1ForFork1_thidvar0_2) (= |v_thr1Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr1Thread1of1ForFork1_#in~_.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_4|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, thr1Thread1of1ForFork1_#res.base=|v_thr1Thread1of1ForFork1_#res.base_4|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_4|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_4, thr1Thread1of1ForFork1_#res.offset=|v_thr1Thread1of1ForFork1_#res.offset_4|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0] 1031#[L707-3, thr1ENTRY]don't care [214] thr1ENTRY-->L689: Formula: (and (= |v_thr1Thread1of1ForFork1_#in~_.offset_5| v_thr1Thread1of1ForFork1_~_.offset_5) (= v_thr1Thread1of1ForFork1_~_.base_5 |v_thr1Thread1of1ForFork1_#in~_.base_5|) (= v_~flag1~0_8 1)) InVars {thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_5|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_5|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_5|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_5, ~flag1~0=v_~flag1~0_8, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_5|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_.base, ~flag1~0, thr1Thread1of1ForFork1_~_.offset] 993#[L707-3, L689]don't care [252] L707-3-->L708-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre5#1_21|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 4) (select |v_#length_51| |v_ULTIMATE.start_main_~#t2~0#1.base_35|)) (= (select |v_#valid_78| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) 1) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|) (= |v_#memory_int_37| (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre5#1_21|))) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_38|, #length=|v_#length_51|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_21|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_13|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_37|, #length=|v_#length_51|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~nondet4#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre3#1] 897#[L708-3, L689]don't care [204] L708-3-->thr2ENTRY: Formula: (and (= v_thr2Thread1of1ForFork0_thidvar2_2 0) (= |v_thr2Thread1of1ForFork0_#in~_.offset_4| 0) (= |v_thr2Thread1of1ForFork0_#in~_.base_4| 0) (= v_thr2Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre5#1_6| v_thr2Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|, thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_4, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_4|, thr2Thread1of1ForFork0_#res.base=|v_thr2Thread1of1ForFork0_#res.base_4|, thr2Thread1of1ForFork0_thidvar0=v_thr2Thread1of1ForFork0_thidvar0_2, thr2Thread1of1ForFork0_thidvar1=v_thr2Thread1of1ForFork0_thidvar1_2, thr2Thread1of1ForFork0_thidvar2=v_thr2Thread1of1ForFork0_thidvar2_2, thr2Thread1of1ForFork0_#res.offset=|v_thr2Thread1of1ForFork0_#res.offset_4|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_4|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_#in~_.offset, thr2Thread1of1ForFork0_#res.base, thr2Thread1of1ForFork0_thidvar0, thr2Thread1of1ForFork0_thidvar1, thr2Thread1of1ForFork0_thidvar2, thr2Thread1of1ForFork0_#res.offset, thr2Thread1of1ForFork0_#in~_.base, thr2Thread1of1ForFork0_~_.base] 899#[L708-4, L689, thr2ENTRY]don't care [227] thr2ENTRY-->L698: Formula: (and (= v_thr2Thread1of1ForFork0_~_.offset_5 |v_thr2Thread1of1ForFork0_#in~_.offset_5|) (= |v_thr2Thread1of1ForFork0_#in~_.base_5| v_thr2Thread1of1ForFork0_~_.base_5) (= v_~flag2~0_8 1)) InVars {thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_5|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_5|} OutVars{thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_5, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_5|, ~flag2~0=v_~flag2~0_8, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_5|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, ~flag2~0, thr2Thread1of1ForFork0_~_.base] 1023#[L698, L708-4, L689]don't care [176] L698-->L699-2: Formula: (= v_~turn~0_1 0) InVars {} OutVars{~turn~0=v_~turn~0_1} AuxVars[] AssignedVars[~turn~0] 983#[L708-4, L689, L699-2]don't care [2022-07-26 14:03:15,526 INFO L735 eck$LassoCheckResult]: Loop: 983#[L708-4, L689, L699-2]don't care [179] L699-2-->L699-2: Formula: (and (= v_~turn~0_3 0) (= v_~flag1~0_2 1)) InVars {~turn~0=v_~turn~0_3, ~flag1~0=v_~flag1~0_2} OutVars{~turn~0=v_~turn~0_3, ~flag1~0=v_~flag1~0_2} AuxVars[] AssignedVars[] 983#[L708-4, L689, L699-2]don't care [2022-07-26 14:03:15,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:03:15,527 INFO L85 PathProgramCache]: Analyzing trace with hash 627137093, now seen corresponding path program 1 times [2022-07-26 14:03:15,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:03:15,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248337517] [2022-07-26 14:03:15,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:03:15,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:03:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:15,545 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:03:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:15,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:03:15,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:03:15,577 INFO L85 PathProgramCache]: Analyzing trace with hash 210, now seen corresponding path program 2 times [2022-07-26 14:03:15,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:03:15,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727608520] [2022-07-26 14:03:15,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:03:15,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:03:15,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:15,584 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:03:15,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:15,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:03:15,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:03:15,587 INFO L85 PathProgramCache]: Analyzing trace with hash -2033586418, now seen corresponding path program 1 times [2022-07-26 14:03:15,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:03:15,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819901532] [2022-07-26 14:03:15,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:03:15,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:03:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:15,630 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:03:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:15,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:03:16,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.07 02:03:16 BoogieIcfgContainer [2022-07-26 14:03:16,386 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-26 14:03:16,387 INFO L158 Benchmark]: Toolchain (without parser) took 4084.38ms. Allocated memory was 170.9MB in the beginning and 225.4MB in the end (delta: 54.5MB). Free memory was 117.9MB in the beginning and 156.4MB in the end (delta: -38.5MB). Peak memory consumption was 106.1MB. Max. memory is 8.0GB. [2022-07-26 14:03:16,387 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 170.9MB. Free memory is still 135.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-26 14:03:16,387 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.29ms. Allocated memory is still 170.9MB. Free memory was 117.8MB in the beginning and 135.3MB in the end (delta: -17.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-07-26 14:03:16,388 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.92ms. Allocated memory is still 170.9MB. Free memory was 135.3MB in the beginning and 133.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-26 14:03:16,388 INFO L158 Benchmark]: Boogie Preprocessor took 29.42ms. Allocated memory is still 170.9MB. Free memory was 133.4MB in the beginning and 131.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-26 14:03:16,389 INFO L158 Benchmark]: RCFGBuilder took 335.99ms. Allocated memory is still 170.9MB. Free memory was 131.8MB in the beginning and 119.8MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-07-26 14:03:16,389 INFO L158 Benchmark]: BuchiAutomizer took 3313.83ms. Allocated memory was 170.9MB in the beginning and 225.4MB in the end (delta: 54.5MB). Free memory was 119.8MB in the beginning and 156.4MB in the end (delta: -36.6MB). Peak memory consumption was 108.4MB. Max. memory is 8.0GB. [2022-07-26 14:03:16,391 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.10ms. Allocated memory is still 170.9MB. Free memory is still 135.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 353.29ms. Allocated memory is still 170.9MB. Free memory was 117.8MB in the beginning and 135.3MB in the end (delta: -17.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.92ms. Allocated memory is still 170.9MB. Free memory was 135.3MB in the beginning and 133.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.42ms. Allocated memory is still 170.9MB. Free memory was 133.4MB in the beginning and 131.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 335.99ms. Allocated memory is still 170.9MB. Free memory was 131.8MB in the beginning and 119.8MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 3313.83ms. Allocated memory was 170.9MB in the beginning and 225.4MB in the end (delta: 54.5MB). Free memory was 119.8MB in the beginning and 156.4MB in the end (delta: -36.6MB). Peak memory consumption was 108.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.2 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 82 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. 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: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40 IncrementalHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 22 mSDtfsCounter, 40 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 1.7s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 699]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {\result={0:0}, \result=0, \result={0:0}, _={0:0}, _={0:0}, _={0:0}, _={0:0}, flag1=1, flag2=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@27f83d63 in0,0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3e172f4f in0,47462, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@15cbfa2f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@2b196090=0, t1={3:0}, t2={7564:0}, turn=0, x=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 699]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L684] 0 int flag1 = 0, flag2 = 0; [L685] 0 int turn; [L686] 0 int x; [L706] 0 pthread_t t1, t2; [L707] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) [L688] 1 flag1 = 1 [L708] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) [L697] 2 flag2 = 1 [L698] 2 turn = 0 Loop: [L699] COND TRUE flag1==1 && turn==0 End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 73 PlacesBefore, 30 PlacesAfterwards, 72 TransitionsBefore, 29 TransitionsAfterwards, 812 CoEnabledTransitionPairs, 6 FixpointIterations, 28 TrivialSequentialCompositions, 13 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 0 ChoiceCompositions, 49 TotalNumberOfCompositions, 2143 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1138, positive: 1038, positive conditional: 0, positive unconditional: 1038, negative: 100, negative conditional: 0, negative unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 438, positive: 418, positive conditional: 0, positive unconditional: 418, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1138, positive: 620, positive conditional: 0, positive unconditional: 620, negative: 80, negative conditional: 0, negative unconditional: 80, unknown: 438, unknown conditional: 0, unknown unconditional: 438] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 81, Positive conditional cache size: 0, Positive unconditional cache size: 81, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15 RESULT: Ultimate proved your program to be incorrect! [2022-07-26 14:03:16,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...