/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/dekker-b.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-0d686a6 [2022-07-26 14:03:11,358 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-26 14:03:11,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-26 14:03:11,377 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-26 14:03:11,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-26 14:03:11,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-26 14:03:11,378 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-26 14:03:11,380 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-26 14:03:11,381 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-26 14:03:11,381 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-26 14:03:11,382 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-26 14:03:11,382 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-26 14:03:11,383 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-26 14:03:11,383 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-26 14:03:11,384 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-26 14:03:11,384 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-26 14:03:11,385 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-26 14:03:11,385 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-26 14:03:11,386 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-26 14:03:11,388 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-26 14:03:11,388 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-26 14:03:11,389 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-26 14:03:11,390 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-26 14:03:11,390 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-26 14:03:11,391 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-26 14:03:11,392 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-26 14:03:11,393 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-26 14:03:11,393 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-26 14:03:11,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-26 14:03:11,394 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-26 14:03:11,394 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-26 14:03:11,394 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-26 14:03:11,395 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-26 14:03:11,395 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-26 14:03:11,396 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-26 14:03:11,396 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-26 14:03:11,396 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-26 14:03:11,397 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-26 14:03:11,397 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-26 14:03:11,397 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-26 14:03:11,398 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-26 14:03:11,398 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-26 14:03:11,399 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,412 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-26 14:03:11,412 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-26 14:03:11,412 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-26 14:03:11,413 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-26 14:03:11,413 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-26 14:03:11,413 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-26 14:03:11,414 INFO L138 SettingsManager]: * Use SBE=true [2022-07-26 14:03:11,414 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-26 14:03:11,414 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-26 14:03:11,414 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-26 14:03:11,414 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-26 14:03:11,414 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-26 14:03:11,414 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-26 14:03:11,414 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-26 14:03:11,415 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-26 14:03:11,415 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-26 14:03:11,415 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-26 14:03:11,415 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-26 14:03:11,415 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-26 14:03:11,415 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-26 14:03:11,415 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-26 14:03:11,415 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-26 14:03:11,415 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-26 14:03:11,416 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-26 14:03:11,416 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-26 14:03:11,416 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-26 14:03:11,416 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-26 14:03:11,416 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-26 14:03:11,416 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-26 14:03:11,416 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-26 14:03:11,416 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-26 14:03:11,417 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-26 14:03:11,417 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-26 14:03:11,417 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,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-26 14:03:11,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-26 14:03:11,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-26 14:03:11,616 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-26 14:03:11,617 INFO L275 PluginConnector]: CDTParser initialized [2022-07-26 14:03:11,618 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/dekker-b.i [2022-07-26 14:03:11,685 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32019bc9b/2262b8eb1d264961bcff402569bf7bd1/FLAG3d1b6b75d [2022-07-26 14:03:12,162 INFO L306 CDTParser]: Found 1 translation units. [2022-07-26 14:03:12,163 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/dekker-b.i [2022-07-26 14:03:12,185 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32019bc9b/2262b8eb1d264961bcff402569bf7bd1/FLAG3d1b6b75d [2022-07-26 14:03:12,692 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32019bc9b/2262b8eb1d264961bcff402569bf7bd1 [2022-07-26 14:03:12,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-26 14:03:12,695 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-26 14:03:12,696 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-26 14:03:12,696 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-26 14:03:12,698 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-26 14:03:12,698 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,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f56e4b0 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,699 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,704 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-26 14:03:12,742 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-26 14:03:13,047 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/dekker-b.i[30165,30178] [2022-07-26 14:03:13,053 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/dekker-b.i[30411,30424] [2022-07-26 14:03:13,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 14:03:13,067 INFO L203 MainTranslator]: Completed pre-run [2022-07-26 14:03:13,101 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/dekker-b.i[30165,30178] [2022-07-26 14:03:13,102 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/dekker-b.i[30411,30424] [2022-07-26 14:03:13,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 14:03:13,132 INFO L208 MainTranslator]: Completed translation [2022-07-26 14:03:13,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:03:13 WrapperNode [2022-07-26 14:03:13,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-26 14:03:13,134 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-26 14:03:13,134 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-26 14:03:13,134 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-26 14:03:13,139 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:13" (1/1) ... [2022-07-26 14:03:13,162 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:13" (1/1) ... [2022-07-26 14:03:13,181 INFO L137 Inliner]: procedures = 168, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 47 [2022-07-26 14:03:13,181 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-26 14:03:13,182 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-26 14:03:13,182 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-26 14:03:13,183 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-26 14:03:13,188 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:13" (1/1) ... [2022-07-26 14:03:13,188 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:13" (1/1) ... [2022-07-26 14:03:13,193 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:13" (1/1) ... [2022-07-26 14:03:13,193 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:13" (1/1) ... [2022-07-26 14:03:13,208 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:13" (1/1) ... [2022-07-26 14:03:13,211 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:13" (1/1) ... [2022-07-26 14:03:13,212 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:13" (1/1) ... [2022-07-26 14:03:13,213 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-26 14:03:13,214 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-26 14:03:13,214 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-26 14:03:13,214 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-26 14:03:13,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:03:13" (1/1) ... [2022-07-26 14:03:13,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:03:13,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:03:13,253 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:13,271 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:13,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-26 14:03:13,310 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2022-07-26 14:03:13,310 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2022-07-26 14:03:13,310 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-07-26 14:03:13,312 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-07-26 14:03:13,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-26 14:03:13,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-26 14:03:13,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-26 14:03:13,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-26 14:03:13,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-26 14:03:13,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-26 14:03:13,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-26 14:03:13,316 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:13,385 INFO L234 CfgBuilder]: Building ICFG [2022-07-26 14:03:13,387 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-26 14:03:13,575 INFO L275 CfgBuilder]: Performing block encoding [2022-07-26 14:03:13,580 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-26 14:03:13,580 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-26 14:03:13,582 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,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-26 14:03:13,582 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-26 14:03:13,582 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-26 14:03:13,585 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-26 14:03:13,586 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:03:13,586 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,587 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69021ee8 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,587 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:03:13,587 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:03:13" (2/3) ... [2022-07-26 14:03:13,587 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69021ee8 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,587 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:03:13,587 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,588 INFO L322 chiAutomizerObserver]: Analyzing ICFG dekker-b.i [2022-07-26 14:03:13,642 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-26 14:03:13,664 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 90 places, 98 transitions, 212 flow [2022-07-26 14:03:13,690 INFO L129 PetriNetUnfolder]: 13/94 cut-off events. [2022-07-26 14:03:13,690 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 14:03:13,693 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 94 events. 13/94 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 58. Up to 3 conditions per place. [2022-07-26 14:03:13,693 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 98 transitions, 212 flow [2022-07-26 14:03:13,697 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 94 transitions, 200 flow [2022-07-26 14:03:13,700 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-26 14:03:13,705 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 94 transitions, 200 flow [2022-07-26 14:03:13,707 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 94 transitions, 200 flow [2022-07-26 14:03:13,707 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 94 transitions, 200 flow [2022-07-26 14:03:13,718 INFO L129 PetriNetUnfolder]: 13/94 cut-off events. [2022-07-26 14:03:13,718 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 14:03:13,719 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 94 events. 13/94 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 105 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 58. Up to 3 conditions per place. [2022-07-26 14:03:13,720 INFO L116 LiptonReduction]: Number of co-enabled transitions 1512 [2022-07-26 14:03:15,204 INFO L131 LiptonReduction]: Checked pairs total: 5900 [2022-07-26 14:03:15,205 INFO L133 LiptonReduction]: Total number of compositions: 61 [2022-07-26 14:03:15,216 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2022-07-26 14:03:15,216 INFO L302 stractBuchiCegarLoop]: Hoare is false [2022-07-26 14:03:15,216 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-26 14:03:15,216 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-26 14:03:15,216 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-26 14:03:15,216 INFO L306 stractBuchiCegarLoop]: Difference is false [2022-07-26 14:03:15,216 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-26 14:03:15,216 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-26 14:03:15,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-26 14:03:15,296 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 210 [2022-07-26 14:03:15,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:03:15,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:03:15,300 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-26 14:03:15,300 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:03:15,301 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-26 14:03:15,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 339 states, but on-demand construction may add more states [2022-07-26 14:03:15,311 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 210 [2022-07-26 14:03:15,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:03:15,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:03:15,311 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-26 14:03:15,311 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:03:15,315 INFO L733 eck$LassoCheckResult]: Stem: 93#[ULTIMATE.startENTRY]don't care [358] ULTIMATE.startENTRY-->L724-3: Formula: (let ((.cse0 (store |v_#valid_101| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 1)) (.cse1 (select |v_#memory_int_54| 1))) (and (= (select |v_#valid_101| 1) 1) (= |v_#length_61| (store (store |v_#length_62| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_47| 4)) (= |v_#NULL.base_12| 0) (= (select |v_#valid_101| 2) 1) (= (select |v_#length_62| 2) 9) (= (select |v_#valid_101| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) 0) (= |v_#pthreadsForks_50| |v_ULTIMATE.start_main_#t~pre3#1_37|) (= v_~flag1~0_22 0) (< 0 |v_#StackHeapBarrier_22|) (= v_~turn~0_41 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_25| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_47|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_47|) 0) (= v_~x~0_26 0) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (= |v_#memory_int_53| (store |v_#memory_int_54| |v_ULTIMATE.start_main_~#t1~0#1.base_49| (store (select |v_#memory_int_54| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39| |v_ULTIMATE.start_main_#t~pre3#1_37|))) (= 0 (select .cse1 1)) (= 2 (select |v_#length_62| 1)) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_47| 1) |v_#valid_100|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (select |v_#length_61| |v_ULTIMATE.start_main_~#t1~0#1.base_49|)) (= 48 (select .cse1 0)) (= (select |v_#valid_101| 0) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_37| 0) (= v_~flag2~0_22 0) (= |v_#NULL.offset_12| 0) (= (ite (and (<= v_~turn~0_41 1) (<= 0 v_~turn~0_41)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|) (= |v_#pthreadsForks_49| (+ |v_#pthreadsForks_50| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_50|, #valid=|v_#valid_101|, #memory_int=|v_#memory_int_54|, #length=|v_#length_62|} 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_37|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_28|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_17|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_49|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_39|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_25|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_22|, #pthreadsForks=|v_#pthreadsForks_49|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_25|, ~flag2~0=v_~flag2~0_22, #valid=|v_#valid_100|, #memory_int=|v_#memory_int_53|, ~flag1~0=v_~flag1~0_22, #length=|v_#length_61|, ~turn~0=v_~turn~0_41, ~x~0=v_~x~0_26, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_37|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_47|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} 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, ULTIMATE.start_assume_abort_if_not_~cond#1, ~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, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 96#[L724-3]don't care [292] L724-3-->thr1ENTRY: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_thr1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_4, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_4|, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_4|, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~_.offset] 98#[thr1ENTRY, L724-4]don't care [323] thr1ENTRY-->L694-2: Formula: (and (= v_thr1Thread1of1ForFork0_~_.base_5 |v_thr1Thread1of1ForFork0_#in~_.base_5|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_5| v_thr1Thread1of1ForFork0_~_.offset_5) (= v_~flag1~0_12 1)) InVars {thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_5|, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_5, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_5|, ~flag1~0=v_~flag1~0_12, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, ~flag1~0, thr1Thread1of1ForFork0_~_.offset] 100#[L694-2, L724-4]don't care [2022-07-26 14:03:15,315 INFO L735 eck$LassoCheckResult]: Loop: 100#[L694-2, L724-4]don't care [273] L694-2-->L694: Formula: (<= 1 v_~flag2~0_6) InVars {~flag2~0=v_~flag2~0_6} OutVars{~flag2~0=v_~flag2~0_6} AuxVars[] AssignedVars[] 106#[L694, L724-4]don't care [276] L694-->L694-2: Formula: (= v_~turn~0_8 0) InVars {~turn~0=v_~turn~0_8} OutVars{~turn~0=v_~turn~0_8} AuxVars[] AssignedVars[] 100#[L694-2, L724-4]don't care [2022-07-26 14:03:15,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:03:15,318 INFO L85 PathProgramCache]: Analyzing trace with hash 383204, now seen corresponding path program 1 times [2022-07-26 14:03:15,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:03:15,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535286129] [2022-07-26 14:03:15,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:03:15,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:03:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:15,431 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:03:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:15,469 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:03:15,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:03:15,471 INFO L85 PathProgramCache]: Analyzing trace with hash 9700, now seen corresponding path program 1 times [2022-07-26 14:03:15,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:03:15,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827096586] [2022-07-26 14:03:15,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:03:15,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:03:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:15,484 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:03:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:15,486 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:03:15,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:03:15,487 INFO L85 PathProgramCache]: Analyzing trace with hash 368267783, now seen corresponding path program 1 times [2022-07-26 14:03:15,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:03:15,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739763569] [2022-07-26 14:03:15,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:03:15,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:03:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:03:15,533 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,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:03:15,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739763569] [2022-07-26 14:03:15,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739763569] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:03:15,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:03:15,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-26 14:03:15,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465888735] [2022-07-26 14:03:15,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:03:15,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:03:15,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-26 14:03:15,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-26 14:03:15,567 INFO L87 Difference]: Start difference. First operand currently 339 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 1.6666666666666667) 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,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:03:15,653 INFO L93 Difference]: Finished difference Result 422 states and 1120 transitions. [2022-07-26 14:03:15,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 422 states and 1120 transitions. [2022-07-26 14:03:15,661 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 202 [2022-07-26 14:03:15,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 422 states to 268 states and 738 transitions. [2022-07-26 14:03:15,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 268 [2022-07-26 14:03:15,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 268 [2022-07-26 14:03:15,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 268 states and 738 transitions. [2022-07-26 14:03:15,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:03:15,670 INFO L220 hiAutomatonCegarLoop]: Abstraction has 268 states and 738 transitions. [2022-07-26 14:03:15,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states and 738 transitions. [2022-07-26 14:03:15,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 226. [2022-07-26 14:03:15,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 226 states have (on average 2.7787610619469025) internal successors, (628), 225 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:03:15,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 628 transitions. [2022-07-26 14:03:15,701 INFO L242 hiAutomatonCegarLoop]: Abstraction has 226 states and 628 transitions. [2022-07-26 14:03:15,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-26 14:03:15,704 INFO L426 stractBuchiCegarLoop]: Abstraction has 226 states and 628 transitions. [2022-07-26 14:03:15,704 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-26 14:03:15,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states and 628 transitions. [2022-07-26 14:03:15,707 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 174 [2022-07-26 14:03:15,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:03:15,707 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:03:15,707 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-26 14:03:15,707 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:03:15,708 INFO L733 eck$LassoCheckResult]: Stem: 1654#[ULTIMATE.startENTRY]don't care [358] ULTIMATE.startENTRY-->L724-3: Formula: (let ((.cse0 (store |v_#valid_101| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 1)) (.cse1 (select |v_#memory_int_54| 1))) (and (= (select |v_#valid_101| 1) 1) (= |v_#length_61| (store (store |v_#length_62| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_47| 4)) (= |v_#NULL.base_12| 0) (= (select |v_#valid_101| 2) 1) (= (select |v_#length_62| 2) 9) (= (select |v_#valid_101| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) 0) (= |v_#pthreadsForks_50| |v_ULTIMATE.start_main_#t~pre3#1_37|) (= v_~flag1~0_22 0) (< 0 |v_#StackHeapBarrier_22|) (= v_~turn~0_41 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_25| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_47|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_47|) 0) (= v_~x~0_26 0) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (= |v_#memory_int_53| (store |v_#memory_int_54| |v_ULTIMATE.start_main_~#t1~0#1.base_49| (store (select |v_#memory_int_54| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39| |v_ULTIMATE.start_main_#t~pre3#1_37|))) (= 0 (select .cse1 1)) (= 2 (select |v_#length_62| 1)) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_47| 1) |v_#valid_100|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (select |v_#length_61| |v_ULTIMATE.start_main_~#t1~0#1.base_49|)) (= 48 (select .cse1 0)) (= (select |v_#valid_101| 0) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_37| 0) (= v_~flag2~0_22 0) (= |v_#NULL.offset_12| 0) (= (ite (and (<= v_~turn~0_41 1) (<= 0 v_~turn~0_41)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|) (= |v_#pthreadsForks_49| (+ |v_#pthreadsForks_50| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_50|, #valid=|v_#valid_101|, #memory_int=|v_#memory_int_54|, #length=|v_#length_62|} 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_37|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_28|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_17|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_49|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_39|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_25|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_22|, #pthreadsForks=|v_#pthreadsForks_49|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_25|, ~flag2~0=v_~flag2~0_22, #valid=|v_#valid_100|, #memory_int=|v_#memory_int_53|, ~flag1~0=v_~flag1~0_22, #length=|v_#length_61|, ~turn~0=v_~turn~0_41, ~x~0=v_~x~0_26, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_37|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_47|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} 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, ULTIMATE.start_assume_abort_if_not_~cond#1, ~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, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1318#[L724-3]don't care [292] L724-3-->thr1ENTRY: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_thr1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_4, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_4|, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_4|, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~_.offset] 1320#[thr1ENTRY, L724-4]don't care [349] L724-4-->L725-3: Formula: (and (= (select |v_#valid_76| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= |v_#memory_int_35| (store |v_#memory_int_36| |v_ULTIMATE.start_main_~#t2~0#1.base_33| (store (select |v_#memory_int_36| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre5#1_19|))) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_45| |v_ULTIMATE.start_main_~#t2~0#1.base_33|)) (= |v_#pthreadsForks_36| |v_ULTIMATE.start_main_#t~pre5#1_19|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_36|, #length=|v_#length_45|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_19|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_11|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_35|, #length=|v_#length_45|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~nondet4#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre3#1] 1394#[L725-3, thr1ENTRY]don't care [295] L725-3-->thr2ENTRY: Formula: (and (= v_thr2Thread1of1ForFork1_thidvar2_2 0) (= |v_thr2Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr2Thread1of1ForFork1_#in~_.offset_4| 0) (= v_thr2Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre5#1_6| v_thr2Thread1of1ForFork1_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|, thr2Thread1of1ForFork1_thidvar0=v_thr2Thread1of1ForFork1_thidvar0_2, thr2Thread1of1ForFork1_thidvar1=v_thr2Thread1of1ForFork1_thidvar1_2, thr2Thread1of1ForFork1_thidvar2=v_thr2Thread1of1ForFork1_thidvar2_2, thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_4, thr2Thread1of1ForFork1_#res.base=|v_thr2Thread1of1ForFork1_#res.base_4|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_4|, thr2Thread1of1ForFork1_#res.offset=|v_thr2Thread1of1ForFork1_#res.offset_4|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_4|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_thidvar0, thr2Thread1of1ForFork1_thidvar1, thr2Thread1of1ForFork1_thidvar2, thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_#res.base, thr2Thread1of1ForFork1_#in~_.offset, thr2Thread1of1ForFork1_#res.offset, thr2Thread1of1ForFork1_#in~_.base, thr2Thread1of1ForFork1_~_.base] 1652#[thr1ENTRY, L725-4, thr2ENTRY]don't care [316] thr2ENTRY-->L709-2: Formula: (and (= v_thr2Thread1of1ForFork1_~_.offset_5 |v_thr2Thread1of1ForFork1_#in~_.offset_5|) (= v_~flag2~0_10 1) (= |v_thr2Thread1of1ForFork1_#in~_.base_5| v_thr2Thread1of1ForFork1_~_.base_5)) InVars {thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|} OutVars{thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_5, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, ~flag2~0=v_~flag2~0_10, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_.offset, ~flag2~0, thr2Thread1of1ForFork1_~_.base] 1554#[thr1ENTRY, L709-2, L725-4]don't care [2022-07-26 14:03:15,708 INFO L735 eck$LassoCheckResult]: Loop: 1554#[thr1ENTRY, L709-2, L725-4]don't care [252] L709-2-->L709: Formula: (<= 1 v_~flag1~0_2) InVars {~flag1~0=v_~flag1~0_2} OutVars{~flag1~0=v_~flag1~0_2} AuxVars[] AssignedVars[] 1558#[thr1ENTRY, L709, L725-4]don't care [255] L709-->L709-2: Formula: (= v_~turn~0_5 1) InVars {~turn~0=v_~turn~0_5} OutVars{~turn~0=v_~turn~0_5} AuxVars[] AssignedVars[] 1554#[thr1ENTRY, L709-2, L725-4]don't care [2022-07-26 14:03:15,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:03:15,708 INFO L85 PathProgramCache]: Analyzing trace with hash 368293491, now seen corresponding path program 1 times [2022-07-26 14:03:15,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:03:15,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507806981] [2022-07-26 14:03:15,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:03:15,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:03:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:15,726 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:03:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:15,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:03:15,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:03:15,739 INFO L85 PathProgramCache]: Analyzing trace with hash 9028, now seen corresponding path program 1 times [2022-07-26 14:03:15,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:03:15,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459705994] [2022-07-26 14:03:15,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:03:15,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:03:15,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:15,743 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:03:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:15,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:03:15,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:03:15,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1742734646, now seen corresponding path program 1 times [2022-07-26 14:03:15,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:03:15,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064882778] [2022-07-26 14:03:15,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:03:15,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:03:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:03:15,779 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,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:03:15,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064882778] [2022-07-26 14:03:15,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064882778] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:03:15,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:03:15,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-26 14:03:15,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886542615] [2022-07-26 14:03:15,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:03:15,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:03:15,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-26 14:03:15,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-26 14:03:15,789 INFO L87 Difference]: Start difference. First operand 226 states and 628 transitions. cyclomatic complexity: 432 Second operand has 3 states, 3 states have (on average 2.3333333333333335) 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,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:03:15,815 INFO L93 Difference]: Finished difference Result 218 states and 592 transitions. [2022-07-26 14:03:15,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 218 states and 592 transitions. [2022-07-26 14:03:15,818 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 140 [2022-07-26 14:03:15,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 218 states to 196 states and 536 transitions. [2022-07-26 14:03:15,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 196 [2022-07-26 14:03:15,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 196 [2022-07-26 14:03:15,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 536 transitions. [2022-07-26 14:03:15,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:03:15,823 INFO L220 hiAutomatonCegarLoop]: Abstraction has 196 states and 536 transitions. [2022-07-26 14:03:15,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 536 transitions. [2022-07-26 14:03:15,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2022-07-26 14:03:15,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 196 states have (on average 2.7346938775510203) internal successors, (536), 195 states have internal predecessors, (536), 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,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 536 transitions. [2022-07-26 14:03:15,835 INFO L242 hiAutomatonCegarLoop]: Abstraction has 196 states and 536 transitions. [2022-07-26 14:03:15,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-26 14:03:15,836 INFO L426 stractBuchiCegarLoop]: Abstraction has 196 states and 536 transitions. [2022-07-26 14:03:15,836 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-26 14:03:15,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 196 states and 536 transitions. [2022-07-26 14:03:15,838 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 140 [2022-07-26 14:03:15,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:03:15,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:03:15,839 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-26 14:03:15,839 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:03:15,839 INFO L733 eck$LassoCheckResult]: Stem: 2272#[ULTIMATE.startENTRY]don't care [358] ULTIMATE.startENTRY-->L724-3: Formula: (let ((.cse0 (store |v_#valid_101| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 1)) (.cse1 (select |v_#memory_int_54| 1))) (and (= (select |v_#valid_101| 1) 1) (= |v_#length_61| (store (store |v_#length_62| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_47| 4)) (= |v_#NULL.base_12| 0) (= (select |v_#valid_101| 2) 1) (= (select |v_#length_62| 2) 9) (= (select |v_#valid_101| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) 0) (= |v_#pthreadsForks_50| |v_ULTIMATE.start_main_#t~pre3#1_37|) (= v_~flag1~0_22 0) (< 0 |v_#StackHeapBarrier_22|) (= v_~turn~0_41 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_25| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~0#1.base_47|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_47|) 0) (= v_~x~0_26 0) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (= |v_#memory_int_53| (store |v_#memory_int_54| |v_ULTIMATE.start_main_~#t1~0#1.base_49| (store (select |v_#memory_int_54| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39| |v_ULTIMATE.start_main_#t~pre3#1_37|))) (= 0 (select .cse1 1)) (= 2 (select |v_#length_62| 1)) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_47| 1) |v_#valid_100|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (select |v_#length_61| |v_ULTIMATE.start_main_~#t1~0#1.base_49|)) (= 48 (select .cse1 0)) (= (select |v_#valid_101| 0) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_37| 0) (= v_~flag2~0_22 0) (= |v_#NULL.offset_12| 0) (= (ite (and (<= v_~turn~0_41 1) (<= 0 v_~turn~0_41)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|) (= |v_#pthreadsForks_49| (+ |v_#pthreadsForks_50| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_50|, #valid=|v_#valid_101|, #memory_int=|v_#memory_int_54|, #length=|v_#length_62|} 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_37|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_28|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_17|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_49|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_39|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_25|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_22|, #pthreadsForks=|v_#pthreadsForks_49|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_25|, ~flag2~0=v_~flag2~0_22, #valid=|v_#valid_100|, #memory_int=|v_#memory_int_53|, ~flag1~0=v_~flag1~0_22, #length=|v_#length_61|, ~turn~0=v_~turn~0_41, ~x~0=v_~x~0_26, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_37|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_47|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} 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, ULTIMATE.start_assume_abort_if_not_~cond#1, ~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, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1978#[L724-3]don't care [292] L724-3-->thr1ENTRY: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_thr1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_4, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_4|, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_4|, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~_.offset] 1980#[thr1ENTRY, L724-4]don't care [323] thr1ENTRY-->L694-2: Formula: (and (= v_thr1Thread1of1ForFork0_~_.base_5 |v_thr1Thread1of1ForFork0_#in~_.base_5|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_5| v_thr1Thread1of1ForFork0_~_.offset_5) (= v_~flag1~0_12 1)) InVars {thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_5|, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_5, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_5|, ~flag1~0=v_~flag1~0_12, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, ~flag1~0, thr1Thread1of1ForFork0_~_.offset] 2042#[L694-2, L724-4]don't care [349] L724-4-->L725-3: Formula: (and (= (select |v_#valid_76| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= |v_#memory_int_35| (store |v_#memory_int_36| |v_ULTIMATE.start_main_~#t2~0#1.base_33| (store (select |v_#memory_int_36| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre5#1_19|))) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_45| |v_ULTIMATE.start_main_~#t2~0#1.base_33|)) (= |v_#pthreadsForks_36| |v_ULTIMATE.start_main_#t~pre5#1_19|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_36|, #length=|v_#length_45|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_19|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_11|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_35|, #length=|v_#length_45|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~nondet4#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre3#1] 2140#[L725-3, L694-2]don't care [295] L725-3-->thr2ENTRY: Formula: (and (= v_thr2Thread1of1ForFork1_thidvar2_2 0) (= |v_thr2Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr2Thread1of1ForFork1_#in~_.offset_4| 0) (= v_thr2Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre5#1_6| v_thr2Thread1of1ForFork1_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|, thr2Thread1of1ForFork1_thidvar0=v_thr2Thread1of1ForFork1_thidvar0_2, thr2Thread1of1ForFork1_thidvar1=v_thr2Thread1of1ForFork1_thidvar1_2, thr2Thread1of1ForFork1_thidvar2=v_thr2Thread1of1ForFork1_thidvar2_2, thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_4, thr2Thread1of1ForFork1_#res.base=|v_thr2Thread1of1ForFork1_#res.base_4|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_4|, thr2Thread1of1ForFork1_#res.offset=|v_thr2Thread1of1ForFork1_#res.offset_4|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_4|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_thidvar0, thr2Thread1of1ForFork1_thidvar1, thr2Thread1of1ForFork1_thidvar2, thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_#res.base, thr2Thread1of1ForFork1_#in~_.offset, thr2Thread1of1ForFork1_#res.offset, thr2Thread1of1ForFork1_#in~_.base, thr2Thread1of1ForFork1_~_.base] 1920#[L725-4, thr2ENTRY, L694-2]don't care [316] thr2ENTRY-->L709-2: Formula: (and (= v_thr2Thread1of1ForFork1_~_.offset_5 |v_thr2Thread1of1ForFork1_#in~_.offset_5|) (= v_~flag2~0_10 1) (= |v_thr2Thread1of1ForFork1_#in~_.base_5| v_thr2Thread1of1ForFork1_~_.base_5)) InVars {thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|} OutVars{thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_5, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, ~flag2~0=v_~flag2~0_10, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_.offset, ~flag2~0, thr2Thread1of1ForFork1_~_.base] 1910#[L709-2, L725-4, L694-2]don't care [2022-07-26 14:03:15,839 INFO L735 eck$LassoCheckResult]: Loop: 1910#[L709-2, L725-4, L694-2]don't care [273] L694-2-->L694: Formula: (<= 1 v_~flag2~0_6) InVars {~flag2~0=v_~flag2~0_6} OutVars{~flag2~0=v_~flag2~0_6} AuxVars[] AssignedVars[] 2038#[L694, L709-2, L725-4]don't care [276] L694-->L694-2: Formula: (= v_~turn~0_8 0) InVars {~turn~0=v_~turn~0_8} OutVars{~turn~0=v_~turn~0_8} AuxVars[] AssignedVars[] 1910#[L709-2, L725-4, L694-2]don't care [2022-07-26 14:03:15,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:03:15,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1468526674, now seen corresponding path program 1 times [2022-07-26 14:03:15,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:03:15,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728111025] [2022-07-26 14:03:15,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:03:15,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:03:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:15,856 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:03:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:15,869 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:03:15,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:03:15,870 INFO L85 PathProgramCache]: Analyzing trace with hash 9700, now seen corresponding path program 2 times [2022-07-26 14:03:15,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:03:15,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341729931] [2022-07-26 14:03:15,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:03:15,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:03:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:15,874 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:03:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:15,876 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:03:15,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:03:15,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1790115409, now seen corresponding path program 1 times [2022-07-26 14:03:15,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:03:15,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469665583] [2022-07-26 14:03:15,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:03:15,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:03:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:15,892 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:03:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:15,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:03:16,543 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,545 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-26 14:03:16,545 INFO L158 Benchmark]: Toolchain (without parser) took 3850.35ms. Allocated memory was 185.6MB in the beginning and 241.2MB in the end (delta: 55.6MB). Free memory was 156.0MB in the beginning and 103.2MB in the end (delta: 52.8MB). Peak memory consumption was 108.8MB. Max. memory is 8.0GB. [2022-07-26 14:03:16,546 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 185.6MB. Free memory is still 143.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-26 14:03:16,546 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.50ms. Allocated memory is still 185.6MB. Free memory was 156.0MB in the beginning and 147.7MB in the end (delta: 8.3MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. [2022-07-26 14:03:16,546 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.99ms. Allocated memory is still 185.6MB. Free memory was 147.7MB in the beginning and 145.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-26 14:03:16,547 INFO L158 Benchmark]: Boogie Preprocessor took 31.37ms. Allocated memory is still 185.6MB. Free memory was 145.6MB in the beginning and 144.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-26 14:03:16,547 INFO L158 Benchmark]: RCFGBuilder took 367.58ms. Allocated memory is still 185.6MB. Free memory was 144.2MB in the beginning and 132.0MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-07-26 14:03:16,547 INFO L158 Benchmark]: BuchiAutomizer took 2962.47ms. Allocated memory was 185.6MB in the beginning and 241.2MB in the end (delta: 55.6MB). Free memory was 131.6MB in the beginning and 103.2MB in the end (delta: 28.4MB). Peak memory consumption was 83.8MB. Max. memory is 8.0GB. [2022-07-26 14:03:16,549 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 185.6MB. Free memory is still 143.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 437.50ms. Allocated memory is still 185.6MB. Free memory was 156.0MB in the beginning and 147.7MB in the end (delta: 8.3MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.99ms. Allocated memory is still 185.6MB. Free memory was 147.7MB in the beginning and 145.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.37ms. Allocated memory is still 185.6MB. Free memory was 145.6MB in the beginning and 144.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 367.58ms. Allocated memory is still 185.6MB. Free memory was 144.2MB in the beginning and 132.0MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 2962.47ms. Allocated memory was 185.6MB in the beginning and 241.2MB in the end (delta: 55.6MB). Free memory was 131.6MB in the beginning and 103.2MB in the end (delta: 28.4MB). Peak memory consumption was 83.8MB. 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 196 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. 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, 42 StatesRemovedByMinimization, 1 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, 47 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 47 mSDsluCounter, 102 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44 IncrementalHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 68 mSDtfsCounter, 44 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.5s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 693]: 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 {\old(cond)=1, \result={0:0}, \result=0, \result={0:0}, _={0:0}, _={0:0}, _={0:0}, _={0:0}, cond=1, flag1=1, flag2=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@54f3e2bc in0,0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@894f9c3 in0,-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@55ff70ec=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@7aa9312c=0, t1={30059:0}, t2={30060:0}, turn=0, x=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 693]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L688] 0 int flag1 = 0, flag2 = 0; [L689] 0 int turn; [L690] 0 int x; [L722] 0 pthread_t t1, t2; [L723] CALL 0 assume_abort_if_not(0<=turn && turn<=1) [L3] COND FALSE 0 !(!cond) [L723] RET 0 assume_abort_if_not(0<=turn && turn<=1) [L724] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) [L692] 1 flag1 = 1 [L725] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) [L707] 2 flag2 = 1 Loop: [L693] COND TRUE flag2 >= 1 [L694] COND FALSE !(turn != 0) End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 88 PlacesBefore, 38 PlacesAfterwards, 94 TransitionsBefore, 43 TransitionsAfterwards, 1512 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 15 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 61 TotalNumberOfCompositions, 5900 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2502, positive: 2288, positive conditional: 0, positive unconditional: 2288, negative: 214, negative conditional: 0, negative unconditional: 214, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 759, positive: 728, positive conditional: 0, positive unconditional: 728, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2502, positive: 1560, positive conditional: 0, positive unconditional: 1560, negative: 183, negative conditional: 0, negative unconditional: 183, unknown: 759, unknown conditional: 0, unknown unconditional: 759] , Statistics on independence cache: Total cache size (in pairs): 239, Positive cache size: 212, Positive conditional cache size: 0, Positive unconditional cache size: 212, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 RESULT: Ultimate proved your program to be incorrect! [2022-07-26 14:03:16,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...