/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/dekker-b.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-0d686a6 [2022-07-26 13:44:14,083 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-26 13:44:14,114 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-26 13:44:14,133 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-26 13:44:14,134 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-26 13:44:14,134 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-26 13:44:14,135 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-26 13:44:14,136 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-26 13:44:14,137 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-26 13:44:14,138 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-26 13:44:14,138 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-26 13:44:14,139 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-26 13:44:14,139 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-26 13:44:14,140 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-26 13:44:14,140 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-26 13:44:14,141 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-26 13:44:14,141 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-26 13:44:14,145 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-26 13:44:14,146 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-26 13:44:14,147 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-26 13:44:14,148 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-26 13:44:14,164 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-26 13:44:14,164 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-26 13:44:14,165 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-26 13:44:14,165 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-26 13:44:14,167 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-26 13:44:14,167 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-26 13:44:14,167 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-26 13:44:14,168 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-26 13:44:14,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-26 13:44:14,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-26 13:44:14,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-26 13:44:14,169 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-26 13:44:14,170 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-26 13:44:14,170 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-26 13:44:14,171 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-26 13:44:14,171 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-26 13:44:14,171 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-26 13:44:14,171 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-26 13:44:14,171 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-26 13:44:14,172 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-26 13:44:14,172 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-26 13:44:14,173 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,207 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-26 13:44:14,207 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-26 13:44:14,207 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-26 13:44:14,208 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-26 13:44:14,208 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-26 13:44:14,208 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-26 13:44:14,209 INFO L138 SettingsManager]: * Use SBE=true [2022-07-26 13:44:14,209 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-26 13:44:14,209 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-26 13:44:14,209 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-26 13:44:14,209 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-26 13:44:14,209 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-26 13:44:14,209 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-26 13:44:14,209 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-26 13:44:14,209 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-26 13:44:14,209 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-26 13:44:14,209 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-26 13:44:14,210 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-26 13:44:14,210 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-26 13:44:14,210 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-26 13:44:14,210 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-26 13:44:14,210 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-26 13:44:14,210 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-26 13:44:14,210 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-26 13:44:14,210 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-26 13:44:14,210 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-26 13:44:14,210 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-26 13:44:14,210 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-26 13:44:14,210 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-26 13:44:14,211 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-26 13:44:14,211 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-26 13:44:14,211 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-26 13:44:14,211 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,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-26 13:44:14,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-26 13:44:14,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-26 13:44:14,377 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-26 13:44:14,378 INFO L275 PluginConnector]: CDTParser initialized [2022-07-26 13:44:14,379 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 13:44:14,416 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e57faeee2/07b10b38ec2a4beb8f602e1a6ff6b67b/FLAG9482e3bef [2022-07-26 13:44:14,768 INFO L306 CDTParser]: Found 1 translation units. [2022-07-26 13:44:14,768 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/dekker-b.i [2022-07-26 13:44:14,782 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e57faeee2/07b10b38ec2a4beb8f602e1a6ff6b67b/FLAG9482e3bef [2022-07-26 13:44:15,176 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e57faeee2/07b10b38ec2a4beb8f602e1a6ff6b67b [2022-07-26 13:44:15,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-26 13:44:15,180 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-26 13:44:15,182 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-26 13:44:15,182 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-26 13:44:15,186 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-26 13:44:15,189 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,190 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cd5e406 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,191 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,219 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-26 13:44:15,263 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-26 13:44:15,581 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 13:44:15,583 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 13:44:15,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 13:44:15,593 INFO L203 MainTranslator]: Completed pre-run [2022-07-26 13:44:15,623 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 13:44:15,624 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 13:44:15,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 13:44:15,647 INFO L208 MainTranslator]: Completed translation [2022-07-26 13:44:15,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:15 WrapperNode [2022-07-26 13:44:15,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-26 13:44:15,648 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-26 13:44:15,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-26 13:44:15,649 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-26 13:44:15,661 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:15" (1/1) ... [2022-07-26 13:44:15,670 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:15" (1/1) ... [2022-07-26 13:44:15,683 INFO L137 Inliner]: procedures = 168, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 47 [2022-07-26 13:44:15,684 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-26 13:44:15,684 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-26 13:44:15,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-26 13:44:15,684 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-26 13:44:15,689 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:15" (1/1) ... [2022-07-26 13:44:15,689 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:15" (1/1) ... [2022-07-26 13:44:15,691 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:15" (1/1) ... [2022-07-26 13:44:15,691 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:15" (1/1) ... [2022-07-26 13:44:15,695 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:15" (1/1) ... [2022-07-26 13:44:15,698 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:15" (1/1) ... [2022-07-26 13:44:15,699 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:15" (1/1) ... [2022-07-26 13:44:15,701 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-26 13:44:15,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-26 13:44:15,702 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-26 13:44:15,702 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-26 13:44:15,715 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:15" (1/1) ... [2022-07-26 13:44:15,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:44:15,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:44:15,751 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:15,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-26 13:44:15,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-26 13:44:15,797 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2022-07-26 13:44:15,797 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2022-07-26 13:44:15,797 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-07-26 13:44:15,797 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-07-26 13:44:15,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-26 13:44:15,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-26 13:44:15,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-26 13:44:15,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-26 13:44:15,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-26 13:44:15,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-26 13:44:15,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-26 13:44:15,799 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:15,877 INFO L234 CfgBuilder]: Building ICFG [2022-07-26 13:44:15,878 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-26 13:44:16,034 INFO L275 CfgBuilder]: Performing block encoding [2022-07-26 13:44:16,040 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-26 13:44:16,040 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-26 13:44:16,049 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,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-26 13:44:16,050 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-26 13:44:16,050 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-26 13:44:16,055 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-26 13:44:16,055 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:44:16,055 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,056 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@632922e1 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,056 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:44:16,056 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:15" (2/3) ... [2022-07-26 13:44:16,057 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@632922e1 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,057 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:44:16,057 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,058 INFO L322 chiAutomizerObserver]: Analyzing ICFG dekker-b.i [2022-07-26 13:44:16,139 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-26 13:44:16,176 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 90 places, 98 transitions, 212 flow [2022-07-26 13:44:16,219 INFO L129 PetriNetUnfolder]: 13/94 cut-off events. [2022-07-26 13:44:16,219 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 13:44:16,222 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 13:44:16,223 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 98 transitions, 212 flow [2022-07-26 13:44:16,231 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 94 transitions, 200 flow [2022-07-26 13:44:16,235 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-26 13:44:16,244 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 94 transitions, 200 flow [2022-07-26 13:44:16,248 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 94 transitions, 200 flow [2022-07-26 13:44:16,248 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 94 transitions, 200 flow [2022-07-26 13:44:16,265 INFO L129 PetriNetUnfolder]: 13/94 cut-off events. [2022-07-26 13:44:16,266 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 13:44:16,267 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 13:44:16,269 INFO L116 LiptonReduction]: Number of co-enabled transitions 1512 [2022-07-26 13:44:18,087 INFO L131 LiptonReduction]: Checked pairs total: 3982 [2022-07-26 13:44:18,087 INFO L133 LiptonReduction]: Total number of compositions: 72 [2022-07-26 13:44:18,101 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2022-07-26 13:44:18,101 INFO L302 stractBuchiCegarLoop]: Hoare is false [2022-07-26 13:44:18,101 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-26 13:44:18,101 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-26 13:44:18,102 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-26 13:44:18,102 INFO L306 stractBuchiCegarLoop]: Difference is false [2022-07-26 13:44:18,102 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-26 13:44:18,102 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-26 13:44:18,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-26 13:44:18,189 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 144 [2022-07-26 13:44:18,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:44:18,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:44:18,193 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-26 13:44:18,193 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 13:44:18,194 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-26 13:44:18,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 243 states, but on-demand construction may add more states [2022-07-26 13:44:18,201 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 144 [2022-07-26 13:44:18,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:44:18,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:44:18,202 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-26 13:44:18,202 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 13:44:18,205 INFO L733 eck$LassoCheckResult]: Stem: 93#[ULTIMATE.startENTRY]don't care [369] ULTIMATE.startENTRY-->L724-3: Formula: (let ((.cse1 (select |v_#memory_int_56| 1)) (.cse0 (store |v_#valid_99| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 1))) (and (= (select |v_#valid_99| 0) 0) (= (store (store |v_#length_60| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4) |v_#length_59|) (= v_~flag1~0_94 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_27| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= |v_#NULL.base_12| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= (select |v_#valid_99| 2) 1) (= (select |v_#valid_99| 1) 1) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (= (store |v_#memory_int_56| |v_ULTIMATE.start_main_~#t1~0#1.base_49| (store (select |v_#memory_int_56| |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_35|)) |v_#memory_int_55|) (= (select |v_#valid_99| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) 0) (= (select .cse1 1) 0) (= 9 (select |v_#length_60| 2)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17| (ite (and (<= 0 v_~turn~0_220) (<= v_~turn~0_220 1)) 1 0)) (= (select .cse1 0) 48) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_39| 0) (= |v_#pthreadsForks_51| (+ |v_#pthreadsForks_52| 1)) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) (= v_~x~0_50 0) (= |v_#NULL.offset_12| 0) (= |v_#pthreadsForks_52| |v_ULTIMATE.start_main_#t~pre3#1_35|) (< 0 |v_#StackHeapBarrier_20|) (= (select |v_#length_60| 1) 2) (= v_~flag2~0_97 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1) |v_#valid_98|) (= v_~turn~0_220 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #pthreadsForks=|v_#pthreadsForks_52|, #valid=|v_#valid_99|, #memory_int=|v_#memory_int_56|, #length=|v_#length_60|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_15|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_18|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_26|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_15|, #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_23|, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_20|, #pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_27|, ~flag2~0=v_~flag2~0_97, #valid=|v_#valid_98|, #memory_int=|v_#memory_int_55|, ~flag1~0=v_~flag1~0_94, #length=|v_#length_59|, ~turn~0=v_~turn~0_220, ~x~0=v_~x~0_50, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_35|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|} 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 [326] 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_25 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_25, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, ~flag1~0, thr1Thread1of1ForFork0_~_.offset] 102#[L694-2, L724-4]don't care [2022-07-26 13:44:18,205 INFO L735 eck$LassoCheckResult]: Loop: 102#[L694-2, L724-4]don't care [327] L694-2-->L694-2: Formula: (and (<= 1 v_~flag2~0_22) (= v_~turn~0_58 0)) InVars {~flag2~0=v_~flag2~0_22, ~turn~0=v_~turn~0_58} OutVars{~flag2~0=v_~flag2~0_22, ~turn~0=v_~turn~0_58} AuxVars[] AssignedVars[] 102#[L694-2, L724-4]don't care [2022-07-26 13:44:18,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:18,208 INFO L85 PathProgramCache]: Analyzing trace with hash 393778, now seen corresponding path program 1 times [2022-07-26 13:44:18,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:18,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314362138] [2022-07-26 13:44:18,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:18,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:18,280 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:44:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:18,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:44:18,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:18,304 INFO L85 PathProgramCache]: Analyzing trace with hash 358, now seen corresponding path program 1 times [2022-07-26 13:44:18,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:18,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663730914] [2022-07-26 13:44:18,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:18,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:18,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:18,310 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:44:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:18,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:44:18,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:18,315 INFO L85 PathProgramCache]: Analyzing trace with hash 12207445, now seen corresponding path program 1 times [2022-07-26 13:44:18,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:18,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686692501] [2022-07-26 13:44:18,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:18,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:44:18,366 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:18,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 13:44:18,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686692501] [2022-07-26 13:44:18,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686692501] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 13:44:18,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 13:44:18,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-26 13:44:18,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661452458] [2022-07-26 13:44:18,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 13:44:18,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 13:44:18,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-26 13:44:18,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-26 13:44:18,401 INFO L87 Difference]: Start difference. First operand currently 243 states, but on-demand construction may add more states Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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:18,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 13:44:18,447 INFO L93 Difference]: Finished difference Result 316 states and 838 transitions. [2022-07-26 13:44:18,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 316 states and 838 transitions. [2022-07-26 13:44:18,452 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 146 [2022-07-26 13:44:18,457 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 316 states to 200 states and 556 transitions. [2022-07-26 13:44:18,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 200 [2022-07-26 13:44:18,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 200 [2022-07-26 13:44:18,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 200 states and 556 transitions. [2022-07-26 13:44:18,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 13:44:18,460 INFO L220 hiAutomatonCegarLoop]: Abstraction has 200 states and 556 transitions. [2022-07-26 13:44:18,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states and 556 transitions. [2022-07-26 13:44:18,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 164. [2022-07-26 13:44:18,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 164 states have (on average 2.823170731707317) internal successors, (463), 163 states have internal predecessors, (463), 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:18,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 463 transitions. [2022-07-26 13:44:18,486 INFO L242 hiAutomatonCegarLoop]: Abstraction has 164 states and 463 transitions. [2022-07-26 13:44:18,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-26 13:44:18,494 INFO L426 stractBuchiCegarLoop]: Abstraction has 164 states and 463 transitions. [2022-07-26 13:44:18,494 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-26 13:44:18,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 164 states and 463 transitions. [2022-07-26 13:44:18,496 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 122 [2022-07-26 13:44:18,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:44:18,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:44:18,496 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-26 13:44:18,496 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 13:44:18,497 INFO L733 eck$LassoCheckResult]: Stem: 1232#[ULTIMATE.startENTRY]don't care [369] ULTIMATE.startENTRY-->L724-3: Formula: (let ((.cse1 (select |v_#memory_int_56| 1)) (.cse0 (store |v_#valid_99| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 1))) (and (= (select |v_#valid_99| 0) 0) (= (store (store |v_#length_60| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4) |v_#length_59|) (= v_~flag1~0_94 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_27| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= |v_#NULL.base_12| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= (select |v_#valid_99| 2) 1) (= (select |v_#valid_99| 1) 1) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (= (store |v_#memory_int_56| |v_ULTIMATE.start_main_~#t1~0#1.base_49| (store (select |v_#memory_int_56| |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_35|)) |v_#memory_int_55|) (= (select |v_#valid_99| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) 0) (= (select .cse1 1) 0) (= 9 (select |v_#length_60| 2)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17| (ite (and (<= 0 v_~turn~0_220) (<= v_~turn~0_220 1)) 1 0)) (= (select .cse1 0) 48) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_39| 0) (= |v_#pthreadsForks_51| (+ |v_#pthreadsForks_52| 1)) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) (= v_~x~0_50 0) (= |v_#NULL.offset_12| 0) (= |v_#pthreadsForks_52| |v_ULTIMATE.start_main_#t~pre3#1_35|) (< 0 |v_#StackHeapBarrier_20|) (= (select |v_#length_60| 1) 2) (= v_~flag2~0_97 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1) |v_#valid_98|) (= v_~turn~0_220 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #pthreadsForks=|v_#pthreadsForks_52|, #valid=|v_#valid_99|, #memory_int=|v_#memory_int_56|, #length=|v_#length_60|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_15|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_18|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_26|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_15|, #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_23|, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_20|, #pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_27|, ~flag2~0=v_~flag2~0_97, #valid=|v_#valid_98|, #memory_int=|v_#memory_int_55|, ~flag1~0=v_~flag1~0_94, #length=|v_#length_59|, ~turn~0=v_~turn~0_220, ~x~0=v_~x~0_50, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_35|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|} 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] 1052#[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] 1054#[thr1ENTRY, L724-4]don't care [352] L724-4-->L725-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_25| 4) (select |v_#length_45| |v_ULTIMATE.start_main_~#t2~0#1.base_29|)) (= (select |v_#valid_70| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_25|) (= |v_#pthreadsForks_36| |v_ULTIMATE.start_main_#t~pre5#1_19|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)) (= (store |v_#memory_int_36| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_36| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_25| |v_ULTIMATE.start_main_#t~pre5#1_19|)) |v_#memory_int_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, #valid=|v_#valid_70|, #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_29|} 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_25|, #valid=|v_#valid_70|, #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_29|, 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] 1128#[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] 1220#[L725-4, thr2ENTRY, thr1ENTRY]don't care [318] thr2ENTRY-->L709-2: Formula: (and (= v_thr2Thread1of1ForFork1_~_.offset_5 |v_thr2Thread1of1ForFork1_#in~_.offset_5|) (= v_~flag2~0_16 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_16, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_.offset, ~flag2~0, thr2Thread1of1ForFork1_~_.base] 976#[L709-2, L725-4, thr1ENTRY]don't care [2022-07-26 13:44:18,497 INFO L735 eck$LassoCheckResult]: Loop: 976#[L709-2, L725-4, thr1ENTRY]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[] 970#[L709, L725-4, thr1ENTRY]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[] 976#[L709-2, L725-4, thr1ENTRY]don't care [2022-07-26 13:44:18,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:18,498 INFO L85 PathProgramCache]: Analyzing trace with hash 378455107, now seen corresponding path program 1 times [2022-07-26 13:44:18,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:18,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334961789] [2022-07-26 13:44:18,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:18,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:18,542 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:44:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:18,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:44:18,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:18,576 INFO L85 PathProgramCache]: Analyzing trace with hash 9028, now seen corresponding path program 1 times [2022-07-26 13:44:18,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:18,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906790183] [2022-07-26 13:44:18,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:18,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:18,586 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:44:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:18,588 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:44:18,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:18,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1376854266, now seen corresponding path program 1 times [2022-07-26 13:44:18,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:18,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887184372] [2022-07-26 13:44:18,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:18,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:44:18,645 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:18,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 13:44:18,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887184372] [2022-07-26 13:44:18,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887184372] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 13:44:18,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 13:44:18,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-26 13:44:18,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322853775] [2022-07-26 13:44:18,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 13:44:18,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 13:44:18,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-26 13:44:18,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-26 13:44:18,654 INFO L87 Difference]: Start difference. First operand 164 states and 463 transitions. cyclomatic complexity: 325 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 13:44:18,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 13:44:18,680 INFO L93 Difference]: Finished difference Result 158 states and 426 transitions. [2022-07-26 13:44:18,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 158 states and 426 transitions. [2022-07-26 13:44:18,682 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 102 [2022-07-26 13:44:18,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 158 states to 144 states and 395 transitions. [2022-07-26 13:44:18,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 144 [2022-07-26 13:44:18,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 144 [2022-07-26 13:44:18,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 395 transitions. [2022-07-26 13:44:18,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 13:44:18,686 INFO L220 hiAutomatonCegarLoop]: Abstraction has 144 states and 395 transitions. [2022-07-26 13:44:18,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 395 transitions. [2022-07-26 13:44:18,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2022-07-26 13:44:18,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 144 states have (on average 2.7430555555555554) internal successors, (395), 143 states have internal predecessors, (395), 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:18,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 395 transitions. [2022-07-26 13:44:18,693 INFO L242 hiAutomatonCegarLoop]: Abstraction has 144 states and 395 transitions. [2022-07-26 13:44:18,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-26 13:44:18,694 INFO L426 stractBuchiCegarLoop]: Abstraction has 144 states and 395 transitions. [2022-07-26 13:44:18,694 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-26 13:44:18,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 144 states and 395 transitions. [2022-07-26 13:44:18,696 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 102 [2022-07-26 13:44:18,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:44:18,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:44:18,696 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-26 13:44:18,696 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 13:44:18,696 INFO L733 eck$LassoCheckResult]: Stem: 1686#[ULTIMATE.startENTRY]don't care [369] ULTIMATE.startENTRY-->L724-3: Formula: (let ((.cse1 (select |v_#memory_int_56| 1)) (.cse0 (store |v_#valid_99| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 1))) (and (= (select |v_#valid_99| 0) 0) (= (store (store |v_#length_60| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4) |v_#length_59|) (= v_~flag1~0_94 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_27| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= |v_#NULL.base_12| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= (select |v_#valid_99| 2) 1) (= (select |v_#valid_99| 1) 1) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (= (store |v_#memory_int_56| |v_ULTIMATE.start_main_~#t1~0#1.base_49| (store (select |v_#memory_int_56| |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_35|)) |v_#memory_int_55|) (= (select |v_#valid_99| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) 0) (= (select .cse1 1) 0) (= 9 (select |v_#length_60| 2)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17| (ite (and (<= 0 v_~turn~0_220) (<= v_~turn~0_220 1)) 1 0)) (= (select .cse1 0) 48) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_39| 0) (= |v_#pthreadsForks_51| (+ |v_#pthreadsForks_52| 1)) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) (= v_~x~0_50 0) (= |v_#NULL.offset_12| 0) (= |v_#pthreadsForks_52| |v_ULTIMATE.start_main_#t~pre3#1_35|) (< 0 |v_#StackHeapBarrier_20|) (= (select |v_#length_60| 1) 2) (= v_~flag2~0_97 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1) |v_#valid_98|) (= v_~turn~0_220 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #pthreadsForks=|v_#pthreadsForks_52|, #valid=|v_#valid_99|, #memory_int=|v_#memory_int_56|, #length=|v_#length_60|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_15|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_18|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_26|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_15|, #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_23|, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_20|, #pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_27|, ~flag2~0=v_~flag2~0_97, #valid=|v_#valid_98|, #memory_int=|v_#memory_int_55|, ~flag1~0=v_~flag1~0_94, #length=|v_#length_59|, ~turn~0=v_~turn~0_220, ~x~0=v_~x~0_50, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_35|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|} 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] 1498#[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] 1500#[thr1ENTRY, L724-4]don't care [352] L724-4-->L725-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_25| 4) (select |v_#length_45| |v_ULTIMATE.start_main_~#t2~0#1.base_29|)) (= (select |v_#valid_70| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_25|) (= |v_#pthreadsForks_36| |v_ULTIMATE.start_main_#t~pre5#1_19|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)) (= (store |v_#memory_int_36| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_36| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_25| |v_ULTIMATE.start_main_#t~pre5#1_19|)) |v_#memory_int_35|)) InVars {#pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, #valid=|v_#valid_70|, #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_29|} 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_25|, #valid=|v_#valid_70|, #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_29|, 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] 1568#[L725-3, thr1ENTRY]don't care [326] 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_25 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_25, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, ~flag1~0, thr1Thread1of1ForFork0_~_.offset] 1626#[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] 1444#[L725-4, thr2ENTRY, L694-2]don't care [318] thr2ENTRY-->L709-2: Formula: (and (= v_thr2Thread1of1ForFork1_~_.offset_5 |v_thr2Thread1of1ForFork1_#in~_.offset_5|) (= v_~flag2~0_16 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_16, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_.offset, ~flag2~0, thr2Thread1of1ForFork1_~_.base] 1434#[L709-2, L725-4, L694-2]don't care [2022-07-26 13:44:18,697 INFO L735 eck$LassoCheckResult]: Loop: 1434#[L709-2, L725-4, L694-2]don't care [327] L694-2-->L694-2: Formula: (and (<= 1 v_~flag2~0_22) (= v_~turn~0_58 0)) InVars {~flag2~0=v_~flag2~0_22, ~turn~0=v_~turn~0_58} OutVars{~flag2~0=v_~flag2~0_22, ~turn~0=v_~turn~0_58} AuxVars[] AssignedVars[] 1434#[L709-2, L725-4, L694-2]don't care [2022-07-26 13:44:18,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:18,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1152764175, now seen corresponding path program 1 times [2022-07-26 13:44:18,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:18,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898385363] [2022-07-26 13:44:18,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:18,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:18,714 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:44:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:18,725 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:44:18,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:18,726 INFO L85 PathProgramCache]: Analyzing trace with hash 358, now seen corresponding path program 2 times [2022-07-26 13:44:18,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:18,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54345463] [2022-07-26 13:44:18,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:18,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:18,730 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:44:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:18,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:44:18,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:18,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1375950730, now seen corresponding path program 1 times [2022-07-26 13:44:18,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:18,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100483257] [2022-07-26 13:44:18,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:18,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:18,745 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:44:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:18,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:44:19,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.07 01:44:19 BoogieIcfgContainer [2022-07-26 13:44:19,446 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-26 13:44:19,447 INFO L158 Benchmark]: Toolchain (without parser) took 4266.28ms. Allocated memory was 177.2MB in the beginning and 264.2MB in the end (delta: 87.0MB). Free memory was 117.6MB in the beginning and 213.4MB in the end (delta: -95.8MB). Peak memory consumption was 122.9MB. Max. memory is 8.0GB. [2022-07-26 13:44:19,447 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 177.2MB. Free memory is still 135.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-26 13:44:19,447 INFO L158 Benchmark]: CACSL2BoogieTranslator took 465.75ms. Allocated memory was 177.2MB in the beginning and 264.2MB in the end (delta: 87.0MB). Free memory was 117.5MB in the beginning and 225.9MB in the end (delta: -108.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-07-26 13:44:19,448 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.20ms. Allocated memory is still 264.2MB. Free memory was 225.9MB in the beginning and 223.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-26 13:44:19,448 INFO L158 Benchmark]: Boogie Preprocessor took 16.81ms. Allocated memory is still 264.2MB. Free memory was 223.8MB in the beginning and 222.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-26 13:44:19,448 INFO L158 Benchmark]: RCFGBuilder took 347.73ms. Allocated memory is still 264.2MB. Free memory was 222.2MB in the beginning and 209.1MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-07-26 13:44:19,449 INFO L158 Benchmark]: BuchiAutomizer took 3396.23ms. Allocated memory is still 264.2MB. Free memory was 209.1MB in the beginning and 213.4MB in the end (delta: -4.3MB). Peak memory consumption was 128.4MB. Max. memory is 8.0GB. [2022-07-26 13:44:19,451 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.11ms. Allocated memory is still 177.2MB. Free memory is still 135.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 465.75ms. Allocated memory was 177.2MB in the beginning and 264.2MB in the end (delta: 87.0MB). Free memory was 117.5MB in the beginning and 225.9MB in the end (delta: -108.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.20ms. Allocated memory is still 264.2MB. Free memory was 225.9MB in the beginning and 223.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.81ms. Allocated memory is still 264.2MB. Free memory was 223.8MB in the beginning and 222.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 347.73ms. Allocated memory is still 264.2MB. Free memory was 222.2MB in the beginning and 209.1MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 3396.23ms. Allocated memory is still 264.2MB. Free memory was 209.1MB in the beginning and 213.4MB in the end (delta: -4.3MB). Peak memory consumption was 128.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.2 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 144 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s 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, 36 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, 38 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38 mSDsluCounter, 66 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 62 IncrementalHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 43 mSDtfsCounter, 62 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.9s - 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, \result={0: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@14078687 in-1,0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@26013f42 in0,0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@3339895=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@38f590f6=0, t1={1747:0}, t2={1746: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 TRUE 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.8s, 88 PlacesBefore, 34 PlacesAfterwards, 94 TransitionsBefore, 38 TransitionsAfterwards, 1512 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 18 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 13 ConcurrentYvCompositions, 2 ChoiceCompositions, 72 TotalNumberOfCompositions, 3982 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2289, positive: 2153, positive conditional: 0, positive unconditional: 2153, negative: 136, negative conditional: 0, negative unconditional: 136, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1079, positive: 1052, positive conditional: 0, positive unconditional: 1052, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1079, positive: 1001, positive conditional: 0, positive unconditional: 1001, negative: 78, negative conditional: 0, negative unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 78, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 72, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2289, positive: 1101, positive conditional: 0, positive unconditional: 1101, negative: 109, negative conditional: 0, negative unconditional: 109, unknown: 1079, unknown conditional: 0, unknown unconditional: 1079] , Statistics on independence cache: Total cache size (in pairs): 235, Positive cache size: 217, Positive conditional cache size: 0, Positive unconditional cache size: 217, 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:19,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...