/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-atomic/peterson.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-0d686a6 [2022-07-26 13:44:14,275 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-26 13:44:14,276 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-26 13:44:14,317 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-26 13:44:14,317 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-26 13:44:14,318 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-26 13:44:14,319 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-26 13:44:14,321 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-26 13:44:14,322 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-26 13:44:14,323 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-26 13:44:14,324 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-26 13:44:14,325 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-26 13:44:14,325 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-26 13:44:14,326 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-26 13:44:14,327 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-26 13:44:14,328 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-26 13:44:14,328 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-26 13:44:14,329 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-26 13:44:14,330 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-26 13:44:14,332 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-26 13:44:14,333 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-26 13:44:14,334 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-26 13:44:14,335 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-26 13:44:14,337 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-26 13:44:14,340 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-26 13:44:14,348 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-26 13:44:14,348 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-26 13:44:14,349 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-26 13:44:14,349 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-26 13:44:14,350 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-26 13:44:14,351 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-26 13:44:14,351 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-26 13:44:14,352 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-26 13:44:14,352 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-26 13:44:14,353 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-26 13:44:14,354 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-26 13:44:14,354 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-26 13:44:14,354 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-26 13:44:14,355 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-26 13:44:14,355 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-26 13:44:14,355 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-26 13:44:14,361 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-26 13:44:14,362 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf [2022-07-26 13:44:14,390 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-26 13:44:14,390 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-26 13:44:14,390 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-26 13:44:14,390 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-26 13:44:14,392 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-26 13:44:14,392 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-26 13:44:14,392 INFO L138 SettingsManager]: * Use SBE=true [2022-07-26 13:44:14,392 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-26 13:44:14,392 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-26 13:44:14,393 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-26 13:44:14,393 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-26 13:44:14,393 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-26 13:44:14,393 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-26 13:44:14,394 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-26 13:44:14,395 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-26 13:44:14,395 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-26 13:44:14,395 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-26 13:44:14,395 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-26 13:44:14,395 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-26 13:44:14,395 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-26 13:44:14,395 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-26 13:44:14,395 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-26 13:44:14,396 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-26 13:44:14,396 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-26 13:44:14,396 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-26 13:44:14,396 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-26 13:44:14,396 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-26 13:44:14,396 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-26 13:44:14,396 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-26 13:44:14,397 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-26 13:44:14,397 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-26 13:44:14,398 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-26 13:44:14,398 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 13:44:14,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-26 13:44:14,653 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-26 13:44:14,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-26 13:44:14,656 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-26 13:44:14,657 INFO L275 PluginConnector]: CDTParser initialized [2022-07-26 13:44:14,658 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/peterson.i [2022-07-26 13:44:14,723 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13dca38a6/23ec7364af1241d887232c3358f470eb/FLAG1c8d4e7a3 [2022-07-26 13:44:15,223 INFO L306 CDTParser]: Found 1 translation units. [2022-07-26 13:44:15,224 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/peterson.i [2022-07-26 13:44:15,239 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13dca38a6/23ec7364af1241d887232c3358f470eb/FLAG1c8d4e7a3 [2022-07-26 13:44:15,703 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13dca38a6/23ec7364af1241d887232c3358f470eb [2022-07-26 13:44:15,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-26 13:44:15,707 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-26 13:44:15,709 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-26 13:44:15,709 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-26 13:44:15,712 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-26 13:44:15,712 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 01:44:15" (1/1) ... [2022-07-26 13:44:15,713 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4455ac06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:15, skipping insertion in model container [2022-07-26 13:44:15,713 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 01:44:15" (1/1) ... [2022-07-26 13:44:15,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-26 13:44:15,779 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-26 13:44:15,955 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-07-26 13:44:16,109 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.i[30997,31010] [2022-07-26 13:44:16,115 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.i[31682,31695] [2022-07-26 13:44:16,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 13:44:16,129 INFO L203 MainTranslator]: Completed pre-run [2022-07-26 13:44:16,149 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-07-26 13:44:16,174 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.i[30997,31010] [2022-07-26 13:44:16,179 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.i[31682,31695] [2022-07-26 13:44:16,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 13:44:16,224 INFO L208 MainTranslator]: Completed translation [2022-07-26 13:44:16,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:16 WrapperNode [2022-07-26 13:44:16,224 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-26 13:44:16,226 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-26 13:44:16,226 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-26 13:44:16,226 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-26 13:44:16,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:16" (1/1) ... [2022-07-26 13:44:16,261 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:16" (1/1) ... [2022-07-26 13:44:16,280 INFO L137 Inliner]: procedures = 171, calls = 47, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 43 [2022-07-26 13:44:16,281 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-26 13:44:16,282 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-26 13:44:16,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-26 13:44:16,282 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-26 13:44:16,289 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:16" (1/1) ... [2022-07-26 13:44:16,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:16" (1/1) ... [2022-07-26 13:44:16,301 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:16" (1/1) ... [2022-07-26 13:44:16,301 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:16" (1/1) ... [2022-07-26 13:44:16,311 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:16" (1/1) ... [2022-07-26 13:44:16,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:16" (1/1) ... [2022-07-26 13:44:16,316 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:16" (1/1) ... [2022-07-26 13:44:16,318 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-26 13:44:16,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-26 13:44:16,319 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-26 13:44:16,319 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-26 13:44:16,320 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:16" (1/1) ... [2022-07-26 13:44:16,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:44:16,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:44:16,361 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 13:44:16,371 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 13:44:16,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-26 13:44:16,400 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2022-07-26 13:44:16,401 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2022-07-26 13:44:16,401 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-07-26 13:44:16,401 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-07-26 13:44:16,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-26 13:44:16,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-26 13:44:16,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-26 13:44:16,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-26 13:44:16,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-26 13:44:16,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-26 13:44:16,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-26 13:44:16,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-26 13:44:16,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-26 13:44:16,403 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 13:44:16,552 INFO L234 CfgBuilder]: Building ICFG [2022-07-26 13:44:16,554 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-26 13:44:16,741 INFO L275 CfgBuilder]: Performing block encoding [2022-07-26 13:44:16,747 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-26 13:44:16,748 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-26 13:44:16,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 01:44:16 BoogieIcfgContainer [2022-07-26 13:44:16,751 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-26 13:44:16,753 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-26 13:44:16,753 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-26 13:44:16,756 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-26 13:44:16,757 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:44:16,757 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.07 01:44:15" (1/3) ... [2022-07-26 13:44:16,758 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14475638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 01:44:16, skipping insertion in model container [2022-07-26 13:44:16,758 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:44:16,758 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:16" (2/3) ... [2022-07-26 13:44:16,759 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14475638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 01:44:16, skipping insertion in model container [2022-07-26 13:44:16,759 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:44:16,759 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 01:44:16" (3/3) ... [2022-07-26 13:44:16,762 INFO L322 chiAutomizerObserver]: Analyzing ICFG peterson.i [2022-07-26 13:44:16,866 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-26 13:44:16,901 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 81 places, 82 transitions, 180 flow [2022-07-26 13:44:16,939 INFO L129 PetriNetUnfolder]: 6/78 cut-off events. [2022-07-26 13:44:16,939 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 13:44:16,944 INFO L84 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 78 events. 6/78 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 68 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2022-07-26 13:44:16,944 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 82 transitions, 180 flow [2022-07-26 13:44:16,954 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 78 transitions, 168 flow [2022-07-26 13:44:16,957 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-26 13:44:16,970 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 78 transitions, 168 flow [2022-07-26 13:44:16,972 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 78 transitions, 168 flow [2022-07-26 13:44:16,973 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 78 transitions, 168 flow [2022-07-26 13:44:16,994 INFO L129 PetriNetUnfolder]: 6/78 cut-off events. [2022-07-26 13:44:16,994 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 13:44:16,995 INFO L84 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 78 events. 6/78 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2022-07-26 13:44:16,998 INFO L116 LiptonReduction]: Number of co-enabled transitions 1088 [2022-07-26 13:44:18,945 INFO L131 LiptonReduction]: Checked pairs total: 2794 [2022-07-26 13:44:18,945 INFO L133 LiptonReduction]: Total number of compositions: 57 [2022-07-26 13:44:18,975 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2022-07-26 13:44:18,976 INFO L302 stractBuchiCegarLoop]: Hoare is false [2022-07-26 13:44:18,976 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-26 13:44:18,976 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-26 13:44:18,977 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-26 13:44:18,977 INFO L306 stractBuchiCegarLoop]: Difference is false [2022-07-26 13:44:18,977 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-26 13:44:18,977 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-26 13:44:18,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-26 13:44:19,033 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 64 [2022-07-26 13:44:19,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:44:19,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:44:19,039 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-26 13:44:19,039 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 13:44:19,039 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-26 13:44:19,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 163 states, but on-demand construction may add more states [2022-07-26 13:44:19,050 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 64 [2022-07-26 13:44:19,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:44:19,050 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:44:19,050 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-26 13:44:19,050 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 13:44:19,055 INFO L733 eck$LassoCheckResult]: Stem: 84#[ULTIMATE.startENTRY]don't care [284] ULTIMATE.startENTRY-->L761-2: Formula: (let ((.cse0 (select |v_#memory_int_44| 1)) (.cse1 (store |v_#valid_85| |v_ULTIMATE.start_main_~#t1~1#1.base_39| 1))) (and (= |v_#NULL.offset_6| 0) (= v_~x~0_85 0) (= |v_#memory_int_43| (store |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~1#1.base_39| (store (select |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~1#1.base_39|) |v_ULTIMATE.start_main_~#t1~1#1.offset_29| |v_ULTIMATE.start_main_#t~pre4#1_27|))) (= |v_#NULL.base_6| 0) (= |v_ULTIMATE.start_main_~#t2~1#1.offset_31| 0) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~1#1.base_39|) (= v_~flag1~0_77 0) (= (select |v_#valid_85| 1) 1) (< 0 |v_#StackHeapBarrier_22|) (= 2 (select |v_#length_52| 1)) (= 48 (select .cse0 0)) (= |v_#pthreadsForks_34| |v_ULTIMATE.start_main_#t~pre4#1_27|) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_main_~#t1~1#1.offset_29| 0) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= (select |v_#length_52| 2) 11) (= (select |v_#valid_85| 2) 1) (= (select |v_#valid_85| |v_ULTIMATE.start_main_~#t1~1#1.base_39|) 0) (= (store (store |v_#length_52| |v_ULTIMATE.start_main_~#t1~1#1.base_39| 4) |v_ULTIMATE.start_main_~#t2~1#1.base_39| 4) |v_#length_51|) (= (select |v_#valid_85| 0) 0) (= v_~flag2~0_45 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~1#1.base_39|) 0) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~1#1.base_39| 1) |v_#valid_84|) (= v_~turn~0_37 0) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~1#1.base_39|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_34|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_44|, #length=|v_#length_52|} OutVars{ULTIMATE.start_main_~#t2~1#1.base=|v_ULTIMATE.start_main_~#t2~1#1.base_39|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_25|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_18|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_22|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_27|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t1~1#1.offset=|v_ULTIMATE.start_main_~#t1~1#1.offset_29|, ULTIMATE.start_main_~#t2~1#1.offset=|v_ULTIMATE.start_main_~#t2~1#1.offset_31|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_~#t1~1#1.base=|v_ULTIMATE.start_main_~#t1~1#1.base_39|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_17|, ~flag2~0=v_~flag2~0_45, #valid=|v_#valid_84|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_15|, #memory_int=|v_#memory_int_43|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_18|, ~flag1~0=v_~flag1~0_77, #length=|v_#length_51|, ~turn~0=v_~turn~0_37, ~x~0=v_~x~0_85} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~1#1.base, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_#t~pre4#1, #NULL.base, ULTIMATE.start_main_~#t1~1#1.offset, ULTIMATE.start_main_~#t2~1#1.offset, #pthreadsForks, ULTIMATE.start_main_~#t1~1#1.base, ULTIMATE.start_main_#t~nondet5#1, ~flag2~0, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, ~flag1~0, #length, ~turn~0, ~x~0] 87#[L761-2]don't care [222] L761-2-->thr1ENTRY: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#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_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_10, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, thr1Thread1of1ForFork0_~t1~0=v_thr1Thread1of1ForFork0_~t1~0_10, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_~f21~0, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~t1~0, thr1Thread1of1ForFork0_~_.offset] 89#[thr1ENTRY, L761-3]don't care [228] thr1ENTRY-->L706: Formula: (and (= v_thr1Thread1of1ForFork0_~_.base_5 |v_thr1Thread1of1ForFork0_#in~_.base_5|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_5| v_thr1Thread1of1ForFork0_~_.offset_5) (= v_~flag1~0_6 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_6, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, ~flag1~0, thr1Thread1of1ForFork0_~_.offset] 91#[L706, L761-3]don't care [205] L706-->L709: Formula: (= v_~turn~0_4 1) InVars {} OutVars{~turn~0=v_~turn~0_4} AuxVars[] AssignedVars[~turn~0] 97#[L709, L761-3]don't care [206] L709-->L712: Formula: (= v_~flag2~0_3 v_thr1Thread1of1ForFork0_~f21~0_1) InVars {~flag2~0=v_~flag2~0_3} OutVars{thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_1, ~flag2~0=v_~flag2~0_3} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f21~0] 105#[L712, L761-3]don't care [207] L712-->L722: Formula: (= v_thr1Thread1of1ForFork0_~t1~0_1 v_~turn~0_5) InVars {~turn~0=v_~turn~0_5} OutVars{~turn~0=v_~turn~0_5, thr1Thread1of1ForFork0_~t1~0=v_thr1Thread1of1ForFork0_~t1~0_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~t1~0] 119#[L761-3, L722]don't care [2022-07-26 13:44:19,056 INFO L735 eck$LassoCheckResult]: Loop: 119#[L761-3, L722]don't care [231] L722-->L719: Formula: (and (= v_thr1Thread1of1ForFork0_~f21~0_14 1) (= v_thr1Thread1of1ForFork0_~t1~0_11 1) (= v_thr1Thread1of1ForFork0_~f21~0_13 v_~flag2~0_9)) InVars {thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_14, ~flag2~0=v_~flag2~0_9, thr1Thread1of1ForFork0_~t1~0=v_thr1Thread1of1ForFork0_~t1~0_11} OutVars{thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_13, ~flag2~0=v_~flag2~0_9, thr1Thread1of1ForFork0_~t1~0=v_thr1Thread1of1ForFork0_~t1~0_11} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f21~0] 139#[L719, L761-3]don't care [215] L719-->L722: Formula: (= v_thr1Thread1of1ForFork0_~t1~0_7 v_~turn~0_6) InVars {~turn~0=v_~turn~0_6} OutVars{~turn~0=v_~turn~0_6, thr1Thread1of1ForFork0_~t1~0=v_thr1Thread1of1ForFork0_~t1~0_7} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~t1~0] 119#[L761-3, L722]don't care [2022-07-26 13:44:19,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:19,060 INFO L85 PathProgramCache]: Analyzing trace with hash 640265581, now seen corresponding path program 1 times [2022-07-26 13:44:19,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:19,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522566916] [2022-07-26 13:44:19,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:19,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:19,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:19,153 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:44:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:19,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:44:19,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:19,189 INFO L85 PathProgramCache]: Analyzing trace with hash 8337, now seen corresponding path program 1 times [2022-07-26 13:44:19,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:19,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066669784] [2022-07-26 13:44:19,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:19,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:19,199 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:44:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:19,203 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:44:19,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:19,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1114907389, now seen corresponding path program 1 times [2022-07-26 13:44:19,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:19,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892554463] [2022-07-26 13:44:19,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:19,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:44:19,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 13:44:19,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 13:44:19,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892554463] [2022-07-26 13:44:19,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892554463] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 13:44:19,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 13:44:19,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-26 13:44:19,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804124865] [2022-07-26 13:44:19,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 13:44:19,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 13:44:19,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-26 13:44:19,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-26 13:44:19,361 INFO L87 Difference]: Start difference. First operand currently 163 states, but on-demand construction may add more states Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 13:44:19,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 13:44:19,501 INFO L93 Difference]: Finished difference Result 234 states and 534 transitions. [2022-07-26 13:44:19,503 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 234 states and 534 transitions. [2022-07-26 13:44:19,520 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 72 [2022-07-26 13:44:19,526 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 234 states to 184 states and 425 transitions. [2022-07-26 13:44:19,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 184 [2022-07-26 13:44:19,529 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 184 [2022-07-26 13:44:19,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 184 states and 425 transitions. [2022-07-26 13:44:19,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 13:44:19,531 INFO L220 hiAutomatonCegarLoop]: Abstraction has 184 states and 425 transitions. [2022-07-26 13:44:19,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states and 425 transitions. [2022-07-26 13:44:19,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 154. [2022-07-26 13:44:19,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 154 states have (on average 2.3701298701298703) internal successors, (365), 153 states have internal predecessors, (365), 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 13:44:19,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 365 transitions. [2022-07-26 13:44:19,581 INFO L242 hiAutomatonCegarLoop]: Abstraction has 154 states and 365 transitions. [2022-07-26 13:44:19,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-26 13:44:19,587 INFO L426 stractBuchiCegarLoop]: Abstraction has 154 states and 365 transitions. [2022-07-26 13:44:19,587 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-26 13:44:19,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 154 states and 365 transitions. [2022-07-26 13:44:19,590 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 60 [2022-07-26 13:44:19,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:44:19,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:44:19,590 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:44:19,591 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 13:44:19,592 INFO L733 eck$LassoCheckResult]: Stem: 956#[ULTIMATE.startENTRY]don't care [284] ULTIMATE.startENTRY-->L761-2: Formula: (let ((.cse0 (select |v_#memory_int_44| 1)) (.cse1 (store |v_#valid_85| |v_ULTIMATE.start_main_~#t1~1#1.base_39| 1))) (and (= |v_#NULL.offset_6| 0) (= v_~x~0_85 0) (= |v_#memory_int_43| (store |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~1#1.base_39| (store (select |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~1#1.base_39|) |v_ULTIMATE.start_main_~#t1~1#1.offset_29| |v_ULTIMATE.start_main_#t~pre4#1_27|))) (= |v_#NULL.base_6| 0) (= |v_ULTIMATE.start_main_~#t2~1#1.offset_31| 0) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~1#1.base_39|) (= v_~flag1~0_77 0) (= (select |v_#valid_85| 1) 1) (< 0 |v_#StackHeapBarrier_22|) (= 2 (select |v_#length_52| 1)) (= 48 (select .cse0 0)) (= |v_#pthreadsForks_34| |v_ULTIMATE.start_main_#t~pre4#1_27|) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_main_~#t1~1#1.offset_29| 0) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= (select |v_#length_52| 2) 11) (= (select |v_#valid_85| 2) 1) (= (select |v_#valid_85| |v_ULTIMATE.start_main_~#t1~1#1.base_39|) 0) (= (store (store |v_#length_52| |v_ULTIMATE.start_main_~#t1~1#1.base_39| 4) |v_ULTIMATE.start_main_~#t2~1#1.base_39| 4) |v_#length_51|) (= (select |v_#valid_85| 0) 0) (= v_~flag2~0_45 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~1#1.base_39|) 0) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~1#1.base_39| 1) |v_#valid_84|) (= v_~turn~0_37 0) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~1#1.base_39|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_34|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_44|, #length=|v_#length_52|} OutVars{ULTIMATE.start_main_~#t2~1#1.base=|v_ULTIMATE.start_main_~#t2~1#1.base_39|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_25|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_18|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_22|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_27|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t1~1#1.offset=|v_ULTIMATE.start_main_~#t1~1#1.offset_29|, ULTIMATE.start_main_~#t2~1#1.offset=|v_ULTIMATE.start_main_~#t2~1#1.offset_31|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_~#t1~1#1.base=|v_ULTIMATE.start_main_~#t1~1#1.base_39|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_17|, ~flag2~0=v_~flag2~0_45, #valid=|v_#valid_84|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_15|, #memory_int=|v_#memory_int_43|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_18|, ~flag1~0=v_~flag1~0_77, #length=|v_#length_51|, ~turn~0=v_~turn~0_37, ~x~0=v_~x~0_85} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~1#1.base, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_#t~pre4#1, #NULL.base, ULTIMATE.start_main_~#t1~1#1.offset, ULTIMATE.start_main_~#t2~1#1.offset, #pthreadsForks, ULTIMATE.start_main_~#t1~1#1.base, ULTIMATE.start_main_#t~nondet5#1, ~flag2~0, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, ~flag1~0, #length, ~turn~0, ~x~0] 952#[L761-2]don't care [222] L761-2-->thr1ENTRY: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#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_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_10, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, thr1Thread1of1ForFork0_~t1~0=v_thr1Thread1of1ForFork0_~t1~0_10, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_~f21~0, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~t1~0, thr1Thread1of1ForFork0_~_.offset] 946#[thr1ENTRY, L761-3]don't care [276] L761-3-->L762-3: Formula: (and (= (select |v_#valid_60| |v_ULTIMATE.start_main_~#t2~1#1.base_23|) 1) (= |v_ULTIMATE.start_main_#t~pre6#1_21| |v_#pthreadsForks_26|) (= |v_#memory_int_31| (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~1#1.base_23| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~1#1.base_23|) |v_ULTIMATE.start_main_~#t2~1#1.offset_21| |v_ULTIMATE.start_main_#t~pre6#1_21|))) (<= 0 |v_ULTIMATE.start_main_~#t2~1#1.offset_21|) (= |v_#pthreadsForks_25| (+ |v_#pthreadsForks_26| 1)) (<= (+ |v_ULTIMATE.start_main_~#t2~1#1.offset_21| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~1#1.base_23|))) InVars {ULTIMATE.start_main_~#t2~1#1.base=|v_ULTIMATE.start_main_~#t2~1#1.base_23|, ULTIMATE.start_main_~#t2~1#1.offset=|v_ULTIMATE.start_main_~#t2~1#1.offset_21|, #pthreadsForks=|v_#pthreadsForks_26|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_32|, #length=|v_#length_41|} OutVars{ULTIMATE.start_main_~#t2~1#1.base=|v_ULTIMATE.start_main_~#t2~1#1.base_23|, ULTIMATE.start_main_~#t2~1#1.offset=|v_ULTIMATE.start_main_~#t2~1#1.offset_21|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_21|, #pthreadsForks=|v_#pthreadsForks_25|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_13|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_31|, #length=|v_#length_41|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 928#[L762-3, thr1ENTRY]don't care [225] L762-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~pre6#1_6| v_thr2Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_10, thr2Thread1of1ForFork1_thidvar0=v_thr2Thread1of1ForFork1_thidvar0_2, thr2Thread1of1ForFork1_thidvar1=v_thr2Thread1of1ForFork1_thidvar1_2, thr2Thread1of1ForFork1_thidvar2=v_thr2Thread1of1ForFork1_thidvar2_2, thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_4, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, 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_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_10, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~t2~0, thr2Thread1of1ForFork1_thidvar0, thr2Thread1of1ForFork1_thidvar1, thr2Thread1of1ForFork1_thidvar2, thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_#res.base, thr2Thread1of1ForFork1_#in~_.offset, thr2Thread1of1ForFork1_#res.offset, thr2Thread1of1ForFork1_#in~_.base, thr2Thread1of1ForFork1_~f12~0, thr2Thread1of1ForFork1_~_.base] 930#[L762-4, thr1ENTRY, thr2ENTRY]don't care [241] thr2ENTRY-->L734: Formula: (and (= v_~flag2~0_11 1) (= v_thr2Thread1of1ForFork1_~_.offset_5 |v_thr2Thread1of1ForFork1_#in~_.offset_5|) (= |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_11, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_.offset, ~flag2~0, thr2Thread1of1ForFork1_~_.base] 688#[L762-4, thr1ENTRY, L734]don't care [188] L734-->L737: Formula: (= v_~turn~0_1 0) InVars {} OutVars{~turn~0=v_~turn~0_1} AuxVars[] AssignedVars[~turn~0] 694#[L762-4, thr1ENTRY, L737]don't care [189] L737-->L740: Formula: (= v_~flag1~0_1 v_thr2Thread1of1ForFork1_~f12~0_1) InVars {~flag1~0=v_~flag1~0_1} OutVars{~flag1~0=v_~flag1~0_1, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~f12~0] 854#[L762-4, thr1ENTRY, L740]don't care [190] L740-->L750: Formula: (= v_thr2Thread1of1ForFork1_~t2~0_1 v_~turn~0_2) InVars {~turn~0=v_~turn~0_2} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_1, ~turn~0=v_~turn~0_2} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~t2~0] 838#[L762-4, thr1ENTRY, L750]don't care [2022-07-26 13:44:19,592 INFO L735 eck$LassoCheckResult]: Loop: 838#[L762-4, thr1ENTRY, L750]don't care [233] L750-->L747: Formula: (and (= v_thr2Thread1of1ForFork1_~f12~0_12 1) (= v_~flag1~0_8 v_thr2Thread1of1ForFork1_~f12~0_11) (= v_thr2Thread1of1ForFork1_~t2~0_11 0)) InVars {thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_11, ~flag1~0=v_~flag1~0_8, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_12} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_11, ~flag1~0=v_~flag1~0_8, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_11} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~f12~0] 842#[L762-4, thr1ENTRY, L747]don't care [198] L747-->L750: Formula: (= v_thr2Thread1of1ForFork1_~t2~0_7 v_~turn~0_3) InVars {~turn~0=v_~turn~0_3} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_7, ~turn~0=v_~turn~0_3} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~t2~0] 838#[L762-4, thr1ENTRY, L750]don't care [2022-07-26 13:44:19,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:19,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1786367140, now seen corresponding path program 1 times [2022-07-26 13:44:19,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:19,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407157858] [2022-07-26 13:44:19,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:19,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:19,614 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:44:19,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:19,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:44:19,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:19,640 INFO L85 PathProgramCache]: Analyzing trace with hash 8382, now seen corresponding path program 1 times [2022-07-26 13:44:19,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:19,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705832132] [2022-07-26 13:44:19,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:19,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:19,656 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:44:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:19,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:44:19,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:19,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1288104281, now seen corresponding path program 1 times [2022-07-26 13:44:19,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:19,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948247775] [2022-07-26 13:44:19,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:19,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:44:19,746 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 13:44:19,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 13:44:19,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948247775] [2022-07-26 13:44:19,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948247775] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 13:44:19,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 13:44:19,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-26 13:44:19,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562665714] [2022-07-26 13:44:19,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 13:44:19,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 13:44:19,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-26 13:44:19,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-26 13:44:19,782 INFO L87 Difference]: Start difference. First operand 154 states and 365 transitions. cyclomatic complexity: 239 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 13:44:19,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 13:44:19,863 INFO L93 Difference]: Finished difference Result 198 states and 452 transitions. [2022-07-26 13:44:19,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 198 states and 452 transitions. [2022-07-26 13:44:19,867 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 60 [2022-07-26 13:44:19,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 198 states to 156 states and 365 transitions. [2022-07-26 13:44:19,869 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2022-07-26 13:44:19,869 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 156 [2022-07-26 13:44:19,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 365 transitions. [2022-07-26 13:44:19,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 13:44:19,871 INFO L220 hiAutomatonCegarLoop]: Abstraction has 156 states and 365 transitions. [2022-07-26 13:44:19,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 365 transitions. [2022-07-26 13:44:19,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 146. [2022-07-26 13:44:19,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 146 states have (on average 2.3972602739726026) internal successors, (350), 145 states have internal predecessors, (350), 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 13:44:19,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 350 transitions. [2022-07-26 13:44:19,892 INFO L242 hiAutomatonCegarLoop]: Abstraction has 146 states and 350 transitions. [2022-07-26 13:44:19,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-26 13:44:19,893 INFO L426 stractBuchiCegarLoop]: Abstraction has 146 states and 350 transitions. [2022-07-26 13:44:19,893 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-26 13:44:19,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 146 states and 350 transitions. [2022-07-26 13:44:19,896 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 56 [2022-07-26 13:44:19,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:44:19,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:44:19,897 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:44:19,898 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 13:44:19,898 INFO L733 eck$LassoCheckResult]: Stem: 1439#[ULTIMATE.startENTRY]don't care [284] ULTIMATE.startENTRY-->L761-2: Formula: (let ((.cse0 (select |v_#memory_int_44| 1)) (.cse1 (store |v_#valid_85| |v_ULTIMATE.start_main_~#t1~1#1.base_39| 1))) (and (= |v_#NULL.offset_6| 0) (= v_~x~0_85 0) (= |v_#memory_int_43| (store |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~1#1.base_39| (store (select |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~1#1.base_39|) |v_ULTIMATE.start_main_~#t1~1#1.offset_29| |v_ULTIMATE.start_main_#t~pre4#1_27|))) (= |v_#NULL.base_6| 0) (= |v_ULTIMATE.start_main_~#t2~1#1.offset_31| 0) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~1#1.base_39|) (= v_~flag1~0_77 0) (= (select |v_#valid_85| 1) 1) (< 0 |v_#StackHeapBarrier_22|) (= 2 (select |v_#length_52| 1)) (= 48 (select .cse0 0)) (= |v_#pthreadsForks_34| |v_ULTIMATE.start_main_#t~pre4#1_27|) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_main_~#t1~1#1.offset_29| 0) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= (select |v_#length_52| 2) 11) (= (select |v_#valid_85| 2) 1) (= (select |v_#valid_85| |v_ULTIMATE.start_main_~#t1~1#1.base_39|) 0) (= (store (store |v_#length_52| |v_ULTIMATE.start_main_~#t1~1#1.base_39| 4) |v_ULTIMATE.start_main_~#t2~1#1.base_39| 4) |v_#length_51|) (= (select |v_#valid_85| 0) 0) (= v_~flag2~0_45 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~1#1.base_39|) 0) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~1#1.base_39| 1) |v_#valid_84|) (= v_~turn~0_37 0) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~1#1.base_39|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_34|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_44|, #length=|v_#length_52|} OutVars{ULTIMATE.start_main_~#t2~1#1.base=|v_ULTIMATE.start_main_~#t2~1#1.base_39|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_25|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_18|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_22|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_27|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t1~1#1.offset=|v_ULTIMATE.start_main_~#t1~1#1.offset_29|, ULTIMATE.start_main_~#t2~1#1.offset=|v_ULTIMATE.start_main_~#t2~1#1.offset_31|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_~#t1~1#1.base=|v_ULTIMATE.start_main_~#t1~1#1.base_39|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_17|, ~flag2~0=v_~flag2~0_45, #valid=|v_#valid_84|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_15|, #memory_int=|v_#memory_int_43|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_18|, ~flag1~0=v_~flag1~0_77, #length=|v_#length_51|, ~turn~0=v_~turn~0_37, ~x~0=v_~x~0_85} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~1#1.base, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_#t~pre4#1, #NULL.base, ULTIMATE.start_main_~#t1~1#1.offset, ULTIMATE.start_main_~#t2~1#1.offset, #pthreadsForks, ULTIMATE.start_main_~#t1~1#1.base, ULTIMATE.start_main_#t~nondet5#1, ~flag2~0, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, ~flag1~0, #length, ~turn~0, ~x~0] 1433#[L761-2]don't care [222] L761-2-->thr1ENTRY: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#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_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_10, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, thr1Thread1of1ForFork0_~t1~0=v_thr1Thread1of1ForFork0_~t1~0_10, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_~f21~0, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~t1~0, thr1Thread1of1ForFork0_~_.offset] 1425#[thr1ENTRY, L761-3]don't care [228] thr1ENTRY-->L706: Formula: (and (= v_thr1Thread1of1ForFork0_~_.base_5 |v_thr1Thread1of1ForFork0_#in~_.base_5|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_5| v_thr1Thread1of1ForFork0_~_.offset_5) (= v_~flag1~0_6 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_6, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, ~flag1~0, thr1Thread1of1ForFork0_~_.offset] 1405#[L706, L761-3]don't care [276] L761-3-->L762-3: Formula: (and (= (select |v_#valid_60| |v_ULTIMATE.start_main_~#t2~1#1.base_23|) 1) (= |v_ULTIMATE.start_main_#t~pre6#1_21| |v_#pthreadsForks_26|) (= |v_#memory_int_31| (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~1#1.base_23| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~1#1.base_23|) |v_ULTIMATE.start_main_~#t2~1#1.offset_21| |v_ULTIMATE.start_main_#t~pre6#1_21|))) (<= 0 |v_ULTIMATE.start_main_~#t2~1#1.offset_21|) (= |v_#pthreadsForks_25| (+ |v_#pthreadsForks_26| 1)) (<= (+ |v_ULTIMATE.start_main_~#t2~1#1.offset_21| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~1#1.base_23|))) InVars {ULTIMATE.start_main_~#t2~1#1.base=|v_ULTIMATE.start_main_~#t2~1#1.base_23|, ULTIMATE.start_main_~#t2~1#1.offset=|v_ULTIMATE.start_main_~#t2~1#1.offset_21|, #pthreadsForks=|v_#pthreadsForks_26|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_32|, #length=|v_#length_41|} OutVars{ULTIMATE.start_main_~#t2~1#1.base=|v_ULTIMATE.start_main_~#t2~1#1.base_23|, ULTIMATE.start_main_~#t2~1#1.offset=|v_ULTIMATE.start_main_~#t2~1#1.offset_21|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_21|, #pthreadsForks=|v_#pthreadsForks_25|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_13|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_31|, #length=|v_#length_41|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 1345#[L762-3, L706]don't care [225] L762-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~pre6#1_6| v_thr2Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_10, thr2Thread1of1ForFork1_thidvar0=v_thr2Thread1of1ForFork1_thidvar0_2, thr2Thread1of1ForFork1_thidvar1=v_thr2Thread1of1ForFork1_thidvar1_2, thr2Thread1of1ForFork1_thidvar2=v_thr2Thread1of1ForFork1_thidvar2_2, thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_4, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, 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_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_10, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~t2~0, thr2Thread1of1ForFork1_thidvar0, thr2Thread1of1ForFork1_thidvar1, thr2Thread1of1ForFork1_thidvar2, thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_#res.base, thr2Thread1of1ForFork1_#in~_.offset, thr2Thread1of1ForFork1_#res.offset, thr2Thread1of1ForFork1_#in~_.base, thr2Thread1of1ForFork1_~f12~0, thr2Thread1of1ForFork1_~_.base] 1335#[L762-4, thr2ENTRY, L706]don't care [241] thr2ENTRY-->L734: Formula: (and (= v_~flag2~0_11 1) (= v_thr2Thread1of1ForFork1_~_.offset_5 |v_thr2Thread1of1ForFork1_#in~_.offset_5|) (= |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_11, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_.offset, ~flag2~0, thr2Thread1of1ForFork1_~_.base] 1193#[L762-4, L706, L734]don't care [188] L734-->L737: Formula: (= v_~turn~0_1 0) InVars {} OutVars{~turn~0=v_~turn~0_1} AuxVars[] AssignedVars[~turn~0] 1269#[L762-4, L737, L706]don't care [189] L737-->L740: Formula: (= v_~flag1~0_1 v_thr2Thread1of1ForFork1_~f12~0_1) InVars {~flag1~0=v_~flag1~0_1} OutVars{~flag1~0=v_~flag1~0_1, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~f12~0] 1365#[L762-4, L706, L740]don't care [190] L740-->L750: Formula: (= v_thr2Thread1of1ForFork1_~t2~0_1 v_~turn~0_2) InVars {~turn~0=v_~turn~0_2} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_1, ~turn~0=v_~turn~0_2} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~t2~0] 1351#[L762-4, L706, L750]don't care [2022-07-26 13:44:19,898 INFO L735 eck$LassoCheckResult]: Loop: 1351#[L762-4, L706, L750]don't care [233] L750-->L747: Formula: (and (= v_thr2Thread1of1ForFork1_~f12~0_12 1) (= v_~flag1~0_8 v_thr2Thread1of1ForFork1_~f12~0_11) (= v_thr2Thread1of1ForFork1_~t2~0_11 0)) InVars {thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_11, ~flag1~0=v_~flag1~0_8, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_12} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_11, ~flag1~0=v_~flag1~0_8, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_11} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~f12~0] 1349#[L762-4, L706, L747]don't care [198] L747-->L750: Formula: (= v_thr2Thread1of1ForFork1_~t2~0_7 v_~turn~0_3) InVars {~turn~0=v_~turn~0_3} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_7, ~turn~0=v_~turn~0_3} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~t2~0] 1351#[L762-4, L706, L750]don't care [2022-07-26 13:44:19,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:19,899 INFO L85 PathProgramCache]: Analyzing trace with hash -2041389030, now seen corresponding path program 1 times [2022-07-26 13:44:19,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:19,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839671454] [2022-07-26 13:44:19,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:19,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:19,935 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:44:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:19,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:44:19,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:19,967 INFO L85 PathProgramCache]: Analyzing trace with hash 8382, now seen corresponding path program 2 times [2022-07-26 13:44:19,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:19,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894047610] [2022-07-26 13:44:19,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:19,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:19,971 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:44:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:19,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:44:19,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:19,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1025203863, now seen corresponding path program 1 times [2022-07-26 13:44:19,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:19,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882021438] [2022-07-26 13:44:19,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:19,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:20,003 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:44:20,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:20,024 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:44:20,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.07 01:44:20 BoogieIcfgContainer [2022-07-26 13:44:20,828 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-26 13:44:20,829 INFO L158 Benchmark]: Toolchain (without parser) took 5121.66ms. Allocated memory was 192.9MB in the beginning and 267.4MB in the end (delta: 74.4MB). Free memory was 135.5MB in the beginning and 150.9MB in the end (delta: -15.4MB). Peak memory consumption was 59.5MB. Max. memory is 8.0GB. [2022-07-26 13:44:20,829 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 192.9MB. Free memory is still 153.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-26 13:44:20,829 INFO L158 Benchmark]: CACSL2BoogieTranslator took 516.41ms. Allocated memory was 192.9MB in the beginning and 267.4MB in the end (delta: 74.4MB). Free memory was 135.3MB in the beginning and 227.3MB in the end (delta: -92.0MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB. [2022-07-26 13:44:20,830 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.00ms. Allocated memory is still 267.4MB. Free memory was 227.3MB in the beginning and 225.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-26 13:44:20,830 INFO L158 Benchmark]: Boogie Preprocessor took 36.25ms. Allocated memory is still 267.4MB. Free memory was 225.3MB in the beginning and 223.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-26 13:44:20,831 INFO L158 Benchmark]: RCFGBuilder took 432.61ms. Allocated memory is still 267.4MB. Free memory was 223.8MB in the beginning and 211.6MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-07-26 13:44:20,831 INFO L158 Benchmark]: BuchiAutomizer took 4075.70ms. Allocated memory is still 267.4MB. Free memory was 211.6MB in the beginning and 150.9MB in the end (delta: 60.7MB). Peak memory consumption was 61.1MB. Max. memory is 8.0GB. [2022-07-26 13:44:20,834 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.18ms. Allocated memory is still 192.9MB. Free memory is still 153.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 516.41ms. Allocated memory was 192.9MB in the beginning and 267.4MB in the end (delta: 74.4MB). Free memory was 135.3MB in the beginning and 227.3MB in the end (delta: -92.0MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.00ms. Allocated memory is still 267.4MB. Free memory was 227.3MB in the beginning and 225.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.25ms. Allocated memory is still 267.4MB. Free memory was 225.3MB in the beginning and 223.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 432.61ms. Allocated memory is still 267.4MB. Free memory was 223.8MB in the beginning and 211.6MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 4075.70ms. Allocated memory is still 267.4MB. Free memory was 211.6MB in the beginning and 150.9MB in the end (delta: 60.7MB). Peak memory consumption was 61.1MB. 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 4 locations. The remainder module has 146 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.9s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 40 StatesRemovedByMinimization, 2 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, 68 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 68 mSDsluCounter, 67 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 94 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 120 IncrementalHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 25 mSDtfsCounter, 120 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: 2.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 744]: 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:0}, \result=0, _={0:0}, _={0:0}, _={0:0}, _={0:0}, f12=1, f21=0, flag1=1, flag2=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@522f4c20 in0,0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@75a8abc6 in0,-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@14da6266=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@351fbb4c=0, t1={31861:0}, t1=0, t2={31862:0}, t2=0, turn=0, x=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 744]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L700] 0 int flag1 = 0, flag2 = 0; [L701] 0 int turn; [L702] 0 int x; [L760] 0 pthread_t t1, t2; [L761] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) [L705] 1 flag1 = 1 [L762] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) [L733] 2 flag2 = 1 [L736] 2 turn = 0 [L739] 2 int f12 = flag1; [L742] 2 int t2 = turn; Loop: [L744] COND TRUE f12==1 && t2==0 [L746] f12 = flag1 [L749] t2 = turn End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 79 PlacesBefore, 30 PlacesAfterwards, 78 TransitionsBefore, 26 TransitionsAfterwards, 1088 CoEnabledTransitionPairs, 6 FixpointIterations, 28 TrivialSequentialCompositions, 20 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 3 ChoiceCompositions, 57 TotalNumberOfCompositions, 2794 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1516, positive: 1374, positive conditional: 0, positive unconditional: 1374, negative: 142, negative conditional: 0, negative unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 761, positive: 725, positive conditional: 0, positive unconditional: 725, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 761, positive: 716, positive conditional: 0, positive unconditional: 716, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 45, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 47, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1516, positive: 649, positive conditional: 0, positive unconditional: 649, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 761, unknown conditional: 0, unknown unconditional: 761] , Statistics on independence cache: Total cache size (in pairs): 129, Positive cache size: 111, Positive conditional cache size: 0, Positive unconditional cache size: 111, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 RESULT: Ultimate proved your program to be incorrect! [2022-07-26 13:44:20,883 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...